79 search results - page 1 / 16 » Full Abstraction and the Context Lemma |
TACS
1991
Springer
13 years 11 months ago
1991
Springer
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
LICS
1993
IEEE
13 years 11 months ago
1993
IEEE
traction for a Shared Variable Parallel Language Stephen Brookes∗ School of Computer Science Carnegie Mellon University Pittsburgh, Pa 15213 We give a new denotational semantics...
ACTA
2010
13 years 7 months ago
2010
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...