1894 search results - page 84 / 379 » A TLA Proof System |
111
click to vote
CAV
1998
Springer
15 years 5 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...
99
Voted
CTCS
1997
Springer
15 years 4 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 ...
COCO
1994
Springer
15 years 4 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...
86
Voted
ECCC
2006
15 years 23 days ago
2006
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
186
Voted
ESOP
2011
Springer
14 years 4 months ago
2011
Springer
We develop and prove sound a concurrent separation logic for a language with Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is...