Sciweavers

17 search results - page 1 / 4
» Imperative Functional Programming with Isabelle HOL
Sort
View
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,...
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 2 months ago
Recursive Definitions of Monadic Functions
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
Alexander Krauss
ENTCS
2008
140views more  ENTCS 2008»
13 years 4 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
CADE
2003
Springer
14 years 4 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
PPDP
2009
Springer
13 years 11 months ago
An Isabelle/HOL-based model of stratego-like traversal strategies
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
Markus Kaiser, Ralf Lämmel