3658 search results - page 190 / 732 » The logic of proofs, semantically |
171
click to vote
CADE
1999
Springer
15 years 11 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
158
click to vote
CATS
2006
15 years 8 months ago
2006
In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source progr...
166
click to vote
APAL
1999
15 years 6 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
176
click to vote
STTT
2010
15 years 1 months ago
2010
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
216
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...