Experiments in program verification using Event-B
From MaRDI portal
Publication:432154
DOI10.1007/s00165-011-0205-4zbMath1242.68067OpenAlexW2018217105MaRDI QIDQ432154
Michael Leuschel, Stefan Hallerstede
Publication date: 3 July 2012
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-011-0205-4
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Verification of sequential and concurrent programs
- The derivation of systolic computations
- A synthesis of several sorting algorithms
- On the Purpose of Event-B Proof Obligations
- Modular Verification of Recursive Programs
- Incremental System Modelling in Event-B
- Distributed cooperation with action systems
- The B-Book
- Abstract State Machines
- Proof of a recursive program: Quicksort
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Experiments in program verification using Event-B