Results 1  10
of
300,999
Generalised Unification of Temporal Logic Formulas
, 1999
"... Given two temporal logic formulas, g and h, we wish to know whether there is a modification, m, we can make to h so that g =) h. This problem has important applications in hardware verification, where finding such modifications efficiently is important for an inferencing system. The temporal logic u ..."
Abstract
 Add to MetaCart
Given two temporal logic formulas, g and h, we wish to know whether there is a modification, m, we can make to h so that g =) h. This problem has important applications in hardware verification, where finding such modifications efficiently is important for an inferencing system. The temporal logic
An Optimizing Compiler for Batches of Temporal Logic Formulas
 In Proceedings of ISSTA’04
, 2004
"... Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach have become more mainstream, a need has arisen to deal effectively with large batches of formulas over a common model. Prese ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach have become more mainstream, a need has arisen to deal effectively with large batches of formulas over a common model
Parametrized Evaluation Of Temporal Logic Formulae
, 1993
"... As soon as a program is described by a finite automata, one can efficiently verify temporal formulae of various languages (e.g. LTL, CTL,...). However this method requires to fix the different parameters of the program such as the number of processes or resources. Thus this verification is only part ..."
Abstract
 Add to MetaCart
As soon as a program is described by a finite automata, one can efficiently verify temporal formulae of various languages (e.g. LTL, CTL,...). However this method requires to fix the different parameters of the program such as the number of processes or resources. Thus this verification is only
An Optimizing Compiler for Batches of Temporal Logic Formulas
, 2004
"... Model checking based on validating temporal logic formulas has proven practical and e#ective for numerous software engineering applications. As systems based on this approach have become more mainstream, a need has arisen to deal e#ectively with large batches of formulas over a common model. Present ..."
Abstract
 Add to MetaCart
Model checking based on validating temporal logic formulas has proven practical and e#ective for numerous software engineering applications. As systems based on this approach have become more mainstream, a need has arisen to deal e#ectively with large batches of formulas over a common model
Constructing Automata from Temporal Logic Formulas: A Tutorial
 Summer School on Trends in Computer Science, LNCS 2090
"... This paper presents a tutorial introduction to the construction of finiteautomata on infinite words from lineartime temporal logic formulas. After defining the source and target formalisms, it describes a first construction whose correctness is quite direct to establish, but whose behavior is alwa ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
This paper presents a tutorial introduction to the construction of finiteautomata on infinite words from lineartime temporal logic formulas. After defining the source and target formalisms, it describes a first construction whose correctness is quite direct to establish, but whose behavior
On a Continuous Degree of Satisfaction of Temporal Logic Formulae with Applications to Systems Biology
 In M.Heiner and A.M.Uhrmacher (eds.), CMSB’08: Proc. of the sixth international conference on Computational Methods in Systems Biology
, 2008
"... Abstract. Finding mathematical models satisfying a specification built from the formalization of biological experiments, is a common task of the modeller that techniques like modelchecking help solving, in the qualitative but also in the quantitative case. In this article we propose to go one step ..."
Abstract

Cited by 37 (4 self)
 Add to MetaCart
further by defining a continuous degree of satisfaction of a temporal logic formula with constraints. We show how such a satisfaction measure can be used as a fitness function with stateoftheart search methods in order to find biochemical kinetic parameter values satisfying a set of biological
K.: Synthesizing dynamic programming algorithms from linear temporal logic formulae
, 2001
"... The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The g ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm
Testing Linear Temporal Logic Formulae on Finite Execution Traces
, 2001
"... We present a rewriting algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
We present a rewriting algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
"... A factor in the complexity of conventional algorithms for model checking Computation Tree Logic (CTL) is the size of the formulae, and, more precisely, the number of fixpoint operators. This paper addresses the following questions: given a CTL formula f , is there an equivalent formula with fewer fi ..."
Abstract
 Add to MetaCart
A factor in the complexity of conventional algorithms for model checking Computation Tree Logic (CTL) is the size of the formulae, and, more precisely, the number of fixpoint operators. This paper addresses the following questions: given a CTL formula f , is there an equivalent formula with fewer
Generating Linear Temporal Logic Formulas for PatternBased Specications
"... Software property classications and patterns, i.e., highlevel abstractions that describe program behavior, have been used to assist practitioners in specifying properties. The Specication Pattern System (SPS) provides descriptions of a collection of patterns. Each pattern is associated with a sco ..."
Abstract
 Add to MetaCart
scope that denes the extent of program execution over which a property pattern is considered. Based on a selected pattern, SPS provides a specication for each type of scope in multiple formal languages including Linear Temporal Logic (LTL). The Property Specication tool (Prospec) extends SPS
Results 1  10
of
300,999