Results 1  10
of
2,007
LTL with the freeze quantifier and register automata
 In LICS’06
, 2006
"... Temporal logics, firstorder logics, and automata over data words have recently attracted considerable attention. A data word is a word over a finite alphabet, together with a datum (an element of an infinite domain) at each position. Examples include timed words and XML documents. To refer to the d ..."
Abstract

Cited by 79 (7 self)
 Add to MetaCart
to the data, temporal logics are extended with the freeze quantifier, firstorder logics with predicates over the data domain, and automata with registers or pebbles. We investigate relative expressiveness and complexity of standard decision problems for LTL with the freeze quantifier (LTL ↓), 2variable
Safely Freezing LTL
 In FST&TCS’06
, 2006
"... Abstract. We consider the safety fragment of linear temporal logic with the freeze quantifier. The freeze quantifier is used to store a value from an infinite domain in a register for later comparison with other such values. We show that, for one register, satisfiability, refinement and model checki ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Abstract. We consider the safety fragment of linear temporal logic with the freeze quantifier. The freeze quantifier is used to store a value from an infinite domain in a register for later comparison with other such values. We show that, for one register, satisfiability, refinement and model
On the freeze quantifier in constraint LTL: decidability and complexity
 I & C
, 2005
"... Constraint LTL, a generalization of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some realtime logics, but this variablebinding mechanism is quite general ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
Constraint LTL, a generalization of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some realtime logics, but this variablebinding mechanism is quite
On the freeze quantifier in Constraint LTL: decidability and complexity ⋆
"... Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some realtime logics, but this variablebinding mechanism is quite general ..."
Abstract
 Add to MetaCart
Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a formal language to specify the behavior of operational models with constraints. The freeze quantifier can be part of the language, as in some realtime logics, but this variablebinding mechanism is quite
Model checking freeze LTL over onecounter automata
, 2008
"... We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of regist ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number
Model checking freeze LTL over onecounter automata!
, 2008
"... Abstract. We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the numbe ..."
Abstract
 Add to MetaCart
Abstract. We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction
Intrusion Detection via Static Analysis
, 2001
"... One of the primary challenges in intrusion detection is modelling typical application behavior, so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior. The resul ..."
Abstract

Cited by 349 (1 self)
 Add to MetaCart
One of the primary challenges in intrusion detection is modelling typical application behavior, so that we can recognize attacks by their atypical effects without raising too many false alarms. We show how static analysis may be used to automatically derive a model of application behavior. The result is a hostbased intrusion detection system with three advantages: a high degree of automation, protection against a broad class of attacks based on corrupted code, and the elimination of false alarms. We report on our experience with a prototype implementation of this technique. 1. Introduction Computer security has undergone a major renaissance in the last five years. Beginning with Sun's introduction of the Java language and its support of mobile code in 1995, programming languages have been a major focus of security research. Many papers have been published applying programming language theory to protection problems [25, 24], especially information flow [17]. Security, however, is a ma...
When ModelChecking Freeze LTL over Counter Machines Becomes Decidable
, 2010
"... We study the decidability status of modelchecking freeze LTL over various subclasses of counter machines for which the reachability problem is known to be decidable (reversalbounded counter machines, vector additions systems with states, flat counter machines, onecounter machines). In freeze LTL, ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We study the decidability status of modelchecking freeze LTL over various subclasses of counter machines for which the reachability problem is known to be decidable (reversalbounded counter machines, vector additions systems with states, flat counter machines, onecounter machines). In freeze LTL
Model Checking and Modular Verification
 ACM Transactions on Programming Languages and Systems
, 1991
"... We describe a framework for compositional verification of finite state processes. The framework is based on two ideas: a subset of the logic CTL for which satisfaction is preserved under composition; and a preorder on structures which captures the relation between a component and a system containing ..."
Abstract

Cited by 310 (11 self)
 Add to MetaCart
We describe a framework for compositional verification of finite state processes. The framework is based on two ideas: a subset of the logic CTL for which satisfaction is preserved under composition; and a preorder on structures which captures the relation between a component and a system containing the component. Satisfaction of a formula in the logic corresponds to being below a particular structure (a tableau for the formula) in the preorder. We show how to do assumeguarantee style reasoning within this framework. In addition, we demonstrate efficient methods for model checking in the logic and for checking the preorder in several special cases. We have implemented a system based on these methods, and we use it to give a compositional verification of a CPU controller. 1 Introduction Temporal logic model checking procedures are useful tools for the verification of finite state systems [3, 12, 20]. However, these procedures have traditionally suffered from the state explosion proble...
LTL over integer periodicity constraints
 Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), volume 2987 of LNCS
, 2004
"... Abstract. Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL mod, an extension of LinearTime Temporal Logic LTL with pasttime operators ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
problem for extended singlestring automata, known to express the equality of time granularities, is pspacecomplete by designing a reduction from QBF and by using our results for PLTL mod. Keywords: Presburger LTL, periodicity constraints, computational complexity, Büchi automaton, QBF.
Results 1  10
of
2,007