566 search results - page 7 / 114 » Array Abstractions from Proofs |
GI
2004
Springer
14 years 26 days ago
2004
Springer
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
BIRTHDAY
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
EKAW
2006
Springer
13 years 11 months ago
2006
Springer
Guidelines (Extended abstract) Ruud Stegers1 , Annette ten Teije1 , and Frank van Harmelen1 Vrije Universiteit, Amsterdam The main problem encountered when starting verification of...
ENGL
2007
13 years 7 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...