Sciweavers

17 search results - page 3 / 4
» Imperative Functional Programming with Isabelle HOL
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 3 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
FMICS
2009
Springer
13 years 9 months ago
A Certified Implementation on Top of the Java Virtual Machine
Abstract. Safe is a first-order functional language with unusual memory management features: memory can be both explicitly and implicitly deallocated at some specific points in the...
Javier de Dios, Ricardo Peña-Marí
JAR
2008
105views more  JAR 2008»
13 years 5 months ago
Proof Synthesis and Reflection for Linear Arithmetic
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
Amine Chaieb, Tobias Nipkow
FSTTCS
1999
Springer
13 years 9 months ago
Hoare Logic for Mutual Recursion and Local Variables
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
David von Oheimb
FLOPS
2010
Springer
14 years 3 days ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow