A unique publication that provides an introduction to the theory of logic programming and its application to Prolog programs. Covers programming issues such as termination, occur-check freedom, partial correctness and absence of runtime errors. Paper. DLC: Logic programming.

From Logic Programming to Prolog

Computers & Technology

Apt, Krzysztof R.

Programming

PRENTICE/HALL

Logic Programming Languages: Constraints, Functions, and Objects (MIT Press Classics)

This collection of current research on logic programming languages presents results from a three-year, ESPRIT-funded effort to explore the integration of the foundational issues of functional, logic, and object-oriented programming. It offers valuable insights into the fast-developing extensions of logic programming with functions, constraints, concurrency, and objects. Chapters are grouped according to the unifying themes of functional programming, constraint, logic programming, and object-oriented programming.

Logic Programming Languages: Constraints, Functions, and Objects

De Bakker, J. W.

Computer Science

Mit Pr

Constraint logic programming lies at the intersection of logic programming, optimisation and artificial intelligence. It has proved a successful tool in many areas including production planning, transportation scheduling, numerical analysis and bioinformatics. Eclipse is one of the leading software systems that realise its underlying methodology. Eclipse is exploited commercially by Cisco, and is freely available and used for teaching and research in over 500 universities. This book has a two-fold purpose. It's an introduction to constraint programming, appropriate for one-semester courses for upper undergraduate or graduate students in computer science or for programmers wishing to master the practical aspects of constraint programming. By the end of the book, the reader will be able to understand and write constraint programs that solve complex problems. Second, it provides a systematic introduction to the Eclipse system through carefully-chosen examples that guide the reader through the language and illustrate its power, versatility and utility.

Constraint Logic Programming using Eclipse

Wallace, Mark

Cambridge University Press

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.

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Olderog, Ernst-Rüdiger

de Boer, Frank S.

Springer

Edsger Wybe Dijkstra: His Life, Work, and Legacy (Acm Books)

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.

Hoare, Tony

ACM Books

Edsger Wybe Dijkstra: His Life, Work, and Legacy (ACM Books)

Verification of Sequential and Concurrent Programs

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.

This work provides a structured introduction to programme verification and the semantics of structured concurrent programmes. Sequential programmes in the form of deterministic and nondeterministic programmes, and concurrent programmes in the form of parallel and distributed programmes, are considered within the context of their partial and total correctness. The book is appropriate for either a one- or two-term introductory course on programme verification for senior undergraduate studies or for graduate students. It can also be used as an introduction to operational semantics. Outlines of ideas for one-term courses are described in the preface. Within the book, the authors systematically discuss five classes of programmes, concentrating on operational semantics, syntax-directed assertional proof systems, soundness proofs of the proof systems, programme transformations, correctness proofs of the programme transformations and correctness proofs of a substantial example. Each chapter is organized in a systematic manner and ends with a list of exercises. The material presented here draws on work which until now was only available in the form of advanced research publications. This monograph on programme logics and semantics, mathematical logic and normal language and the theory of computation is intended for academics teaching senior undergraduate and graduate-level courses.

Verification of sequential and concurrent programs (Texts and monographs in computer science)

Software

Springer, Verlag

See the best price to sell, buy, or rent books by Apt, Krzysztof R.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Apt, Krzysztof R.

See the best price to sell, buy, or rent books by Apt, Krzysztof R.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

From Logic Programming to Prolog

Logic Programming Languages: Constraints, Functions, and Objects

Constraint Logic Programming using Eclipse

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Edsger Wybe Dijkstra: His Life, Work, and Legacy (Acm Books)

Edsger Wybe Dijkstra: His Life, Work, and Legacy (ACM Books)

Edsger Wybe Dijkstra: His Life, Work, and Legacy (Acm Books)

Verification of Sequential and Concurrent Programs

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Verification of sequential and concurrent programs (Texts and monographs in computer science)