Add to ORKGIn this paper, we suggest a method for proving the maximality of a program with respect to a given specification. Even though we prove facts about possible executions of programs there is no need to appeal to branching time logics; we employ a fragment of linear temporal logic for our proofs. The method results in concise proofs of maximality for many non-trivial examples. The method may also serve as a guide in constructing maximal programs
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....
The semantics expressed intuitively as "execute as much as possible in parallel" is formally defined...
AbstractThis paper proposes a constructive logic in which a concurrent system can be defined as a pr...
International audienceWith the advent of parallel architectures, distributed programs are used inten...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
In this thesis, we study the close links between linear logic and on current constraint programming,...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
Specification and verification techniques for abstract data types that have been successful for sequ...
AbstractWe study a timed concurrent constraint language, called tccp, which is obtained by a natural...
The semantics expressed intuitively as 'execute as much as possible in parallel' is formally defined...
Linear logic has long been heralded for its potential of providing a logical basis for concurrency. ...
Rapport interne.In the paper we consider a proof-theoretical approach to Linear Logic in order to de...
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....
The semantics expressed intuitively as "execute as much as possible in parallel" is formally defined...
AbstractThis paper proposes a constructive logic in which a concurrent system can be defined as a pr...
International audienceWith the advent of parallel architectures, distributed programs are used inten...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
In this thesis, we study the close links between linear logic and on current constraint programming,...
SRI International A liveness property asserts that program execution eventually reaches some desirab...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
Specification and verification techniques for abstract data types that have been successful for sequ...
AbstractWe study a timed concurrent constraint language, called tccp, which is obtained by a natural...
The semantics expressed intuitively as 'execute as much as possible in parallel' is formally defined...
Linear logic has long been heralded for its potential of providing a logical basis for concurrency. ...
Rapport interne.In the paper we consider a proof-theoretical approach to Linear Logic in order to de...
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....
The semantics expressed intuitively as "execute as much as possible in parallel" is formally defined...
AbstractThis paper proposes a constructive logic in which a concurrent system can be defined as a pr...