Results 11  20
of
44
A Partial Order Approach to Branching Time Logic Model Checking
 Information and Computation
, 1994
"... Partial order techniques enable reducing the size of the state graph used for model checking, thus alleviating the `state space explosion' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implem ..."
Abstract

Cited by 61 (14 self)
 Add to MetaCart
(Show Context)
Partial order techniques enable reducing the size of the state graph used for model checking, thus alleviating the `state space explosion' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented and demonstrated for assertional languages that model the executions of a program as computation sequences, in particular the logic LTL (linear temporal logic). The present paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree. We study here partial order reductions for branching temporal logics, e.g., the logics CTL and CTL (all logics with the nexttime operator removed) and process algebras such as CCS. Conditions on the subset of successors from each node to guarantee reduction that preserves CTL properties are given. Provided experimental results show that the reduction is substantial. 1 Introduction Partial ord...
Verification of Concurrent Programs: The AutomataTheoretic Framework
 Annals of Pure and Applied Logic
, 1987
"... We present an automatatheoretic framework to the verification of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P . Now P is c ..."
Abstract

Cited by 51 (3 self)
 Add to MetaCart
We present an automatatheoretic framework to the verification of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P . Now P is correct if and only if a program PA , obtained by combining P and A, terminates. We formalize this idea in a framework of !automata with a recursive set of states. This unifies previous works on verification of fair termination and verification of temporal properties. 1 Introduction In this paper we present an automatatheoretic framework that unifies several trends in the area of concurrent program verification. The trends are temporal logic, model checking, automata theory, and fair termination. Let us start with a survey of these trends. In 1977 Pnueli suggested the use of temporal logic in the verification of concurrent programs [Pn77]. The basic motivation is that in the verificat...
Modelchecking of causality properties
 In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS
, 1995
"... ..."
Verification by Augmented Finitary Abstraction
 Information and Computation
, 1999
"... . The paper deals with the proof method of verification by finitary abstraction (vfa), which presents a feasible approach to the verification of the temporal properties of (potentially infinitestate) reactive systems. The method consists of a twostep process by which, in a first step, the system a ..."
Abstract

Cited by 36 (11 self)
 Add to MetaCart
(Show Context)
. The paper deals with the proof method of verification by finitary abstraction (vfa), which presents a feasible approach to the verification of the temporal properties of (potentially infinitestate) reactive systems. The method consists of a twostep process by which, in a first step, the system and its temporal specification are jointly abstracted into a finitestate system and a finitestate specification. The second step uses model checking to establish the validity of the abstracted property over the abstracted system. The vfa method can be considered as a viable alternative to verification by temporal deduction which, up to now, has been the main method generally applicable for verification of infinitestate systems. The paper presents a general recipe for the joint abstraction, which is shown to be sound , where soundness means that validity over the abstract system implies validity over the concrete (original) system. To make the method applicable for the verification of liven...
Parametric Temporal Logic for "Model Measuring"
, 1999
"... ; F.3.1 [Logics and Meanings of Programs]: Specifying,Verifying and Reasoning about Programslogics of programs General Terms: Theory, Verification Additional Key Words and Phrases: Model checking, quantitative analysis, temporal logic A preliminary version of this paper appeared in ICALP' ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
; F.3.1 [Logics and Meanings of Programs]: Specifying,Verifying and Reasoning about Programslogics of programs General Terms: Theory, Verification Additional Key Words and Phrases: Model checking, quantitative analysis, temporal logic A preliminary version of this paper appeared in ICALP'99: Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 1644, pp. 159168, SpringerVerlag, 1999. This work was partially supported by NSF CAREER award CCR9734115, by DARPA/NASA grant NAG21214, by SRC contract 99TJ688, and by an Alfred P. Sloan Faculty Fellowship. Authors' addresses: R. Alur and S. La Torre: Dept. of Computer and Information Science, University of Pennsylvania, 200 South 33rd St., Philadelphia, PA 19104, email: falur,latorreg@cis.upenn.edu; K. Etessami and D. Peled: Bell Labs, 700 Mountain Ave., Murray Hill, NJ 079
The Parameterized Complexity of Some Problems in Logic and Linguistics (Extended Abstract)
 Proceedings Symposium on Logical Foundations of Computer Science (LFCS), SpringerVerlag, Lecture Notes in Computer Science
, 2002
"... March 1, 2002 Rodney G. Downey Department of Mathematics, Victoria University P.O. Box 600, Wellington, New Zealand downey@math.vuw.ac.nz Michael R. Fellows, Bruce M. Kapron and Michael T. Hallett Department of Computer Science, University of Victoria Victoria, British Columbia V8W 3P6 Canada ..."
Abstract

Cited by 29 (19 self)
 Add to MetaCart
(Show Context)
March 1, 2002 Rodney G. Downey Department of Mathematics, Victoria University P.O. Box 600, Wellington, New Zealand downey@math.vuw.ac.nz Michael R. Fellows, Bruce M. Kapron and Michael T. Hallett Department of Computer Science, University of Victoria Victoria, British Columbia V8W 3P6 Canada contact author: mfellows@csr.uvic.ca H. Todd Wareham Department of Computer Science Memorial University of Newfoundland St. Johns, Newfoundland A1C 5S7 Canada harold@odie.cs.mun.ca Summary The theory of parameterized computational complexity introduced in [DF13] appears to be of wide applicability in the study of the complexity of concrete problems [ADF,BFH,DEF,FHW,FK]. We believe the theory may be of particular importance to practical applications of logic formalisms in programming language design and in system specification. The reason for this relevance is that while many computational problems in logic are extremely intractable generally, realistic applications often involve a "hidden parameter" according to which the computational problem may be feasible according to the more sensitive criteria of fixedparameter tractability that is the central issue in parameterized computational complexity. We illustrate how this theory may apply to problems in logic, programming languages and linguistics by describing some examples of both tractability and intractability results in these areas. It is our strong expectation that these results are just the tip of the iceberg of interesting applications of parameterized complexity theory to logic and linguistics. The main results described in this abstract are as follows. (1) The problem of determining whether a word x can be derived in k steps in a contextsensitive grammar G (Short CSL Derivation) is complete for the paramet...
Safety Property Verification of ESTEREL Programs and Applications to Telecommunications Software
 In Proceedings of the 7th International Conference on Computer Aided Verification, Volume 939 of the Lecture Notes in Computer Science
, 1996
"... . We present a technique for automatically verifying lineartime temporal logic safety properties of programs written in ESTEREL, a formallydefined language for programming reactive systems. In our approach, lineartime temporal logic safety properties are first translated into ESTEREL programs ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
. We present a technique for automatically verifying lineartime temporal logic safety properties of programs written in ESTEREL, a formallydefined language for programming reactive systems. In our approach, lineartime temporal logic safety properties are first translated into ESTEREL programs that model these properties. Using the ESTEREL compiler, the translations are compiled in parallel with the ESTEREL program to be verified. A trivial reachability analysis of the output of the compiler then indicates whether or not the safety property is satisfied by the program. We describe two realworld software problems  ESTEREL versions of two features of the AT&T 5ESS R fl switching system  and one wellknown benchmark problem  the generalized railroad crossing problem  that we have verified using our technique and associated tool set. 1 Introduction The ESTEREL programming language [5] is a formallydefined, highlevel language designed specifically for progra...
Verification of timed automata via satisfiability checking
 In Proc. Formal Techniques in RealTime and FaultTolerant Systems FTRTFT'02, volume 2469 of Lecture Notes in Computer Science
, 2002
"... Abstract. In this paper we show how to translate boundedlength verification problems for timed automata into formulae in difference logic, a propositional logic enriched with timing constraints. We describe the principles of a satisfiability checker specialized for this logic that we have implement ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
Abstract. In this paper we show how to translate boundedlength verification problems for timed automata into formulae in difference logic, a propositional logic enriched with timing constraints. We describe the principles of a satisfiability checker specialized for this logic that we have implemented and report some preliminary experimental results. 1
ModelChecking for a Subclass of Event Structures
 Proc. of TACAS'97, LNCS 1217
, 1997
"... . A finite representation of the prime event structure corresponding to the behaviour of a program is suggested. The algorithm of linear complexity using this representation for model checking of the formulas of Discrete Event Structure Logic without past modalities is given. A method of building fi ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
(Show Context)
. A finite representation of the prime event structure corresponding to the behaviour of a program is suggested. The algorithm of linear complexity using this representation for model checking of the formulas of Discrete Event Structure Logic without past modalities is given. A method of building finite representations of event structures in an efficient way by applying partial order reductions is provided. 1 Introduction Model checking is one of the most successful methods of automatic verification of program properties. A modelchecking algorithm decides whether a finitestate concurrent system satisfies its specification, given as a formula of a temporal logic [3, 10]. Behaviour of a concurrent system can be modeled in two ways. In the interleaving semantics, the meaning of a program is an execution tree, temporallogic assertions are interpreted over paths of this tree. In partialorder semantics (or event structure semantics), behaviour is an event structure, where the ordering r...
Verification by augmented abstraction: The automatatheoretic view
 Journal of Computer and System Sciences
, 2001
"... ..."