132 search results - page 9 / 27 » Ellipsoidal Techniques for Reachability Analysis |
CONCUR
2006
Springer
14 years 4 days ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
SAS
2000
Springer
13 years 12 months ago
2000
Springer
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...
ICFP
2012
ACM
11 years 10 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...