4099 search results - page 22 / 820 » A Framework for Interactive Proof |
MSCS
2007
14 years 9 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
ACSC
2008
IEEE
15 years 4 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...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
70
Voted
PST
2008
14 years 11 months ago
2008
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating and storing the proofs which are inh...
TABLEAUX
1995
Springer
15 years 1 months ago
1995
Springer
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...