12774 search results - page 270 / 2555 » A Framework for Proof Systems |
201
click to vote
ENTCS
2006
15 years 6 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
167
click to vote
STOC
2010
ACM
16 years 4 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...
162
click to vote
FSTTCS
2004
Springer
16 years 2 days ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
166
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
173
click to vote
FLAIRS
2000
15 years 8 months ago
2000
To date, there is little evidence that modular reasoning about fault-tolerant systems can simplify the verification process in practice. We study this question using a prominent e...