| Generation of multi-formalism state-space analysis tools |
| Full text |
Pdf
(732 KB)
|
| Source
|
International Symposium on Software Testing and Analysis
archive
Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
table of contents
San Diego, California, United States
Pages: 172 - 179
Year of Publication: 1996
ISBN:0-89791-787-1
Also published in ...
|
|
Authors
|
|
Mauro Pezzè
|
Dipartimento di Elettronica e dell 'Informazione, Polztecnico di Milano, Ptazza Leonardo da Vinci 32
|
|
Michal Young
|
Software Engineering Research Center, Department of Computer Sciences, Purdue University, West Lafayette, IN
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 9, Citation Count: 6
|
|
|
ABSTRACT
As software evolves from early architectural sketches to final code, a variety of representations are appropriate. Moreover, at most points in development, different portions of a software system are at different stages in development, and consequently in different representations. State-space analysis techniques (reachability analysis, model checking, simulation, etc.) have been developed for several representations of concurrent systems, but each tool or technique has typically been targeted to a single design or program notation.We describe an approach to constructing space analysis tools using a core set of basic representations and components. Such a tool generation approach differs from translation to a common formalism. We need not map every supported design formalism to a single internal form that completely captures the original semantics; rather, a shared "inframodel" represents only the essential information for interpretation by tool components that can be customized to reflect the semantics of each formalism. This results in more natural and compact internal representations, and more efficient analysis, than a purely translational approach.We illustrate the approach by applying the prototype tool to a small example problem, coordination of access to a coffee machine. The coffee machine is controlled by an Ada program, and the protocol of human users is modeled with Petri nets. Nets and process graph models are represented in the common internal form, and their composite behavior is analyzed by the prototype tool.
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.
 |
DAW88
|
|
| |
GM87
|
Carlo Ghezzi and Dino Mandnoh On eclectlcmm m specifications A case study centered around petn nets. In ?roceed,ngs gth Internat~onaI Workshop on Software Specification and Design, pages 216-225, Monterey, April 1987 IEEE Computer Socmty.
|
| |
Rei85
|
Wolfgang Remlg. Pert, Nets. EATCS Monographs on Theoretical Computer Science Sprmger-Verlag, 1985
|
| |
REmP93
|
Raino Lintulampi Ren~ Elmstr0 m and Mauro Pezz~ Glvmg Semantics to SA/RT by Means of High Level Timed Petn Nets Journal of Real-Tame Systems, 5(2/3)'249- 272, May 1993
|
| |
RR92
|
|
| |
San89
|
|
| |
YY91
|
W~i Jen Yeh and Mmhal Young Compositional teachability analyms usmg process algebra In Proceedmgs of the Symposium on Software Testmg, Analys~s, and Verification (TAVg), pages 49-59, Vlctorm, British Columbia, October 1991 ACM SIGSOFT, ACMPress
|
| |
YY94
|
Wei Jen Yeh and Michal Young. Redesigning tasking structures of Ada programs for analysis A case study Software Testing, Verification, and Rehab~hty, 4 223- 253, December 1994.
|
| |
Zav89
|
|
 |
ZJ93
|
|
CITED BY 6
|
|
|
|
|
|
|
|
George S. Avrunin , James C. Corbett , Laura K. Dillon, Analyzing partially-implemented real-time systems, Proceedings of the 19th international conference on Software engineering, p.228-238, May 17-23, 1997, Boston, Massachusetts, United States
|
|
|
|
|
|
|
|
|
|
|