This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each other via pointers. Our logic is focused on specifying properties about the dynamic evolution (such as creation, adaptation, and removal) of such pointer structures. The semantics is based on automata on infinite words, extended with appropriate means to model evolving pointer structures in an abstract manner
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
AbstractIn this paper, we present a theorem prover for linear temporal logic. Our goal is to extend ...
Abstract. Logic Programming Update Languages were proposed as an extension of logic programming that...
This paper introduces an extension of linear temporal logic that allows to express properties about ...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
AbstractWe define a new decidable logic for expressing and checking invariants of programs that mani...
The key to many approaches to reason about pointerbased data structures is the availability of a dec...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
this paper, we present a theorem prover for linear temporal logic. Our goal is to extend the capabil...
Pointers are an important programming concept. They are used explicitely or implicitly in many progr...
We define a new decidable logic for expressing and checking invariants of programs that manipulate d...
A predicate linear temporal logic LTL = without quantifiers but with predicate -abstraction mechanis...
Our recent work links type checking in programming languages to verification based on automata. In t...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
AbstractIn this paper, we present a theorem prover for linear temporal logic. Our goal is to extend ...
Abstract. Logic Programming Update Languages were proposed as an extension of logic programming that...
This paper introduces an extension of linear temporal logic that allows to express properties about ...
This paper explains how a uniform, specification-based approach to reasoning about component-based p...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
AbstractWe define a new decidable logic for expressing and checking invariants of programs that mani...
The key to many approaches to reason about pointerbased data structures is the availability of a dec...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
We use a relational calculus of pointer structures to calculate a number of standard algorithms on s...
this paper, we present a theorem prover for linear temporal logic. Our goal is to extend the capabil...
Pointers are an important programming concept. They are used explicitely or implicitly in many progr...
We define a new decidable logic for expressing and checking invariants of programs that manipulate d...
A predicate linear temporal logic LTL = without quantifiers but with predicate -abstraction mechanis...
Our recent work links type checking in programming languages to verification based on automata. In t...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
AbstractIn this paper, we present a theorem prover for linear temporal logic. Our goal is to extend ...
Abstract. Logic Programming Update Languages were proposed as an extension of logic programming that...