34 search results - page 7 / 7 » Automated Theorem Proving in a Simple Meta-Logic for LF |
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
CAV
2001
Springer
13 years 10 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
LICS
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
NMR
2004
Springer
13 years 11 months ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...