12774 search results - page 128 / 2555 » A Framework for Proof Systems |
135
click to vote
CONCUR
2003
Springer
15 years 9 months ago
2003
Springer
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
127
click to vote
CATS
2006
15 years 5 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...
147
Voted
CAV
1998
Springer
15 years 8 months ago
1998
Springer
An implementation of an out-of-order processing unit based on Tomasulo's algorithm is formally verified using compositional model checking techniques. This demonstrates that f...
128
click to vote
CTCS
1997
Springer
15 years 8 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
118
click to vote
COCO
1994
Springer
15 years 8 months ago
1994
Springer
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...