7 search results - page 1 / 2 » Answer Set Programming and Bounded Model Checking |
200
Voted
CONCUR
2011
Springer
14 years 15 days ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
131
Voted
CONCUR
1997
Springer
15 years 4 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
135
Voted
CONCUR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
149
click to vote
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
105
click to vote
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...