Results 1  10
of
118
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1388 (62 self)
 Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finitestate concurrent systems. Experimental results show that state machines
Tacticbased theorem proving in firstorder modal and temporal logics
 University of Siena
, 2001
"... Abstract. We describe the ongoing work on a tacticbased theorem prover for FirstOrder Modal and Temporal Logics (FOTLs for the temporal ones). In formal methods, especially temporal logics play a determining role; in particular, FOTLs are natural whenever the modeled systems are infinitestate. Bu ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. We describe the ongoing work on a tacticbased theorem prover for FirstOrder Modal and Temporal Logics (FOTLs for the temporal ones). In formal methods, especially temporal logics play a determining role; in particular, FOTLs are natural whenever the modeled systems are infinite
A modular, tacticbased approach to firstorder temporal theorem proving
"... In system specification and formal verification it is a central issue to deal with temporal logics. In particular, FirstOrder Temporal Logics (FOTLs) are needed whenever the modeled systems are infinitestate. Reasoning in FOTLs is hard and few approaches have so far proved effective. In this pape ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. In this paper we propose a novel approach to FOTLs, in the style of labelled deduction in Quantified Modal Logics, which is modular in the structure of time and can therefore be adapted to a wide class of FOTLs. Moreover, we present a tacticbased temporal theorem prover enforcing this approach, obtained
A GraphBased Approach To Resolution In Temporal Logic
 In Temporal Logic, First International Conference, ICTL '94, Proceedings
, 1994
"... . In this paper, we present algorithms developed in order to implement a clausal resolution method for discrete, linear temporal logics, presented in [Fis91]. As part of this method, temporal formulae are rewritten into a normal form and both `nontemporal' and `temporal' inference rules a ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
as little of the graph as possible. These algorithms have been implemented and have been combined with subprograms performing translation to normal form and nontemporal resolution to produce an integrated resolution based temporal theoremprover. 1 Introduction Although resolution has been widely used
Prover  Automated Theorem Prover for the Classical Logic
"... In this paper we extend our clausal resolution method for linear temporal logics to a simple branchingtime framework. The branching time temporal logics considered are Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class, and Extended CTL (ECTL), which is CTL e ..."
Abstract
 Add to MetaCart
In this paper we extend our clausal resolution method for linear temporal logics to a simple branchingtime framework. The branching time temporal logics considered are Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class, and Extended CTL (ECTL), which is CTL
The Semantics of TLA on the PVS Theorem Prover
, 1996
"... An implementation of Lamport's Temporal Logic of Actions (TLA) on a higher order logic theorem prover is described. TLA is a temporal logic, for which a syntax and semantics are defined, based on an action logic which is represented by higher order functions. The temporal logic includes quantif ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An implementation of Lamport's Temporal Logic of Actions (TLA) on a higher order logic theorem prover is described. TLA is a temporal logic, for which a syntax and semantics are defined, based on an action logic which is represented by higher order functions. The temporal logic includes
Theorem Prover Based Verification of TLA Systems
, 1993
"... TLA is an actionbased lineartime temporal logic and supports the specification and verification of concurrent systems. In general, verification is equivalent to the logical proof of implications between temporal formulas, which can be reduced to a set of predicate logic proofs. In this context our ..."
Abstract
 Add to MetaCart
our approach aims to the automation of verification processes by means of the utilization of automated predicate logic theorem provers. A tool named TOAST has been developed which accomplishes the reduction of temporal proofs to predicate logic proofs. For the ongoing predicate logic proofs, TOAST
Inductive Theorem Prover Based Verification of Concurrent Algorithms
"... This paper describes a contribution to the area of mechanically theorem proving focusing especially on the automation of the invariance proof. In this respect, we present an initial version of a tool for automatically checking the invariance property of concurrent algorithms. Input to the tool consi ..."
Abstract
 Add to MetaCart
states and a set of mappings (actions) from system states to system states. This model is described in terms of conditional equations. As veri…cation backend to our tool we use SPIKE, an automated inductionbased theorem prover, which is suitable for reasoning about theories where axioms are conditional
A new algebraic tool for automatic theorem provers
 Annals of Mathematics and Artificial Intelligence
, 2004
"... The concepts of implicates and implicants are widely used in several fields of "Automated Reasoning". Particularly, our research group has developed several techniques that allow us to reduce efficiently the size of the input, and therefore the complexity of the problem. These techniques ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
of a formula. In temporal logics, contrary to what we see in classical propositional logic, these sets may contain infinitely many members. Thus, in order to calculate them in an efficient way, we have to base the calculation on the theoretical study of how these sets behave. Such a study reveals
Strategies for Temporal Resolution
, 1995
"... Verifying that a temporal logic specification satisfies a temporal property requires some form of theorem proving. However, although proof procedures exist for such logics, many are either unsuitable for automatic implementation or only deal with small fragments of the logic. In this thesis the algo ..."
Abstract

Cited by 116 (48 self)
 Add to MetaCart
the algorithms for, and strategies to guide, a fully automated temporal resolution theorem prover are given, proved correct and evaluated. An approach to applying resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. The method involves
Results 1  10
of
118