Galois connections and computer science applications
Proceedings of a tutorial and workshop on Category theory and computer programming
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Tamagotchis Need Not Die - Verification of STATEMENT Design
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Combining Model Checking and Deduction for I/O-Automata
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Representing Hierarchical Automata in Interactive Theorem Provers
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Abstract and Model Check While You Prove
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A Model Checker for Statecharts
A Model Checker for Statecharts
| Hi-index | 0.00 |
Hierarchical automata (HAs) represent a structured model of statecharts previously formalized in Isabelle/HOL. The present work extends this framework by an abstraction technique for HAs defined on infinite data spaces. This structure preserving abstraction enables the connection of the framework to the model checker SMV. This paper reports on the following results (a) We discuss abstractions of sequential automata, from which HAs are composed. Here we focus on the special problems of synchronous models and examine the feasibility of constructions for over- and underapproximations in order to preserve CTL properties. (b) Based on this results we describe a compositional abstraction technique, which can be applied to HAs. (c) We extend the formalization of HAs in Isabelle/HOL by suitable operators to construct abstractions inside the logic. (d) We present an efficient implementation of the abstraction process outside of the logic, which is integrated in the formalization by the oracle interface of Isabelle.