ACM Home Page
Please provide us with feedback. Feedback
Modular refinement of hierarchic reactive machines
Full text PdfPdf (225 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 26 ,  Issue 2  (March 2004) table of contents
Pages: 339 - 369  
Year of Publication: 2004
ISSN:0164-0925
Authors
Rajeev Alur  University of Pennsylvania, Philadelphia, PA
Radu Grosu  State University of New York at Stony Brook, Stony Brook, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 43,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/973097.973101
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
 
5
6
 
7
 
8
 
9
 
10
 
11
 
12
 
13
14
 
15
16
 
17
Harel, D., Pnueli, A., Schmidt, J., and Sherman, R. 1987. On the formal semantics of statecharts. In Proceedings of the 2nd IEEE Symposium on Logic in Computer Science. 54--64.
 
18
 
19
 
20
 
21
22
 
23
24
25
 
26
 
27
 
28
 
29
 
30
 
31
 
32



REVIEW

"Sushil K Birla : Reviewer"

The theoretical foundation presented in this paper significantly enables the application of formal methods in software engineering. The paper mentions avionics software as an example of a reactive system that motivates research on the semantics of  more...