Semantic Scholar uses AI to extract papers important to this topic.
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 Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms… Expand This tutorial presents an overview of model checking for both discrete and continuous-time Markov chains (DTMCs and CTMCs). Model… Expand The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been… Expand Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs  have… Expand Symbolic model checking is a powerful formal specification and verification method that has been applied successfully in several… Expand We describe a method for using abstraction to reduce the complexity of temporal-logic model checking. Using techniques similar to… Expand A general method that represents the state space symbolically instead of explicitly is described. The generality of the method… Expand We describe a method for using abstraction to reduce the complexity of temporal logic model checking. The basis of this method is… Expand A method is described for reducing the complexity of temporal logic model checking in systems composed of many parallel processes… Expand