Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Model checking

Known as: Symbolic Model Verification, Modelchecking, Model checking (disambiguation) 
In computer science, model checking or property checking refers to the following problem:Given a model of a system, exhaustively and automatically… Expand
Wikipedia

Related topics

Related topics

50 relations
ACM Turing AwardAbstract interpretationAbstraction (software engineering)Abstraction model checking
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Model checking
Turing Lecture from the winners of the 2007 ACM A.M. Turing Award. In 1981, Edmund M. Clarke and E. Allen Emerson, working in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2008
Highly Cited
2008
Principles of model checking
Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms… Expand
Review
2007
Review
2007
Stochastic Model Checking
This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs). Model… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been… Expand
  • figure 1
Highly Cited
1999
Highly Cited
1999
Symbolic Model Checking without BDDs
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
1996
Highly Cited
1996
Symbolic Model Checking
Symbolic model checking is a powerful formal specification and verification method that has been applied successfully in several… Expand
Highly Cited
1994
Highly Cited
1994
Model checking and abstraction
We describe a method for using abstraction to reduce the complexity of temporal-logic model checking. Using techniques similar to… Expand
  • figure 1
  • figure 2
  • figure 6
  • figure 5
Highly Cited
1992
Highly Cited
1992
Symbolic Model Checking: 10^20 States and Beyond
A general method that represents the state space symbolically instead of explicitly is described. The generality of the method… Expand
Highly Cited
1992
Highly Cited
1992
Model checking and abstraction
We describe a method for using abstraction to reduce the complexity of temporal logic model checking. The basis of this method is… Expand
  • figure 1
  • figure 2
  • figure 6
  • figure 5
Highly Cited
1989
Highly Cited
1989
Compositional model checking
A method is described for reducing the complexity of temporal logic model checking in systems composed of many parallel processes… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE