Sciweavers

TPHOL
2008
IEEE
13 years 10 months ago
A Compiled Implementation of Normalization by Evaluation
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrit...
Klaus Aehlig, Florian Haftmann, Tobias Nipkow
TPHOL
2008
IEEE
13 years 10 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy
TPHOL
2008
IEEE
13 years 10 months ago
Secure Microkernels, State Monads and Scalable Refinement
David Cock, Gerwin Klein, Thomas Sewell
TPHOL
2008
IEEE
13 years 10 months ago
Imperative Functional Programming with Isabelle/HOL
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...
TPHOL
2008
IEEE
13 years 10 months ago
Lightweight Separation
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
Holger Gast
TPHOL
2008
IEEE
13 years 10 months ago
A Brief Overview of PVS
Sam Owre, Natarajan Shankar
TPHOL
2008
IEEE
13 years 10 months ago
The Isabelle Framework
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...
Makarius Wenzel, Lawrence C. Paulson, Tobias Nipko...