1894 search results - page 6 / 379 » A TLA Proof System |
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin exte...
CSL
2007
Springer
14 years 4 months ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
ICCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
CAV
2012
Springer
12 years 24 days ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...