Sciweavers

799 search results - page 131 / 160
» A Logic for Abstract State Machines
Sort
View
ASM
2004
ASM
15 years 7 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
POPL
2009
ACM
16 years 2 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
DAGSTUHL
2007
15 years 3 months ago
Parallel universes to improve the diagnosis of cardiac arrhythmias
arrhythmias (extended abstract) Elisa Fromont, Ren´e Quiniou, Marie-Odile Cordier We are interested in using parallel universes to learn interpretable models that can be subseque...
Élisa Fromont, Rene Quiniou, Marie-Odile Co...
POPL
2007
ACM
16 years 2 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
CORR
2002
Springer
131views Education» more  CORR 2002»
15 years 1 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