A graph-theoretic approach for timing analysis and its implementation
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Real-time object-oriented modeling
Real-time object-oriented modeling
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Requirements Specification for Process-Control Systems
IEEE Transactions on Software Engineering
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Spectrum
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking of hierarchical state machines
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Ninth International Conference on Information and Knowledge Management
JMOCHA: a model checking tool that exploits design structure
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Symbolic Model Checking
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Model Checking Large Software Specifications
IEEE Transactions on Software Engineering
What is in a Step: On the Semantics of Statecharts
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
The Village Telephone System: A Case Study in Formal Software Engineering
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
A Compositional Semantics for Statecharts using Labeled Transition Systems
CONCUR '94 Proceedings of the Concurrency Theory
AutoFocus: A Tool for Distributed Systems Specification
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Proof Technique for Rely/Guarantee Properties
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
A Compositional Rule for Hardware Design Refinement
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
You Assume, We Guarantee: Methodology and Case Studies
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Reachability Analysis of Hierarchical Reactive Machines
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
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Compositional verification of sequential programs with procedures
Information and Computation
Hi-index | 0.00 |
Scalable formal analysis of reactive programs demands integration of modular reasoning techniques with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hierarchy that describes the communication structure between component processes, and have been shown to be useful. In this paper, we develop the theory of modular reasoning for behavior hierarchy that describes control structure using hierarchic modes. From Statecharts to UML, behavior hierarchy has been an integral component of many software design languages, but only syntactically. We present the hierarchic reactive modules language that retains powerful features such as nested modes, mode reuse, exceptions, group transitions, history, and conjunctive modes, and yet has a semantic notion of mode hierarchy. We present an observational trace semantics for modes that provides the basis for mode refinement. We show the refinement to be compositional with respect to the mode constructors, and develop an assume-guarantee reasoning principle.