13 search results - page 2 / 3 » Higher-Order Abstract Syntax in Isabelle HOL |
APLAS
2001
ACM
14 years 6 days ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted first-order abstract syntax with variable names so that the formalizati...
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
TPHOL
2002
IEEE
14 years 1 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
TPHOL
2009
IEEE
14 years 3 months ago
2009
IEEE
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding ...