A CSP-based framework for the specification, verification, and implementation of adaptive systems
Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
Maintaining database integrity with refinement types
Proceedings of the 25th European conference on Object-oriented programming
Outsidein(x) modular type inference with local assumptions
Journal of Functional Programming - Dedicated to ICFP 2009
Automatic inference of specifications using matching logic
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Annotations for alloy: automated incremental analysis using domain specific solvers
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Hi-index | 0.00 |
Thousands of different programming languages exist, and many more are being created each year, yet all those involved in such work must acknowledge that it is the highest goal of programming language design to enable good ideas to be elegantly expressed. These are the words of Sir Charles Antony Richard Hoare, or Tony Hoare to his colleagues and friends, a man who has inspired generations of researchers in computer science. His work, grounded in practical programming, has had a profound impact on the evolution of the field. This includes the development of Hoare logic and Communicating Sequential Processes (CSP). Reflections on the Work of C.A.R. Hoare presents a comprehensive edited survey of all aspects of these subjects, with original contributions by more than 30 international leaders in the field. The book, while honoring Hoares important contributions, assembles a collection of chapters showing the state of the art in programming languages, sequential programs, concurrency, and unified theories of programming. Topics and features: demonstrates a principled combination of CSP and functional programming, and the expression of CSP semantics to -calculus; reviews methods for proving Hoare formulae based on the computation of postconditions and preconditions; investigates developments in game semantics and semantics based on the state monad; examines the satisfiability problem, void safety, and issues of auxiliary variables; introduces type families in Haskell and a description of Quicksort in Orc; describes an experiment using the Tokeneer archive, and a correctness proof of cryptographic protocols based on the Shadow Security model; presents a representation of CSP as a bigraphical reactive system, and shows how simple entities can be related to CSP processes; discusses the problem frames approach, and explores algebraic properties of the new programming combinators. This accessible monograph is an ideal overview of theoretical and empirical evolution in programming logic and semantics of programming languages. It will serve as an invaluable resource for professionals, researchers, libraries, and students who are interested in broadening their knowledge in all of the areas covered.