28 search results - page 4 / 6 » Verifying Heap-Manipulating Programs with Unknown Procedure ... |
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...