9 search results - page 1 / 2 » Proving Bounds for Real Linear Programs in Isabelle HOL |
TPHOL
2005
IEEE
13 years 10 months ago
2005
IEEE
ESOP
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
JAR
2008
13 years 4 months ago
2008
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...
POPL
2007
ACM
14 years 5 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
ESOP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...