Results 1  10
of
10
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
(Show Context)
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Symmetry and Model Checking
, 1994
"... We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model ch ..."
Abstract

Cited by 207 (16 self)
 Add to MetaCart
We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model checking. 1 Introduction In this paper, we show how to exploit symmetry in model checking. We focus on systems composed of many identical (isomorphic) processes. The global state transition graph M of such a system exhibits a great deal of symmetry, characterized by the group of graph automorphisms of M. The basic idea underlying our method is to reduce model checking over the original structure M, to model checking over a smaller quotient structure M, where symmetric states are identified. In the following paragraphs, we give a more detailed but still informal account of a "grouptheoretic" approach to exploiting symmetry. More precisely, the symmetry of M is reflected in the group, Aut M...
Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automatatheoretic Approach
, 1999
"... ..."
Model checking and the Mucalculus
 DIMACS Series in Discrete Mathematics
, 1997
"... There is a growing recognition of the need to apply formal mathematical methods in the design of "high confidence" computing systems. Such systems operate in safety critical contexts (e.g., air traffic control systems) or where errors could have major adverse economic consequences (e.g., ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
There is a growing recognition of the need to apply formal mathematical methods in the design of "high confidence" computing systems. Such systems operate in safety critical contexts (e.g., air traffic control systems) or where errors could have major adverse economic consequences (e.g., banking networks). The problem is especially acute in the design of many reactive systems which must exhibit correct ongoing behavior, yet are not amenable to thorough testing due to their inherently nondeterministic nature. One useful approach for specifying and reasoning about correctness of such systems is temporal logic model checking, which can provide an efficient and expressive tool for automatic verification that a finite state system meets a correctness specification formulated in temporal logic. We describe model checking algorithms and discuss their application. To do this, we focus attention on a particularly important type of temporal logic known as the Mucalculus.
Automated Temporal Reasoning about Reactive Systems
, 1996
"... . There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective a ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
(Show Context)
. There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective and reliable means of specifying and ensuring correct behavior of such systems. This paper discusses known complexity and expressiveness results for a number of such logics in common use and describes key technical tools for obtaining essentially optimal mechanical reasoning algorithms. However, the emphasis is on underlying intuitions and broad themes rather than technical intricacies. 1 Introduction There is a growing need for reliable methods of designing correct reactive systems. These systems are characterized by ongoing, typically nonterminating and highly nondeterministic behavior. Examples include operating systems, network protocols, and air traffic control systems. There is w...
OntheFly Model checking under Fairness that Exploits Symmetry
 CAV97, LNCS 1254
, 1997
"... . An onthefly algorithm for model checking under fairness is presented. The algorithm utilizes symmetry in the program to reduce the state space, and employs novel techniques that make the onthefly model checking feasible. The algorithm uses state symmetry and eliminates parallel edges in the re ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
. An onthefly algorithm for model checking under fairness is presented. The algorithm utilizes symmetry in the program to reduce the state space, and employs novel techniques that make the onthefly model checking feasible. The algorithm uses state symmetry and eliminates parallel edges in the reachability graph. Experimental results demonstrating dramatic reductions in both the running time and memory usage are presented. Keywords: Model checking, State explosion, Symmetry reduction, Automata, Verification 1. Introduction The state explosion problem is one of the major bottlenecks in temporal logic model checking. Many techniques have been proposed in the literature [6, 5, 9, 8, 13, 11, 12, 16, 17] for combating this problem. Among these, symmetry based techniques have been proposed in [5, 9, 13]. In these methods the state space of a program is collapsed by identifying states that are equivalent under symmetry and model checking is performed on the reduced graph. Although the ini...
SMC: A SymmetryBased Model Checker for Verification of Safety and Liveness Properties
 ACM Transactions on Software Engineering Methodologies, Vol 9, No
, 1999
"... ..."
SMC: A Symmetry Based Model Checker for Verification of Safety and Liveness Properties
 ACM Transactions on Software Engineering Methodologies, Vol 9, No
, 1999
"... The paper presents the SMC system for checking safety and liveness properties of concurrent programs under different fairness assumptions. It is based on explicit state enumeration; it combats the state explosion problem by utilizing symmetries of the input concurrent program usually present in the ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
The paper presents the SMC system for checking safety and liveness properties of concurrent programs under different fairness assumptions. It is based on explicit state enumeration; it combats the state explosion problem by utilizing symmetries of the input concurrent program usually present in the form of identical processes. It reduces the number of explored states by identifying those states that are equivalent under the symmetries of the system; this is called process symmetry. It reduces the number of edges explored from each state by exploiting the symmetry of a single state, called state symmetry. SMC works in an onthefly manner, it constructs the reduced state graph as and when it is needed. This method facilitates early termination, speeds up modelchecking and reduces memory requirements. We employed SMC to check the correctness of, among other standard examples, the Link Layer part of the IEEE Standard 1394 "Firewire" highspeed serial bus protocol. SMC found some deadlock...
Descriptive Complexity and Finite Models
"... This paper introduces algebraic proof systems for the propositional calculus. We present new results concerning the relative efficiency of these systems, and also survey what is currently known. Many open problems are presented. 1 Introduction A fundamental problem in logic and computer science is ..."
Abstract
 Add to MetaCart
This paper introduces algebraic proof systems for the propositional calculus. We present new results concerning the relative efficiency of these systems, and also survey what is currently known. Many open problems are presented. 1 Introduction A fundamental problem in logic and computer science is understanding the efficiency of propositional proof systems. It has been known for a long time that NP = coNP if and only if there exists an efficient propositional proof system, but despite 25 years of research, this problem is still not resolved. (See [46] for an excellent survey of this area.) The intention of the present article is to introduce a new algebraic approach to this problem. Our proof systems are simpler than classical proof systems, and purely algebraic. It is our hope that by studying proof complexity in this light, that new upper and lower bound techniques may emerge. The use of the Nullstellensatz for propositional refutations may have been first suggested in a paper by Lo...
unknown title
"... Both software specifications and their intended properties can be expressed in a simple relational language. The claim that a specification satisfies a property becomes a relational formula that can be checked automatically by enumerating the formula’s interpretations. Because the number of interpre ..."
Abstract
 Add to MetaCart
Both software specifications and their intended properties can be expressed in a simple relational language. The claim that a specification satisfies a property becomes a relational formula that can be checked automatically by enumerating the formula’s interpretations. Because the number of interpretations is usually huge, this approach has not been thought to be practical. But by eliminating isomorphic interpretations, the enumeration can be reduced substantially, with a factor of roughly k! contributed by each type of k elements.