{"title":"Krzysztof R Apt","description":null,"products":[{"product_id":"edsger-wybe-dijkstra-book-krzysztof-r-apt-9781450397735","title":"Edsger Wybe Dijkstra","description":"Edsger Wybe Dijkstra (1930–2002) was one of the most influential researchers in the history of computer science, making fundamental contributions to both the theory and practice of computing. Early in his career, he proposed the single-source shortest path algorithm, now commonly referred to as Dijkstra's algorithm. He wrote (with Jaap Zonneveld) the first ALGOL 60 compiler, and designed and implemented with his colleagues the influential THE operating system. Dijkstra invented the field of concurrent algorithms, with concepts such as mutual exclusion, deadlock detection, and synchronization.  A prolific writer and forceful proponent of  the concept of structured programming, he convincingly argued against the use of the Go To statement.  In 1972 he was awarded the ACM Turing Award for \"fundamental contributions to programming as a high, intellectual challenge; for eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; for illuminating perception of problems at the foundations of program design.\"  Subsequently he invented the concept of self-stabilization relevant to fault-tolerant computing. He also devised an elegant language for nondeterministic programming and its weakest precondition semantics, featured in his influential 1976 book A Discipline of Programming in which he advocated the development of programs in concert with their correctness proofs.  In the later stages of his life, he devoted much attention to the development and presentation of mathematical proofs, providing further support to his long-held view that the programming process should be viewed as a mathematical activity.  In this unique new book, 31 computer scientists, including five recipients of the Turing Award, present and discuss Dijkstra's numerous contributions to computing science and assess their impact. Several authors knew Dijkstra as a friend, teacher, lecturer, or colleague. Their biographical essays and tributes provide a fascinating multi-author picture of Dijkstra, from the early days of his career up to the end of his life.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50376141930769,"sku":"CIN1450397735G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ NEW \/ INGRAM","offer_id":51027052167441,"sku":"NIN9781450397735","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1450397735.jpg?v=1757414587"},{"product_id":"edsger-wybe-dijkstra-book-krzysztof-r-apt-9781450397711","title":"Edsger Wybe Dijkstra","description":"Edsger Wybe Dijkstra (1930–2002) was one of the most influential researchers in the history of computer science, making fundamental contributions to both the theory and practice of computing. Early in his career, he proposed the single-source shortest path algorithm, now commonly referred to as Dijkstra's algorithm. He wrote (with Jaap Zonneveld) the first ALGOL 60 compiler, and designed and implemented with his colleagues the influential THE operating system. Dijkstra invented the field of concurrent algorithms, with concepts such as mutual exclusion, deadlock detection, and synchronization.  A prolific writer and forceful proponent of  the concept of structured programming, he convincingly argued against the use of the Go To statement.  In 1972 he was awarded the ACM Turing Award for \"fundamental contributions to programming as a high, intellectual challenge; for eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; for illuminating perception of problems at the foundations of program design.\"  Subsequently he invented the concept of self-stabilization relevant to fault-tolerant computing. He also devised an elegant language for nondeterministic programming and its weakest precondition semantics, featured in his influential 1976 book A Discipline of Programming in which he advocated the development of programs in concert with their correctness proofs.  In the later stages of his life, he devoted much attention to the development and presentation of mathematical proofs, providing further support to his long-held view that the programming process should be viewed as a mathematical activity.  In this unique new book, 31 computer scientists, including five recipients of the Turing Award, present and discuss Dijkstra's numerous contributions to computing science and assess their impact. Several authors knew Dijkstra as a friend, teacher, lecturer, or colleague. Their biographical essays and tributes provide a fascinating multi-author picture of Dijkstra, from the early days of his career up to the end of his life.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51026983321873,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51026986696977,"sku":"NIN9781450397711","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1450397719.jpg?v=1757412803"},{"product_id":"logic-programming-book-krzysztof-r-apt-9780262510646","title":"Logic Programming","description":"Discusses logic programming, a promising step toward declarative programming and the theoretical basis of the programming language Prolog. Logic programming is also fundamental to work in artificial intelligence where it is used for nonmontonic and commonsense reasoning.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51693595787537,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ GOOD \/ SBYB","offer_id":51693597425937,"sku":"CIN0262510642G","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0262510642.jpg?v=1750909264"},{"product_id":"programmverifikation-book-krzysztof-r-apt-9783540574798","title":"Programmverifikation","description":"Part I: In the Beginning Introduction Preliminaries Part II: Deterministic Programs while Programs Recursive Programs Recursive Programs with Parameters Object-Oriented Programs Part III: Parallel Programs Disjoint Parallel Programs Parallel Programs with Shared Variables Parallel Programs with Synchronization Part IV: Nondeterministic and Distributed Programs Nondeterministic Programs Distributed Programs Fairness","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52142454964497,"sku":"NLS9783540574798","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540574798.jpg?v=1757580235"},{"product_id":"recent-advances-in-constraints-book-krzysztof-r-apt-9783540218340","title":"Recent Advances in Constraints","description":"Constraint programming is the fruit of several decades of research carried out in mathematical logic, automated deduction, operations research and arti?cial intelligence. The tools and programming languages arising from this research ?eldhaveenjoyedrealsuccessintheindustrialworldastheycontributetosolving hard combinatorial problems in diverse domains such as production planning, communication networks, robotics and bioinformatics. This volume contains the extended and reviewed versions of a selection of papers presented at the Joint ERCIM\/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP2003), which was held from June 30 to July 2, 2003. The venue chosen for the seventh edition of this annual workshop was the Computer and Automation Research Institute of the Hungarian Academy of Sciences (MTA SZTAKI) in Budapest, Hungary. This institute is one of the 20 members of the Working Group on Constraints of the European Research Consortium for Informatics and Mathematics (ERCIM). For many participants this workshop provided the ?rst opportunity to visit their ERCIM partner in Budapest. CoLogNET is the European-funded network of excellence dedicated to s- porting and enhancing cooperation and research on all areas of computational logic, and continues the work done previously by the Compulog Net. In part- ular, the aim of the logic and constraint logic programming area of CoLogNET is to foster and support all research activities related to logic programming and constraint logic programming. The editors would like to take the opportunity and thank all the authors who submitted papers to this volume, as well as the reviewers for their helpful work.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52344910479633,"sku":"NLS9783540218340","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":53494287958289,"sku":"NIN9783540218340","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540218340.jpg?v=1758175086"},{"product_id":"lectures-in-game-theory-for-computer-scientists-book-krzysztof-r-apt-9780521198660","title":"Lectures in Game Theory for Computer Scientists","description":"Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also interest researchers working in mathematical logic, computer science and game theory.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52349896360209,"sku":"NLS9780521198660","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":53081664291089,"sku":"NIN9780521198660","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780521198660.jpg?v=1758179731"},{"product_id":"new-trends-in-constraints-book-krzysztof-r-apt-9783540678854","title":"New Trends in Constraints","description":"This book constitutes the thoroughly refereed post-proceedings of the Joint ERCIM\/Compulog-Net Workshop on New Trends in Constraints held in Paphos, Cyprus, Greece in October 1999. The 12 revised full research papers presented together with four surveys by leading researchers were carefully reviewed. The book is divided in topical sections on constraint propagation and manipulation, constraint programming, and rule-based constraint programming.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52355033760017,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52355034186001,"sku":"NLS9783540678854","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540678854.jpg?v=1758184486"},{"product_id":"verification-of-sequential-and-concurrent-programs-book-krzysztof-r-apt-9781848827448","title":"Verification of Sequential and Concurrent Programs","description":"HIS BOOK CONTAINS a most comprehensive text that presents syntax-directed and compositional methods for the formal veri?- T cation of programs. The approach is not language-bounded in the sense that it covers a large variety of programming models and features that appear in most modern programming languages. It covers the classes of - quential and parallel, deterministic and non-deterministic, distributed and object-oriented programs. For each of the classes it presents the various c- teria of correctness that are relevant for these classes, such as interference freedom, deadlock freedom, and appropriate notions of liveness for parallel programs. Also, special proof rules appropriate for each class of programs are presented. In spite of this diversity due to the rich program classes cons- ered, there exist a uniform underlying theory of veri?cation which is synt- oriented and promotes compositional approaches to veri?cation, leading to scalability of the methods. The text strikes the proper balance between mathematical rigor and - dactic introduction of increasingly complex rules in an incremental manner, adequately supported by state-of-the-art examples. As a result it can serve as a textbook for a variety of courses on di?erent levels and varying durations. It can also serve as a reference book for researchers in the theory of veri?- tion, in particular since it contains much material that never before appeared in book form. This is specially true for the treatment of object-oriented p- grams which is entirely novel and is strikingly elegant.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52487871299857,"sku":"NLS9781848827448","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781848827448.jpg?v=1759861787"},{"product_id":"verification-of-sequential-and-concurrent-programs-book-krzysztof-r-apt-9781447125136","title":"Verification of Sequential and Concurrent Programs","description":"HIS BOOK CONTAINS a most comprehensive text that presents syntax-directed and compositional methods for the formal veri?- T cation of programs. The approach is not language-bounded in the sense that it covers a large variety of programming models and features that appear in most modern programming languages. It covers the classes of - quential and parallel, deterministic and non-deterministic, distributed and object-oriented programs. For each of the classes it presents the various c- teria of correctness that are relevant for these classes, such as interference freedom, deadlock freedom, and appropriate notions of liveness for parallel programs. Also, special proof rules appropriate for each class of programs are presented. In spite of this diversity due to the rich program classes cons- ered, there exist a uniform underlying theory of veri?cation which is synt- oriented and promotes compositional approaches to veri?cation, leading to scalability of the methods. The text strikes the proper balance between mathematical rigor and - dactic introduction of increasingly complex rules in an incremental manner, adequately supported by state-of-the-art examples. As a result it can serve as a textbook for a variety of courses on di?erent levels and varying durations. It can also serve as a reference book for researchers in the theory of veri?- tion, in particular since it contains much material that never before appeared in book form. This is specially true for the treatment of object-oriented p- grams which is entirely novel and is strikingly elegant.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52593178673425,"sku":"NLS9781447125136","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9781447125136.jpg?v=1761067330"},{"product_id":"logic-programming-paradigm-book-krzysztof-r-apt-9783642642494","title":"The Logic Programming Paradigm","description":"Logic Programming was founded 25 years ago. This exciting new text reveals both the evolution of this programming paradigm since its inception and the impressively broad scope of current research in Logic Programming. The contributions to the book deal with both theoretical and practical issues. They address such diverse topics as: computational molecular biology, machine learning, mobile computing, multi-agent systems, planning, numerical computing and dynamical systems, database systems, an alternative to the formulas as types approach, program semantics and analysis, and natural language processing. The contributors are all leading world experts in Logic Programming and their contributions were all invited and refereed.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52617387802897,"sku":"NLS9783642642494","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642642494.jpg?v=1761530137"},{"product_id":"logics-and-models-of-concurrent-systems-book-krzysztof-r-apt-9783642824555","title":"Logics and Models of Concurrent Systems","description":"The cooperation test [Apt, Francez \u0026amp; de Roever] was originally conceived to capture the proof theoretical analogue of distributed message exchange between disjoint processes, as opposed to the interference freedom test [Owicki \u0026amp; Gries], being the proof theoretical analogue of concurrent communication by means of interference through jointly shared variables. Some authors ([Levin \u0026amp; Gries, Lamport \u0026amp; Schneider, Schlichting and Schneider]) stress that both forms of communication can be proof theoretically characterized using interference freedom only, since proofs for both ultimately amount to an invariance proof of a big global assertion [Ashcroft], invariance of whose parts amounts to interference freedom. Yet I feel that the characteristic nature of the cooperation test is still preserved in the analysis of these authors, because in their analysis of CSP the part dealing with interference freedom specializes to maintenance of a global invariant, the expression of which requires per process the introduction of auxiliary variables which are updated in that process only, thus preserving the concept of disjointness (as opposed to sharing), since now all variables from different processes are disjoint. The cooperation test has been applied to characterize concurrent communication as occurring in Hoare's Communicating Sequential Processes (CSP) [Hoare 2], Ichbiah's ADA [ARM], and Brinch Hansen's Distributed Processes (DP) [Brinch Hansen]. This characterization has been certified through soundness and completeness proofs [Apt 2, Gerth]. As in the interference freedom test this characterization consists of two stages, a local sequential stage and a global stage.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52622624162065,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52622624882961,"sku":"NLS9783642824555","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642824555.jpg?v=1761606640"}],"url":"https:\/\/www.worldofbooks.com\/en-gb\/collections\/author-books-by-krzysztof-r-apt.oembed","provider":"World of Books ","version":"1.0","type":"link"}