OASIcs.TrustworthySW.2006.701.pdf
- Filesize: 236 kB
- 6 pages
Document
Explaining Data Type Reduction in the Shape Analysis Framework
Author
-
Part of:
Volume:
Workshop on Trustworthy Software (TrustworthySW 2006)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2006-09-26
File
Document Identifiers
Cite AsGet BibTex
Björn Wachter. Explaining Data Type Reduction in the Shape Analysis Framework. In Workshop on Trustworthy Software. Open Access Series in Informatics (OASIcs), Volume 3, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/OASIcs.TrustworthySW.2006.701
https://doi.org/10.4230/OASIcs.TrustworthySW.2006.701
Abstract
Automatic formal verification of systems composed of a large or even unbounded
number of components is difficult as the state space of these systems is
prohibitively large. Abstraction techniques automatically construct finite
approximations of infinite-state systems from which safe information about
the original system can be inferred. We study two abstraction techniques
shape analysis, a technique from program analysis, and data type reduction,
originating from model checking. Until recently we did not properly understand
how shape analysis and data type reduction relate. In this talk, we shed light
on this relation in a comprehensive way. This is a step towards a more
unified view of abstraction employed in the static analysis and model checking
community.
Keywords
- Canonical abstraction
- data type reduction
- model checking
- parameterized system
- infinite-state
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads