Sciweavers

1422 search results - page 145 / 285
» Complementation in Abstract Interpretation
Sort
View
CAV
2010
Springer
192views Hardware» more  CAV 2010»
15 years 10 months ago
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
IMECS
2007
15 years 7 months ago
Approaches to an Adaptive Middleware for Mobile Services
Abstract—Adaptive middleware and wireless networks are hot topics in many discussions today. Literature describes a lot of approaches which are based upon existing middleware tec...
Ulrich Dümichen, Uwe Baumgarten
POPL
2010
ACM
15 years 6 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
POPL
2004
ACM
16 years 6 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 11 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...