I present an interpretation of machine language programs as boolean expressions. Source language programs may also be so interpreted. The correctness of a code generator can then be expressed as a simple relationship between boolean expressions. Code generators can then be calculated from their specification
Boolean logic is widely used in almost every discipline including linguistics, philosophy, mathemati...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
This lecture will combine the topics of the title in various ways. First I will show that logic is p...
AbstractThis paper explains how a declarative method language, based upon the formal notations of Z ...
The notion of boolean is fundamental in computer science. Even if it seems simple at first sight, it...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
AbstractThis paper argues the following positions: that a formal specification is a boolean expressi...
A model of program correctness is given where a problem domain is defined by its language, variable ...
In the age of the computer in which language has to be transformed into symbols that can be combined...
Abstract. We show that rewrite systems can be used to give semantics to imperative programs with boo...
International audienceSoftware development usually involves a collection of properties, programs and...
Large companies suffer from the increasing complexity that exist in their software systems. Evolving...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
Boolean logic is widely used in almost every discipline including linguistics, philosophy, mathemati...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
This lecture will combine the topics of the title in various ways. First I will show that logic is p...
AbstractThis paper explains how a declarative method language, based upon the formal notations of Z ...
The notion of boolean is fundamental in computer science. Even if it seems simple at first sight, it...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
AbstractThis paper argues the following positions: that a formal specification is a boolean expressi...
A model of program correctness is given where a problem domain is defined by its language, variable ...
In the age of the computer in which language has to be transformed into symbols that can be combined...
Abstract. We show that rewrite systems can be used to give semantics to imperative programs with boo...
International audienceSoftware development usually involves a collection of properties, programs and...
Large companies suffer from the increasing complexity that exist in their software systems. Evolving...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
Boolean logic is widely used in almost every discipline including linguistics, philosophy, mathemati...
Using Martin-Löf's set theory as a programming logic one identifies specifications with sets and pro...
Abstract. The goal of this lecture is to show how modern theorem provers—in this case, the Coq proof...
DOI
Add to ORKG