The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
An Analysis of Bitstate Hashing
Formal Methods in System Design
Symbolic guided search for CTL model checking
Proceedings of the 37th Annual Design Automation Conference
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Slicing Software for Model Construction
Higher-Order and Symbolic Computation
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
Formal Methods in System Design
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic Model Checking
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
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
Slicing Programs with Arbitrary Control-flow
AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Automatic abstraction in model checking
Automatic abstraction in model checking
Software Model Checking: The VeriSoft Approach
Formal Methods in System Design
A counterexample guided abstraction refinement framework for verifying concurrent c programs
A counterexample guided abstraction refinement framework for verifying concurrent c programs
Systems Specification by Basic Protocols
Cybernetics and Systems Analysis
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
Formal Methods in System Design
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
The software model checker Blast: Applications to software engineering
International Journal on Software Tools for Technology Transfer (STTT)
Hybrid CEGAR: combining variable hiding and predicate abstraction
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
VCEGAR: Verilog counterexample guided abstraction refinement
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
| Hi-index | 0.00 |
A method for constructing abstractions to improve the efficiency of checking formal models is described. The state equivalence relation is weakened by ignoring insignificant attribute values. Some examples of experimental results illustrate the decrease in the verification complexity from exponential to polynomial.