827 search results - page 113 / 166 » Proof-Theoretic Soundness and Completeness |
213
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
101
Voted
COORDINATION
2009
Springer
16 years 1 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
CHI
2003
ACM
16 years 1 months ago
2003
ACM
Mobile and wearable computers present input/output problems due to limited screen space and interaction techniques. When mobile, users typically focus their visual attention on na...
223
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
99
Voted
CADE
2004
Springer
16 years 1 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...