Deriving programs using generic algorithms
IBM Systems Journal
25 Years of Model Checking
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Modular Verification of Recursive Programs
Languages: From Formal to Natural
Proving Quicksort Correct in Event-B
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pillars of computer science
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Refining nodes and edges of state machines
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Verifying traits: a proof system for fine-grained reuse
Proceedings of the 13th Workshop on Formal Techniques for Java-Like Programs
Structured event-b models and proofs
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Verification of object-oriented programs: A transformational approach
Journal of Computer and System Sciences
A transformational proof system for delta-oriented programming
Proceedings of the 16th International Software Product Line Conference - Volume 2
Unifying correctness statements
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Hoare-Style Verification of Graph Programs
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
A relational trace logic for simple hierarchical actor-based component systems
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
Verification of graph programs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof Systems for Planning Under Cautious Semantics
Minds and Machines
Local Reasoning for Global Invariants, Part II: Dynamic Boundaries
Journal of the ACM (JACM)
Local Reasoning for Global Invariants, Part I: Region Logic
Journal of the ACM (JACM)
State based encapsulation for modular reasoning about behavior-preserving refactorings
Aliasing in Object-Oriented Programming
A method and tool for tracing requirements into specifications
Science of Computer Programming
| Hi-index | 0.00 |
This widely anticipated third edition provides a systematic exploration of one of the most common approaches to program verification, known as the assertional approach. This approach is applied to deterministic and nondeterministic sequential programs of varying complexity, together with both parallel and distributed concurrent programs. The expanded content also includes coverage of the verification of object-oriented programs. For each class of programs, the authors introduce proof systems for the verification of partial and total correctness, justified formally in corresponding soundness theorems. Case studies supplied throughout the book demonstrate the use of the proof systems and formally verify solutions to classical problems, such as producer/consumer and mutual exclusion. This modern update of a classic, reader-friendly textbook is perfect for an introductory course on program verification for advanced undergraduate or graduate students. Outlines for possible courses are suggested in the Preface.