TPHOL
2005
IEEE
13 years 10 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...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract. Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure in...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...