A well known challenge in the formal methods domain is to improve their integration with practical engineering methods. In the context of embedded systems, model checking requires ...
Philippe Dhaussy, Pierre Yves Pillain, Stephen Cre...
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program...
We provide in this article two characterisation results, describing exactly which terms verify the dinaturality diagram, in Church-style system F and in Curry-style system F. The ...
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...