103 search results - page 12 / 21 » Algebraic Methods for Interactive Proof Systems |
TYPES
1995
Springer
13 years 11 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
VSTTE
2005
Springer
14 years 1 months ago
2005
Springer
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
TCS
2002
13 years 7 months ago
2002
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
ACSC
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we examine the composition of firstclass protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agent...