Article

Free access

Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems

Authors:

Richard A. KemmererAuthors Info & Claims

ICSE '00: Proceedings of the 22nd international conference on Software engineering

Pages 345 - 354

https://doi.org/10.1145/337180.337220

Published: 01 June 2000 Publication History

Abstract

ASTRAL is a high-level formal specification language for real-time systems. It has structuring mechanisms that allow one to build modularized specifications of complex real-time systems with layering. Based upon the ASTRAL symbolic model checler reported in [13], three approximation techniques to speed-up the model checking process for use in debugging a specification are presented. The techniques are random walk, partial image and dynamic environment generation. Ten mutation tests on a railroad crossing benchmark are used to compare the performance of the techniques applied separately and in combination. The test results are presented and analyzed.

References

[1]

K. Brink, L. Bun, J. van Katwijk and W. J. Toetenel, \Hybrid specification of control systems," First IEEE International Conference on Engineering of Complex Computer Systems, Ft. Lauderdale, Florida, 1995.]]

Digital Library

[2]

G. Buonanno, A. Coen-Porisini and W. Fornaciari, \Hardware specification using the assertion language ASTRAL," Proceedings of the Advanced Research Workshop on Correct Hardware Design Methodologies, Torino, Italy, June 1991.]]

[3]

T. Bultan, R. Gerber, and C. League, \Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach." Proceedings of the 1998 ACM/SIGSOFT International Symposium on Software Testing and Analysis (ISSTA '98), 1998, pp. 113-123.]]

Digital Library

[4]

T. Bultan, R. Gerber, and W. Pugh, \Symbolic Model Checking of In nite State Systems Using Presburger Arithmetic," CAV'97, 1997, pp. 400-411.]]

Digital Library

[5]

T. Bultan, R. Gerber, and W. Pugh, \Model Checking Concurrent Systems with Unbounded Integer Variables: Symbolic Representations, Approximations and Experimental Results." To appear inACM Transactions on Programming Languages and Systems.]]

Digital Library

[6]

N. S. Bjorner, Z. Manna, H. B. Sipma, and T. E. Uribe, \Deductive Verification of Real-time Systems using STeP," 4th International AMAST Workshop on Real-time Systems, LNCS vol 1231, 1997, pp. 22- 43.]]

Digital Library

[7]

N. S. Bjorner, A. Browne, E. Chang, M. Colon, A. Kapur, Z. Manna, H. Sipma, and T. Uribe, \STeP: Deductive-Algorithmic Verification of Reactive and Real-time Systems." CAV 96, LNCS vol. 1102, 1996, pp. 415-418.]]

Digital Library

[8]

C. Colby, P. Godefroid and L. J. Jagadeesan, \Automatically closing open reactive programs," Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, SIGPLAN Notices, vol. 33, No.5, 1998, pp. 345-357.]]

Digital Library

[9]

A. Coen-Porisini, C. Ghezzi and R. Kemmerer, \Specification of real-time systems using ASTRAL," IEEE Transactions on Software Engineering, Vol. 23, No. 9, 1997, pp. 572-598.]]

Digital Library

[10]

A. Coen-Porisini, R. Kemmerer and D. Mandrioli, \A formal framework for ASTRAL intralevel proof obligations," IEEE Transactions on Software Engineering, Vol. 20, No. 8, 1994, pp. 548-561.]]

Digital Library

[11]

Z. Dang and R. Kemmerer, \Using the ASTRAL model checker for cryptographic protocol analysis," Proceedings of the DIMACS Workshop on Design and Formal Verification of Security Protocols, Rutgers University, 1997.]]

[12]

Z. Dang and R. A. Kemmerer, \Using the AS- TRAL model checker to analyze Mobile IP," Proc. of ICSE'99, 1999, pp. 132-141.]]

Digital Library

[13]

Z. Dang and R. A. Kemmerer, \A Symbolic Model Checker for Testing ASTRAL Real-time specifications," Proc. of RTCSA'99.]]

Digital Library

[14]

Z. Dang and R. A. Kemmerer, \Dynamic Environment Generations for an ASTRAL Process," Technical Report TRCS00-03, Department of Computer Science, University of California, Santa Barbara, March 2000.]]

Digital Library

[15]

J. W. Duran and S. Ntafos, \A report on random testing," Proc. of ICSE'81, 1981, pp. 179-183.]]

Digital Library

[16]

J. W. Duran and J. J. Wiorkowski, \Quantifying software validity by sampling," IEEE Transactions on Reliability, Vol. R-29, June 1980, pp. 141-144.]]

[17]

P. Godefroid, \Model checking for programming languages using VeriSoft," POPL 97, Paris, 1997.]]

Digital Library

[18]

P. Godefroid and P. Wolper, \ A partial approach to model checking. ", Information and Computation, 110(2) 1994, pp. 305-326.]]

Digital Library

[19]

C. Heitmeyer and N. Lynch, \The generalized railroad crossing: a case study in formal verification of real-time systems," Proc. of 15th Real-time Systems Symposium, 1994, pp. 120-131.]]

[20]

P. Z. Kolano, \Proof Assistance for Real-Time Systems Using an Interactive Theorem Prover," 5th International AMAST Workshop on Real-Time and Probabilistic Systems, LNCS Vol. 1601, pp. 315-333.]]

Digital Library

[21]

R. Kemmerer, T. Bultan, P. Z. Kolano and Z. Dang, \ Mutation tests for ASTRAL real-time specifications," in preparation.]]

