Predicate transformer semantics: Difference between revisions

Revision as of 03:06, 22 January 2007

Revision as of 23:00, 26 January 2007

Line 19:

Although the most common and most widely discussed because of their relevance to sequential programming, "weakest pre-conditions" are not the only ''predicate transformers''. For example, [[Leslie Lamport]] has suggested ''win'' and ''sin'' as ''predicate transformers'' for [[concurrent programming]].

* http://broker.homeloancourse.info/home-equity-loan.html - home equity loan

== References ==

* http://Health.besttradelink.info/payday-loan.html - payday loan

* http://percentage.mortgagerefinancedot.info/mortgage-refinance.html - mortgage refinance

* [[Edsger W. Dijkstra]], "Guarded commands, nondeterminacy and formal derivation of programs". ''[[Communications of the ACM]]'', 18(8):453–457, August 1975. [http://doi.acm.org/10.1145/360933.360975]

* http://after.usadaytrade.biz/Start-Forex-Trading.html - Start Forex Trading

* http://Ranked.superrefinancerate.info/mortgage-refinance.html - mortgage refinance

* [[Leslie Lamport]], "''win'' and ''sin'': Predicate Transformers for Concurrency". ''[[Association for Computing Machinery|ACM]] Transactions on Programming Languages and Systems'', 12(3), July 1990. [http://research.microsoft.com/users/lamport/pubs/pubs.html#lamport-win]

* [[Ralph-Johan Back]] and Joakim von Wright, ''Refinement Calculus: A Systematic Introduction'', 1st edition, 1998. ISBN 0-387-98417-8.

* Edsger W. Dijkstra. ''A Discipline of Programming'' (A systematic introduction with examples). ISBN 0-613-92411-8.

[[Category:Formal methods]]

[[Category:Logic in computer science]]

[[Category:Theoretical computer science]]

[[de:Wp-Kalkül]]

[[ja:述語変換意味論]]