Add to ORKGThis thesis develops a new method for proving properties of concurrent programs and gives formal definitions for safety and liveness. A property is specified by a property recognizer - a finite-state machine that accepts the sequences of program states in the property it specifies. A property recognizer can be constructed for any temporal logic formula. (ABRIDGED ABSTRACT
In this paper, we suggest a method for proving the maximality of a program with respect to a given s...
A brief overview is made of the use of temporal logic formalisms for specifying and verifying concur...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
An approach to proving temporal properties of concurrent programs that does not use temporal logic ...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
We here present an approach to reasoning about actor programs on the basis of temporal logic. Tempor...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
We present a formalism for handling finite-state concurrent systems in a mechanical way. In the form...
In this paper we present an original and useful way for specifying and verifying temporal properties...
We extend permission-based separation logic with a history-based mechanism to simplify the verificat...
We extend permission-based separation logic with a history-based mechanism to simplify the verificat...
Temporal logic is widely acclaimed to be a highly successful tool for analyzing non-real-time proper...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
In this paper, we suggest a method for proving the maximality of a program with respect to a given s...
A brief overview is made of the use of temporal logic formalisms for specifying and verifying concur...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
An approach to proving temporal properties of concurrent programs that does not use temporal logic ...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
We here present an approach to reasoning about actor programs on the basis of temporal logic. Tempor...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
We present a formalism for handling finite-state concurrent systems in a mechanical way. In the form...
In this paper we present an original and useful way for specifying and verifying temporal properties...
We extend permission-based separation logic with a history-based mechanism to simplify the verificat...
We extend permission-based separation logic with a history-based mechanism to simplify the verificat...
Temporal logic is widely acclaimed to be a highly successful tool for analyzing non-real-time proper...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
In this paper, we suggest a method for proving the maximality of a program with respect to a given s...
A brief overview is made of the use of temporal logic formalisms for specifying and verifying concur...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...