A logic for reasoning about timing of concurrent programs is presented. The logic is based on proof outlines and can handle maximal parallelism as well as resource-constrained execution environments. The correctness proof for a mutual exclusion protocol that uses execution timings in a subtle way illustrates the logic in action
International audienceThis paper proposes a new interpretation of the logical contents of programs i...
We propose a method for the timing analysis of concur-rent real-time programs with hard deadlines. W...
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
This dissertation proposes a formalism for the specification and verification of timing properties o...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
International audienceThis paper elaborates on a new approach of the question of the proof-theoretic...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
This document presents a formal method to verify execution time bounds of programs at the source lev...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
To date, research in reasoning about timing properties of real-time programs has considered specific...
Symbolic execution is an intuitive strategy to verify sequential programs, which can be automated to...
We illustrate a technique for proving properties of distributed programs. Our tech-nique avoids the ...
International audienceThis paper proposes a new interpretation of the logical contents of programs i...
We propose a method for the timing analysis of concur-rent real-time programs with hard deadlines. W...
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
This dissertation proposes a formalism for the specification and verification of timing properties o...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
International audienceThis paper elaborates on a new approach of the question of the proof-theoretic...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
This document presents a formal method to verify execution time bounds of programs at the source lev...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
To date, research in reasoning about timing properties of real-time programs has considered specific...
Symbolic execution is an intuitive strategy to verify sequential programs, which can be automated to...
We illustrate a technique for proving properties of distributed programs. Our tech-nique avoids the ...
International audienceThis paper proposes a new interpretation of the logical contents of programs i...
We propose a method for the timing analysis of concur-rent real-time programs with hard deadlines. W...
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We...