Add to ORKGA new semantics for algebraic specifications, called visible semantics, is defined. Its most notable property is that it is specially suitable for dealing with the problem of program correctness. Some properties of this semantics are proved and some conclusions described
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
Publie dans : Proceedings 8th International Conference Fundamentals of Computation Theory, pages 307...
Developing a verifying compiler---a compiler that proves that components are correct with respect to...
A new semantics for algebraic specifications, called visible semantics, is defined. Its most notable...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
International audienceA common belief is that formalizing semantics of programming languages require...
. We introduce a concept of behavioural implementation for algebraic specifications which is based o...
AbstractA language called ASL for describing structured algebraic specifications is presented. ASL i...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyo...
We present a method for automatically generating verification conditions for a class of imperative p...
We present a method for automatically generating verification conditions for a class of imperative p...
AbstractA semi-algorithm for the proof of behavioural implementations of algebraic specifications pr...
Deductive program verification is an intricate and time-consuming task, in spite of significant adva...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
Publie dans : Proceedings 8th International Conference Fundamentals of Computation Theory, pages 307...
Developing a verifying compiler---a compiler that proves that components are correct with respect to...
A new semantics for algebraic specifications, called visible semantics, is defined. Its most notable...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
International audienceA common belief is that formalizing semantics of programming languages require...
. We introduce a concept of behavioural implementation for algebraic specifications which is based o...
AbstractA language called ASL for describing structured algebraic specifications is presented. ASL i...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyo...
We present a method for automatically generating verification conditions for a class of imperative p...
We present a method for automatically generating verification conditions for a class of imperative p...
AbstractA semi-algorithm for the proof of behavioural implementations of algebraic specifications pr...
Deductive program verification is an intricate and time-consuming task, in spite of significant adva...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
Publie dans : Proceedings 8th International Conference Fundamentals of Computation Theory, pages 307...
Developing a verifying compiler---a compiler that proves that components are correct with respect to...