Sciweavers

79 search results - page 1 / 16
» Full Abstraction and the Context Lemma
Sort
View
56
Voted
TACS
1991
Springer
15 years 1 months ago
Full Abstraction and the Context Lemma
Trevor Jim, Albert R. Meyer
FMCAD
2008
Springer
14 years 11 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
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...
Jesse D. Bingham
LICS
1993
IEEE
15 years 2 months ago
Full Abstraction for a Shared Variable Parallel Language
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...
Stephen D. Brookes
ACTA
2010
87views more  ACTA 2010»
14 years 10 months ago
On the observational theory of the CPS-calculus
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...
Massimo Merro
TPHOL
2007
IEEE
15 years 4 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
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...
Brigitte Pientka