Projet CHLOEFormal specifications are a kind of art : they mixture formal text and informal comments in an unstructured manner. We present a method based on logic programming in which formal text and comments can be also formally related through proofs. The paper is focused on the description of the proofs system used in the design of such specifications. The specification language uses normal clauses (definite clauses with possibly negative literals in the body) for its formal part and is aimed at defining relations. The comments are expressed as logic formulas written with some of the specified relations and define some local properties that the relations must satify. They introduce some redundancy which helps to understand the specificat...
This article discusses my work in the last few years on logical formalisms which have been shown to ...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like pro...
Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
This paper presents a way in which formal logic can be understood and reformulated in terms of argum...
Abstract. Recently much attention has been directed to extending logic programming with description ...
Deriving formal specifications from informal requirements is extremely difficult since one has to ov...
This article identifies problems with regard to providing criteria that regulate the matching of log...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
Recently much attention has been directed to extending logic programming with description logic (DL)...
Projet CHLOEWe develop the foundations of Horn clause logic programming in a proof-theoretic style. ...
1 Introduction Program synthesis is concerned with deriving programs from their specifications. Suc...
Verification of modern digital systems can consume up to 70% of the design cycle. Verification engin...
Writing specifications for computer programs is not easy since one has to take into account the disp...
Traditionally, the focus of specification mechanism has been on improving its ability to cover a wid...
This article discusses my work in the last few years on logical formalisms which have been shown to ...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like pro...
Programme 2 : calcul symbolique, programmation et genie logicielSIGLEAvailable at INIST (FR), Docume...
This paper presents a way in which formal logic can be understood and reformulated in terms of argum...
Abstract. Recently much attention has been directed to extending logic programming with description ...
Deriving formal specifications from informal requirements is extremely difficult since one has to ov...
This article identifies problems with regard to providing criteria that regulate the matching of log...
We present a method using an extended logical system for obtaining "correct" programs from specifica...
Recently much attention has been directed to extending logic programming with description logic (DL)...
Projet CHLOEWe develop the foundations of Horn clause logic programming in a proof-theoretic style. ...
1 Introduction Program synthesis is concerned with deriving programs from their specifications. Suc...
Verification of modern digital systems can consume up to 70% of the design cycle. Verification engin...
Writing specifications for computer programs is not easy since one has to take into account the disp...
Traditionally, the focus of specification mechanism has been on improving its ability to cover a wid...
This article discusses my work in the last few years on logical formalisms which have been shown to ...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like pro...