12774 search results - page 100 / 2555 » A Framework for Proof Systems |
127
click to vote
CCS
2008
ACM
15 years 5 months ago
2008
ACM
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating the proofs which are inherently larg...
139
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
165
Voted
TYPES
1993
Springer
15 years 8 months ago
1993
Springer
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
110
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
126
Voted
JCSS
2010
15 years 2 months ago
2010
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...