Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Viewing scheduling as an opportunistic problem-solving process
Annals of Operations Research
Handbook of theoretical computer science (vol. B)
Artificial Intelligence
Efficient memory-bounded search methods
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Artificial Intelligence
Theoretical Computer Science
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
High-density reachability analysis
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Validation with guided search of the state space
DAC '98 Proceedings of the 35th annual Design Automation Conference
Symbolic guided search for CTL model checking
Proceedings of the 37th Annual Design Automation Conference
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
Partial-Order Reduction in Symbolic State-Space Exploration
Formal Methods in System Design - Special issue on CAV '97
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Encyclopedia of Artificial Intelligence
Encyclopedia of Artificial Intelligence
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Symbolic Heuristic Search Using Decision Diagrams
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Verification and Optimization of a PLC Control Schedule
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Eliminating Redundant Interleavings During Concurrent Program Verification
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
Efficient Guiding Towards Cost-Optimality in UPPAAL
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Hints to accelerate Symbolic Traversal
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Error Detection with Directed Symbolic Model Checking
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
µcke - Efficient µ-Calculus Model Checking
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
SetA*: an efficient BDD-based heuristic search algorithm
Eighteenth national conference on Artificial intelligence
Scheduling a Steel Plant with Timed Automata
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
The harpy speech recognition system.
The harpy speech recognition system.
The argos image understanding system.
The argos image understanding system.
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Efficient reduction of finite state model checking to reachability analysis
International Journal on Software Tools for Technology Transfer (STTT)
Scheduling Acyclic Branching Programs on Parallel Machines
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Journal of the ACM (JACM)
Compositional SCC Analysis for Language Emptiness
Formal Methods in System Design
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
The Design of a Multicore Extension of the SPIN Model Checker
IEEE Transactions on Software Engineering
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Distributed Extended Beam Search for Quantitative Model Checking
Model Checking and Artificial Intelligence
Semi-external LTL Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Dynamic Delayed Duplicate Detection for External Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Layered Duplicate Detection in External-Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Debugging of Dependability Models Using Interactive Visualization of Counterexamples
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Flash-Efficient LTL Model Checking with Minimal Counterexamples
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Cost-algebraic heuristic search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Solving scheduling problems by untimed model checking: The clinical chemical analyser case study
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on FMICS 05
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Counterexamples in probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
UPPAAL/DMC: abstraction-based heuristics for directed model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Optimal scheduling using branch and bound with SPIN 4.0
SPIN'03 Proceedings of the 10th international conference on Model checking software
Generating counter-examples through randomized guided search
Proceedings of the 14th international SPIN conference on Model checking software
Providing evidence of likely being on time: counterexample generation for CTMC model checking
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Pruning state spaces with extended beam search
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Characterizing the performance of flash memory storage devices and its impact on algorithm design
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
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
Counterexamples for timed probabilistic reachability
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Extended directed search for probabilistic timed reachability
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Shortest counterexamples for symbolic model checking of LTL with past
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Adapting an AI planning heuristic for directed model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Hierarchical Adaptive State Space Caching Based on Level Sampling
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Flash memory efficient LTL model checking
Science of Computer Programming
Context-enhanced directed model checking
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Abstractions and pattern databases: the quest for succinctness and accuracy
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Randomized backtracking in state space traversal
Proceedings of the 18th international SPIN conference on Model checking software
Mcta: heuristics and search for timed systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Hi-index | 0.00 |
This article surveys and gives historical accounts to the algorithmic essentials of directed model checking , a promising bug-hunting technique to mitigate the state explosion problem. In the enumeration process, successor selection is prioritized. We discuss existing guidance and methods to automatically generate them by exploiting system abstractions. We extend the algorithms to feature partial-order reduction and show how liveness problems can be adapted by lifting the search space. For deterministic, finite domains we instantiate the algorithms to directed symbolic, external and distributed search. For real-time domains we discuss the adaption of the algorithms to timed automata and for probabilistic domains we show the application to counterexample generation. Last but not least, we explain how directed model checking helps to accelerate finding solutions to scheduling problems.