Sciweavers

18 search results - page 2 / 4
» tphol 2005
Sort
View
TPHOL
2005
IEEE
13 years 11 months ago
Proof Pearl: A Formal Proof of Higman's Lemma in ACL2
Francisco-Jesús Martín-Mateos, Jos&e...
TPHOL
2005
IEEE
13 years 11 months ago
Verifying a Secure Information Flow Analyzer
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...
David A. Naumann
TPHOL
2005
IEEE
13 years 11 months ago
Shallow Lazy Proofs
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our appr...
Hasan Amjad
TPHOL
2005
IEEE
13 years 11 months ago
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
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...
Michael Norrish, Konrad Slind
TPHOL
2005
IEEE
13 years 11 months ago
Axiomatic Constructor Classes in Isabelle/HOLCF
We have definitionally extended Isabelle/HOLCF to support axiomatic Haskell-style constructor classes. We have subsequently defined the functor and monad classes, together with t...
Brian Huffman, John Matthews, Peter White