{"product_id":"programs-recursion-and-unbounded-choice-paperback-9780521018296","title":"Programs, Recursion and Unbounded Choice (Paperback) 9780521018296","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003ePrograms, Recursion and Unbounded Choice\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eA complete account of the predicate transformation calculus semantics of sequential programs.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eWim H. Hesselink (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521018296, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback, published 22 August 2005\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e240 pages\u003cbr\u003e24.5 x 17 x 1.2 cm, 0.385 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e\"...of interest for theoretical computer scientists and mathematicians...\"   Mathematical Reviews\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well. This will be essential reading for all computer scientists working in specification and verification of programs.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eList of symbols\u003cbr\u003e Introduction\u003cbr\u003e 1. Weakest preconditions\u003cbr\u003e 2. Annotation, recursion and repetition\u003cbr\u003e 3. Healthiness laws\u003cbr\u003e 4. Semantics of recursion\u003cbr\u003e 5. Ramifications\u003cbr\u003e 6. Relational semantics\u003cbr\u003e 7. Determinacy and disjunctivity\u003cbr\u003e 8. Syntactic criteria\u003cbr\u003e 9. Operational semantics of recursion\u003cbr\u003e 10. Procedure substitutions\u003cbr\u003e 11. Induction and semantic equality\u003cbr\u003e 12. Induction and refinement\u003cbr\u003e 13. The strong preorder\u003cbr\u003e 14. Temporal operators\u003cbr\u003e 15. Predicative fairness\u003cbr\u003e 16. Solutions of exercises\u003cbr\u003e References\u003cbr\u003e Index of concepts and identifiers.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46006153543960,"sku":"9780521018296","price":41.88,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521018296i_ff693d15-4720-48b8-b4d7-eb950581c11d.jpg?v=1691376773","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/programs-recursion-and-unbounded-choice-paperback-9780521018296","provider":"Freshly Printed Books","version":"1.0","type":"link"}