[22]

P. Z. Kolano, Z. Dang and R. Kemmerer, \The design and analysis of real-time systems using the ASTRAL software development environment," Annals of Software Engineering, Vol. 7, pp. 177-210, 1999.]]

Digital Library

[23]

W. Pugh, \The Omega test: a fast and practical integer programming algorithm for dependence analysis," Communications of the ACM, Vol. 8, 1992, pp. 102-104.]]

Digital Library

Cited By

Karna AChen YYu HZhong HZhao J(2018)The role of model checking in software engineeringFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-016-6192-012:4(642-668)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s11704-016-6192-0
Jones MSorber J(2005)Parallel search for LTL violationsInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/2932439.29325637:1(31-42)Online publication date: 1-Feb-2005
https://dl.acm.org/doi/10.5555/2932439.2932563
Dang ZBultan TIbarra OKemmerer R(2004)Past pushdown timed automata and safety verificationTheoretical Computer Science10.1016/j.tcs.2003.10.004313:1(57-71)Online publication date: 16-Feb-2004
https://dl.acm.org/doi/10.1016/j.tcs.2003.10.004
Show More Cited By

Index Terms

Recommendations

A Formal Framework for ASTRAL Intralevel Proof Obligations

ASTRAL is a formal specification language for real-time systems. It is intended to support formal software development, and therefore has been formally defined. This paper focuses on how to formally prove the mathematical correctness of ASTRAL ...
Classification schemes to aid in the analysis of real-time systems

This paper presents three sets of classification schemes for processes, properties, and transitions that can be used to assist in the analysis of real-time systems. These classification schemes are discussed in the context of ASTRAL, which is a formal ...
Classification schemes to aid in the analysis of real-time systems
ISSTA '00: Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis

This paper presents three sets of classification schemes for processes, properties, and transitions that can be used to assist in the analysis of real-time systems. These classification schemes are discussed in the context of ASTRAL, which is a formal ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICSE '00: Proceedings of the 22nd international conference on Software engineering

June 2000

843 pages

ISBN:1581132069

DOI:10.1145/337180

Chairmen:
Carlo Ghezzi
Politecnico di Milano, Milau, Italy
,
Mehdi Jazayeri
Technical Univ. of Vienna, Vienna, Austria
,
Alexander L. Wolf
Univ. of Colorado, Boulder, USA

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Irish Comp Soc: Irish Computer Society
SIGSOFT: ACM Special Interest Group on Software Engineering
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICSE00

Sponsor:

Irish Comp Soc
SIGSOFT
IEEE-CS

ICSE00: 22nd International Conference on Software Engineering

June 4 - 11, 2000

Limerick, Ireland

Acceptance Rates

Overall Acceptance Rate 276 of 1,856 submissions, 15%

Upcoming Conference

ICSE 2025

2025 IEEE/ACM 46th International Conference on Software Engineering

April 26 - May 3, 2025

Ottawa , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
299
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)3

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Karna AChen YYu HZhong HZhao J(2018)The role of model checking in software engineeringFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-016-6192-012:4(642-668)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s11704-016-6192-0
Jones MSorber J(2005)Parallel search for LTL violationsInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/2932439.29325637:1(31-42)Online publication date: 1-Feb-2005
https://dl.acm.org/doi/10.5555/2932439.2932563
Dang ZBultan TIbarra OKemmerer R(2004)Past pushdown timed automata and safety verificationTheoretical Computer Science10.1016/j.tcs.2003.10.004313:1(57-71)Online publication date: 16-Feb-2004
https://dl.acm.org/doi/10.1016/j.tcs.2003.10.004
Boigelot BLatour L(2004)Counting the solutions of Presburger equations without enumerating themTheoretical Computer Science10.1016/j.tcs.2003.10.002313:1(17-29)Online publication date: 16-Feb-2004
https://dl.acm.org/doi/10.1016/j.tcs.2003.10.002
Dang ZIbarra OKemmerer R(2003)Generalized discrete timed automataTheoretical Computer Science10.1016/S0304-3975(02)00432-2296:1(59-74)Online publication date: 4-Mar-2003
https://dl.acm.org/doi/10.1016/S0304-3975%2802%2900432-2
Jones MSorber J(2003)Parallel search for LTL violationsInternational Journal on Software Tools for Technology Transfer10.1007/s10009-003-0115-87:1(31-42)Online publication date: 28-Nov-2003
https://doi.org/10.1007/s10009-003-0115-8
Ibarra ODang ZSun Z(2003)Safety Verification for Two-Way Finite Automata with Monotonic CountersDevelopments in Language Theory10.1007/3-540-45005-X_29(326-338)Online publication date: 24-Jun-2003
https://doi.org/10.1007/3-540-45005-X_29
Ibarra ODang ZSun Z(2002)Safety verification for two-way finite automata with monotonic countersProceedings of the 6th international conference on Developments in language theory10.5555/1755091.1755122(326-338)Online publication date: 18-Sep-2002
https://dl.acm.org/doi/10.5555/1755091.1755122
Dang ZIbarra OPietro P(2001)Liveness Verification of Reversal-Bounded Multicounter Machines with a Free CounterFST TCS 2001: Foundations of Software Technology and Theoretical Computer Science10.1007/3-540-45294-X_12(132-143)Online publication date: 26-Nov-2001
https://doi.org/10.1007/3-540-45294-X_12

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents