AbstractWe view the process of constructing a program as the stepwise transformation of a relation into simpler relations. In this paper, we focus on a particular transformation: that which decomposes the specification of an iterative program into the specification of the initialization segment and the specification of the while loop. We investigate in some detail the mathematics of this decomposition
AbstractA transformation C of sequential specifications into concurrent specifications is defined. T...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
AbstractGiven a specification that includes a number of user requirements, we wish to focus on the r...
AbstractWe discuss the stepwise construction of iterative programs from specifications, represented ...
The concept of decomposition in computer science and engineering is considered a fundamental compone...
The concept of decomposition in computer science and engineering is considered a fundamental compone...
We define interacting sequential programs, motivated originally by constructivist considerations. We...
AbstractThe algebra of relations has been very successful for reasoning about possibly non-determini...
AbstractWe provide a sequential denotational semantics for sequential programming languages, based o...
AbstractThe jump instruction is considered essential for an adequate theoretical understanding of im...
AbstractOur framework is a programming method whose main idea consists in solving a problem statical...
AbstractThe first half is a tutorial on orderings, lattices, Boolean algebras, operators on Boolean ...
AbstractThe formal theory of the methodology is developed and illustrated with one example: sorting ...
A relational semantics is a mapping of programs to relations. We consider that the input-output sema...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
AbstractA transformation C of sequential specifications into concurrent specifications is defined. T...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
AbstractGiven a specification that includes a number of user requirements, we wish to focus on the r...
AbstractWe discuss the stepwise construction of iterative programs from specifications, represented ...
The concept of decomposition in computer science and engineering is considered a fundamental compone...
The concept of decomposition in computer science and engineering is considered a fundamental compone...
We define interacting sequential programs, motivated originally by constructivist considerations. We...
AbstractThe algebra of relations has been very successful for reasoning about possibly non-determini...
AbstractWe provide a sequential denotational semantics for sequential programming languages, based o...
AbstractThe jump instruction is considered essential for an adequate theoretical understanding of im...
AbstractOur framework is a programming method whose main idea consists in solving a problem statical...
AbstractThe first half is a tutorial on orderings, lattices, Boolean algebras, operators on Boolean ...
AbstractThe formal theory of the methodology is developed and illustrated with one example: sorting ...
A relational semantics is a mapping of programs to relations. We consider that the input-output sema...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
AbstractA transformation C of sequential specifications into concurrent specifications is defined. T...
AbstractIn this paper, the relation between WHILE-programs and formal proofs of their quantified spe...
AbstractGiven a specification that includes a number of user requirements, we wish to focus on the r...