DagSemProc.06191.3.pdf
- Filesize: 0.55 MB
- 3 pages
Document
Animating and Model Checking B Specifications with Higher-Order Recursive Functions
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6191
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-08-08
Cite AsGet BibTex
Michael Leuschel and Jens Bendisposto. Animating and Model Checking B Specifications with Higher-Order Recursive Functions. In Rigorous Methods for Software Construction and Analysis. Dagstuhl Seminar Proceedings, Volume 6191, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.06191.3
https://doi.org/10.4230/DagSemProc.06191.3
Abstract
Real-life specifications often contain complicated functions.
Animation and validation of such functions and specifications is very important.
However, such functions pose a major challenge to animation and model checking.
Earlier versions of ProB required that functions be explicitly expanded
which is prohibitively expensive or impossible. The central idea of this new research is to
compile such functions into symbolic closures which are only examined when the function is applied to some particular argument. This enables ProB to successfully animate and model check a new class
of specifications, where animation is especially important due to the
involved nature of the specification. We will illustrate this new approach on an industrial case study.
Keywords
- B-Method
- Model Checking
- Animation
- Logic Programming
- Visualization
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads