150 search results - page 29 / 30 » Symbolic Model Checking for Simply-Timed Systems |
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
ATVA
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
FROCOS
2005
Springer
14 years 27 days ago
2005
Springer
Interface formalisms are able to model both the input requirements and the output behavior of system components; they support both bottom-up component-based design, and top-down de...
QEST
2007
IEEE
14 years 1 months ago
2007
IEEE
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...