Model checking
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
A Compositional Sweep-Line State Space Exploration Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Verification of a Revised WAP Wireless Transaction Protocol
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
More efficient on-the-fly LTL verification with Tarjan's algorithm
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Checking safety properties on-the-fly with the sweep-line method
International Journal on Software Tools for Technology Transfer (STTT)
International Journal on Software Tools for Technology Transfer (STTT)
ASAP: An Extensible Platform for State Space Analysis
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Electronic Notes in Theoretical Computer Science (ENTCS)
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
BEEM: benchmarks for explicit model checkers
Proceedings of the 14th international SPIN conference on Model checking software
Revisiting resistance speeds up I/O-efficient LTL model checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Search-order independent state caching
Transactions on Petri nets and other models of concurrency IV
Sweep-Line analysis of TCP connection management
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Partial-Order reduction for general state exploring algorithms
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Exploiting equivalence reduction and the sweep-line method for detecting terminal states
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Stubborn sets for simple linear time properties
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Hybrid on-the-fly LTL model checking with the sweep-line method
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
| Hi-index | 0.00 |
The sweep-line method allows explicit state model checkers to delete states from memory on-the-fly during state space exploration, thereby lowering the memory demands of the verification procedure. The sweep-line method is based on a least-progress-first search order that prohibits the immediate use of standard on-the-fly Büchi automata-based model checking algorithms that rely on a depth-first search order in the search for an acceptance cycle. This paper proposes and experimentally evaluates an algorithm for Büchi automata-based model checking compatible with the search order and deletion of states prescribed by the sweep-line method.