Sciweavers

192 search results - page 36 / 39
» Formal Reasoning About Causality Analysis
Sort
View
POPL
2004
ACM
15 years 12 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
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 8 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
POPL
2011
ACM
14 years 2 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
CORR
2002
Springer
131views Education» more  CORR 2002»
14 years 11 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann
UC
2009
Springer
15 years 6 months ago
Computing Domains of Attraction for Planar Dynamics
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Daniel S. Graça, Ning Zhong