State Spaces --- The Locale Way

Authors:
Norbert Schirmer;Makarius Wenzel
Affiliations:
German Research Center for Artificial Intelligence (DFKI) Saarbrücken, Germany;Technische Universität München, Institut für Informatik
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 14
Cited 2

Mechanizing programming logics in higher order logic

Current trends in hardware verification and automated theorem proving
Trustworthy tools for trustworthy programs: a mechanically verified verification condition generator for the total correctness of procedures

Trustworthy tools for trustworthy programs: a mechanically verified verification condition generator for the total correctness of procedures
Should your specification language be typed

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mechanizing a theory of program composition for UNITY

ACM Transactions on Programming Languages and Systems (TOPLAS)
Refinement Calculus: A Systematic Introduction

Refinement Calculus: A Systematic Introduction
Program Verification using HOL-UNITY

HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
A Modular Coding of UNITY in COQ

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Object-Oriented Verification Based on Record Subtyping in Higher-Order Logic

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Proving Pointer Programs in Hoare Logic

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Mechanizing compositional reasoning for concurrent systems: some lessons

Formal Aspects of Computing
Proving pointer programs in higher-order logic

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Building formal method tools in the Isabelle/Isar framework

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Interpretation of locales in isabelle: theories and proof contexts

MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management

Verification of the Schorr-Waite algorithm - from trees to graphs

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Locales: A Module System for Mathematical Theories

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Verification of imperative programs means reasoning about modifications of a program state. So proper representation of state spaces is crucial for the usability of a corresponding verification environment. In this paper we discuss various existing state space models under different aspects like strong typing, modularity and scalability. We also propose a variant based on the locale infrastructure of Isabelle. Thus we manage to combine the advantages of previous formulations (without suffering from their disadvantages), and gain extra flexibility in composing state space components (inherited from the modularity of locales).