777 search results - page 41 / 156 » Model Checking with Formula-Dependent Abstract Models |
KBSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
TACAS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
ITA
2007
14 years 9 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchron...