662 search results - page 17 / 133 » Model Checking Procedures for Infinite State Systems |
CAV
2005
Springer
15 years 3 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
73
Voted
FORMATS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
ATVA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
SPIN
2001
Springer
15 years 1 months ago
2001
Springer
This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking distributed systems with several instances of t...
183
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...