Handbook of theoretical computer science (vol. B)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Principles of the Spin Model Checker
Principles of the Spin Model Checker
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
| Hi-index | 0.00 |
We propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequences of transitions) that should never occur. In semantics, it is neither similar to never claim and trace assertion, nor a simple combination of them. Furthermore, the theoretical foundation for checking nevertrace claims, namely the Asynchronous-Composition Büchi Automaton Control System (AC-BAC System), is proposed. The major contributions of the nevertrace claim include: a powerful construct for formalizing properties related to transitions and their labels, and a way for reducing the state space at the design stage.