Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421980 | Electronic Notes in Theoretical Computer Science | 2009 | 19 Pages |
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).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics