Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Model-checking of real-time systems: a telecommunications application: experience report
ICSE '97 Proceedings of the 19th international conference on Software engineering
Formal verification of a superscalar execution unit
DAC '97 Proceedings of the 34th annual Design Automation Conference
Formal verification in a commercial setting
DAC '97 Proceedings of the 34th annual Design Automation Conference
Model checking of hierarchical state machines
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications
IEEE Transactions on Software Engineering
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Application of Formal Analysis to Software in a Fault-Tolerant Environment
IEEE Transactions on Computers
Modular refinement of hierarchic reactive machines
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Composite model-checking: verification with type-specific symbolic representations
ACM Transactions on Software Engineering and Methodology (TOSEM)
Action Language: a specification language for model checking reactive systems
Proceedings of the 22nd international conference on Software engineering
New directions in computer-aided verification
ACM SIGSOFT Software Engineering Notes
Model abstraction for formal verification
Proceedings of the conference on Design, automation and test in Europe
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic (TOCL)
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Predictable programs in barcodes
CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
Model Checking Complete Requirements Specifications Using Abstraction
Automated Software Engineering
Bisimulation Minimization and Symbolic Model Checking
Formal Methods in System Design
And/Or Hierarchies and Round Abstraction
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Parametric Temporal Logic for "Model Measuring"
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Communicating Hierarchical State Machines
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
``Next'' Heuristic for On-the-Fly Model Checking
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking of Message Sequence Charts
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Exploiting Hierarchical Structure for Efficient Formal Verification
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Hierarchical Hybrid Modeling of Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Automated Performance and Dependability Evaluation Using Model Checking
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
A Constraint-Based Framework for Prototyping Distributed Virtual Applications
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Formal Modeling and Analysis of Hybrid Systems: A Case Study in Multi-robot Coordination
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Polyhedral Flows in Hybrid Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Formal Methods For Developing High Assurance Computer Systems: Working Group Report
WIFT '98 Proceedings of the Second IEEE Workshop on Industrial Strength Formal Specification Techniques
Modular refinement of hierarchic reactive machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polyhedral Flows in Hybrid Automata
Formal Methods in System Design
A model-based approach to integrating security policies for embedded devices
Proceedings of the 4th ACM international conference on Embedded software
Encyclopedia of Computer Science
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Counterexample-guided predicate abstraction of hybrid systems
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Verification of analog/mixed-signal circuits using labeled hybrid petri nets
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Verification of scope-dependent hierarchical state machines
Information and Computation
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Hierarchical and recursive state machines with context-dependent properties
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Counter-example guided predicate abstraction of hybrid systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Formalising UML state machines for model checking
UML'99 Proceedings of the 2nd international conference on The unified modeling language: beyond the standard
Linear-time model checking: automata theory in practice
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Bounded model checking for GSMP models of stochastic real-time systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Complexity of compositional model checking of computation tree logic on simple structures
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
BDD-Based hardware verification
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Verification of logic controllers for continuous plants using timed condition/event-system models
Automatica (Journal of IFAC)
Cohesive Coverage Management: Simulation Meets Formal Methods
Journal of Electronic Testing: Theory and Applications
On the complexity of LTL model-checking of recursive state machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.09 |
Theorem proving and model checking are powerful tools that can verify the logical correctness of today's ICs or find their hidden bugs. Today, the first computer-aided verification tools are becoming commercially available. They are based on methods that in many cases can reduce the complexity of verification (without sacrificing guaranteed correctness) to such a degree that it becomes computationally feasible. Among the most powerful of these methods are symbolic model-checking and homomorphic reduction, both of which represent a complex system in terms of a compact and computationally more tractable structure. Moreover, the two can be used together with a multiplicative reduction effect, since they work independently of one another. Of special importance is the fact that they each can be implemented automatically, so the task of reduction is programmed into the computer rather than presenting a burden to the design engineer