Sciweavers

63 search results - page 10 / 13
» Verification of Liveness Properties Using Compositional Reac...
Sort
View
POPL
2005
ACM
14 years 7 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
POPL
2007
ACM
14 years 7 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 8 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 7 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
CSFW
2004
IEEE
13 years 10 months ago
Secure Information Flow by Self-Composition
Non-interference is a high-level security property that guarantees the absence of illicit information leakages through executing programs. More precisely, non-interference for a p...
Gilles Barthe, Pedro R. D'Argenio, Tamara Rezk