Results 1  10
of
179,037
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 1387 (62 self)
 Add to MetaCart
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
Temporal logics for specification and verification
, 2009
"... The course will comprise ten 40min lectures, delivered 2 per day, with a 510 min break in between. Prerequisites This is an introductory course and the participants are only expected to have some background in classical and modal logic. In addition, some knowledge of computability and complexity, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, finite automata, and a general idea of formal specification and verification would be an advantage. Course notes content These course notes contain parts of draft chapters from a book in preparation on “Temporal logics in Computer Science ” by Stéphane Demri and myself. Not all material included
Algorithmic Verification of Linear Temporal Logic Specifications
 Proc. 25th Int. Colloq. Aut. Lang. Prog., volume 1443 of Lect. Notes in Comp. Sci
, 1998
"... In this methodological paper we present a coherent framework for symbolic model checking verification of lineartime temporal logic (ltl) properties of reactive systems, taking full fairness into consideration. We use the computational model of a fair Kripke structure (fks) which takes into accou ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
In this methodological paper we present a coherent framework for symbolic model checking verification of lineartime temporal logic (ltl) properties of reactive systems, taking full fairness into consideration. We use the computational model of a fair Kripke structure (fks) which takes
Interval Logics for Temporal Specification and Verification
, 1993
"... This thesis investigates temporal specification and verification techniques using a lineartime temporal logic with interval constructs. It identifies an expressive elementary logic with interval modalities, called Future Interval Logic (FIL). This logic has a natural graphical representation which, ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
This thesis investigates temporal specification and verification techniques using a lineartime temporal logic with interval constructs. It identifies an expressive elementary logic with interval modalities, called Future Interval Logic (FIL). This logic has a natural graphical representation which
A Temporal Logic for the Specification and Verification of Distributed Behaviour
, 1999
"... In this work we develop a temporal logic with fixpoints for distributed processes or distributed systems. Standard temporal logics refer to sequential processes (execution sequences) of distributed systems. Expressive temporal operators such as "Until" can be expressed as fixpoints of for ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
this approach to distributed processes, which represent the causal relation of events occurring in a run of a system as partial order. A key problem is the proper generalisation of the "Next" operator. Within a general framework we identify several syntactic subclasses of the logic. Both theoretical
Temporal Logic Verification Using Simulation
 In Proc. FORMATS’06
, 2006
"... Abstract. In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the verification of the temporal properties of a continuous system by verifying only a finite number of its (simu ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
Abstract. In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the verification of the temporal properties of a continuous system by verifying only a finite number of its
The Anchored Version of the Temporal Framework
 Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354
, 1989
"... . In this survey paper we present some of the recent developments in the temporal formal system for the specification, verification and development of reactive programs. While the general methodology remains very much the one presented in some earlier works on the subject, such as [MP83c, MP83a, Pnu ..."
Abstract

Cited by 56 (5 self)
 Add to MetaCart
. In this survey paper we present some of the recent developments in the temporal formal system for the specification, verification and development of reactive programs. While the general methodology remains very much the one presented in some earlier works on the subject, such as [MP83c, MP83a
Temporal Specification and Verification of Reactive Modules
, 1992
"... . The paper addresses the problem of compositional specification and verification of reactive modules by temporal logic. We consider programs formed by parallel composition of modules that communicate by either shared variables or message passing . Each module specifies its interface with other mod ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
. The paper addresses the problem of compositional specification and verification of reactive modules by temporal logic. We consider programs formed by parallel composition of modules that communicate by either shared variables or message passing . Each module specifies its interface with other
Specification and Verification using Temporal Logics
, 2009
"... This chapter illustrates two aspects of automata theory related to lineartime temporal logic LTL used for the verification of computer systems. First, we present a translation from LTL formulae to Büchi automata. The aim is to design an elementary translation which is reasonably efficient and produc ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This chapter illustrates two aspects of automata theory related to lineartime temporal logic LTL used for the verification of computer systems. First, we present a translation from LTL formulae to Büchi automata. The aim is to design an elementary translation which is reasonably efficient
Ground Temporal Logic: A Logic for Hardware Verification
 ComputerAided Verification (CAV '94), LNCS 818
, 1994
"... We present a new temporal logic, GTL, appropriate for specifying properties of hardware at the register transfer level. We argue that this logic represents an improvement over model checking for some natural hardware verification problems. We show that the validity problem for this logic is \Pi 1 1 ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
. Specifically model checking for various propositional temporal logics has proven to be a very practical tool for the fully automatic verification of many hardware circuits and finite state protocols. However these approaches suffer from various drawbacks. One such drawback is the requirement that hardware
Results 1  10
of
179,037