Sciweavers

3228 search results - page 121 / 646
» Computationally Sound Proofs
Sort
View
TPHOL
2003
IEEE
14 years 3 months ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
POPL
2005
ACM
14 years 10 months ago
Environmental acquisition revisited
In 1996, Gil and Lorenz proposed programming language constructs for specifying environmental acquisition in addition to inheritance acquisition for objects. They noticed that in ...
Richard Cobbe, Matthias Felleisen
TIME
2009
IEEE
14 years 4 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
ESOP
2006
Springer
14 years 1 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
STACS
2005
Springer
14 years 3 months ago
Quantum Interactive Proofs with Competing Provers
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
Gus Gutoski, John Watrous