E.W. Dijkstra. A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall, 1976.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....timing constructs. To make the connection with transition systems, the HCSP process expressions could be given a semantics as relations in an LTS model over a valuation space of continuous and discrete variables plus communication channels. The work in [29] uses Dijkstra s predicate transformers [68] to reason about the effect of actions or processes; these are essentially the same as the basic operators of modal logic, as discussed in Section IV below. In work on discrete systems, there is a huge and well established literature on the use of petri nets (in their many variations) for ....

.... successors of , hence for any set . The duality between the operators is with respect to set complement, and is given by: The preimage operators have appeared under various names and notations, and in diverse settings, throughout mathematics and computer science. From Dijkstra s famous text [68], they are known as predicate transformers. In that work, the set is referred to as , the weakest liberal precondition of under a relation , while the weakest precondition is taken as , where . A related transformer is the postimage operator Post , also called the direct image . For Dijkstra, this ....

E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.

....of operating systems address such issues as stability, reusability, adaptability, and reconfigurability. 2. The Problem: Cross Cutting of Design Issues The principle of separation of concerns lies at the heart of software development as it introduces a number of benefits, originally addressed by [19, 7]. These include better understanding, modifiability, extensibility, debugging of the system, and better reuse of the concerns. Although these benefits have been well established, there is still no universally accepted methodology in order to guide a programmer to achieve it. The system designer ....

Dijkstra, Edsger W., A Discipline of Programming, Englandwood Cliff, NJ: Prentice-Hall, 1976.

....) Pointwise extension of predicates gives us predicate transformers, which are functions of the type Ptran( Sigma; Gamma ) def = Pred( Gamma ) Pred( Sigma) where Sigma and Gamma are two state spaces. A program statement A is identified with the weakest precondition predicate transformer [12], which maps a postcondition q to a precondition A q that describes the set of initial states from which A is guaranteed to terminate in states satisfying q. The definition of the predicate transformer regards a program which does not always produce the desired result as bad as one which does not ....

Dijkstra, E.: A Discipline of programming. Englewood Cliffs, NJ: Prentice--Hall 1976

No context found.

E.W. Dijkstra. A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall, 1976.

No context found.

E.W. Dijkstra. A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall, 1976.

No context found.

E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall, 1976.

No context found.

E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall, 1976.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC