Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Communication and Concurrency
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Action versus State based Logics for Transition Systems
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Efficient Debugging in a Formal Verification Environment
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Modelling Transition Systems within an Action Based Logic
Modelling Transition Systems within an Action Based Logic
Implementation of Epistemic Operators for Model Checking Multi-agent Systems
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
| Hi-index | 0.00 |
The automatic detection of unreachable coverage goals and generation of tests for ''corner-case'' scenarios is crucial to make testing and simulation based verification more effective. In this paper we address the problem of coverability analysis and test case generation in modular and component based systems. We propose a technique that, given an uncovered branch in a component, either establishes that the branch cannot be covered or produces a test case at the system level which covers the branch. The technique is based on the use of counterexamples returned by model checkers, and exploits compositionality to cope with large state spaces typical of real applications.