Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Verifying the Correctness of AADL Modules Using Model Checking
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Reasoning about digital circuits
Reasoning about digital circuits
A framed temporal logic programming language
Journal of Computer Science and Technology
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
An automated approach to specification animation for validation
Journal of Systems and Software
Framed temporal logic programming
Science of Computer Programming
A relation-based method combining functional and structural testing for test case generation
Journal of Systems and Software
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Alternating interval based temporal logics
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Pre-post notation is questionable in effectively specifying operations of object-oriented systems
Frontiers of Computer Science in China
Asynchronous communication in MSVL
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Integrating prototyping into the SOFL three-step modeling approach
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
A cylinder computation model for many-core parallel computing
Theoretical Computer Science
Linear time-dependent constraints programming with MSVL
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
This paper presents a unified model checking approach with Projection Temporal Logic (PTL) based on Normal Form Graphs (NFGs). To this end, a Modeling, Simulation and Verification Language (MSVL) is defined based on PTL. Further, normal forms and NFGs for MSVL programs and Propositional PTL (PPTL) formulas are defined. The finiteness for NFGs of MSVL programs is proved in details. Moreover, by modeling a system with an MSVL program p, and specifying the desirable property of the system with a PPTL formula 茂戮驴, whether or not the system satisfies the property (whether or not p茂戮驴茂戮驴is valid) can equivalently be checked by evaluating whether or not ¬(p茂戮驴茂戮驴) 茂戮驴 p茂戮驴 ¬茂戮驴is unsatisfiable. Finally, the satisfiability of a formula in the form of p茂戮驴 ¬茂戮驴is checked by constructing the NFG of p茂戮驴 ¬茂戮驴, and then inspecting whether or not there exist paths in the NFG.