1101 search results - page 79 / 221 » Forcing in proof theory |
133
Voted
MST
2011
14 years 7 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
STTT
2010
14 years 7 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: ...
114
click to vote
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
118
click to vote
CORR
2010
Springer
15 years 20 days ago
2010
Springer
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 calculus...
PLSA
1994
15 years 4 months ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...