Abstract
In recent times, there has been growing interest in model checking software systems. Such efforts bring into focus the memory constraints of model checking approaches. In this paper, we present our results from the analysis (at the source code level) of a real-time operating system using the Spin model checker and explain our efforts to understand the reasons for the extremely large state space. Our studies indicate that even hand-optimized models suffer from memory constraints, thereby indicating the need for other approaches that break the problem into smaller pieces.
This material is based upon work supported in part by NASA under cooperative agreement NCC-1-399.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Design Description Document for the Digital Engine Operating System, Honeywell specification no. PS7022409
Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolid Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, p. 193. Springer, Heidelberg (1999)
Binns, P.: A robust high-performance time partitioning algorithm: the Digital Engine Operating System (DEOS) approach. In: 20th Digital Avionics System Conference Proceedings (October 2001)
Avrunin, G.S., Corbett, J.C., Dwyer, M.B., Pasareanu, C.S., Siegel, S.F.: Comparing finite-state verification techniques for concurrent software, Technical Report UM-CS-1999-069, Department of Computer Science, University of Massachusetts (November 1999)
Havelund, K., Pressburger, T.: Model Checking Java Programs Using Java Path-Finder. International Journal on Software Tools for Technology Transfer (STTT) 2(4) (April 2000)
Holzmann, G.: An analysis of bitstate hashing. Formal Methods in Systems Design (November 1998)
Holzmann, G.: The model checker Spin. IEEE Transactions on Software Engineering 23(5), 279–295 (1997)
Lehoczky, J.P., Ramos-Thuel, S.: An optimal algorithm for scheduling aperiodic tasks in fixed-priority preemptive systems. In: IEEE Real-Time Systems Symposium (December 1992)
Lerda, F., Sisto, R.: Distributed Memory Model Checking with SPIN. In: 5th International SPIN Workshop on Theoretical Aspects of Model Checking (July 1999)
Liu, C.L., Leyland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard Real Time Environment. Journal of the ACM 20(1), 46–61 (1973)
Penix, J., Visser, W., Engstrom, E., Larson, A., Weininger, N.: Translation and Verification of the Deos Scheduling Kernel. Technical report, NASA Ames Research Center/ Honeywell Technology Center (October 1999)
Owre, S., Rushby, J.M., Shankar, N.: PVS: A Prototype Verification System. In: 11th Conference on Automated Deduction, Saratoga, NY (June 1992)
The Bandera Project, http://www.cis.ksu.edu/santos/bandera/
The SMV system, http://www-2.cs.cmu.edu/~modelcheck/smv.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rangarajan, M., Cofer, D. (2004). Model-Checking Complex Software – A Memory Perspective. In: Wirsing, M., Knapp, A., Balsamo, S. (eds) Radical Innovations of Software and Systems Engineering in the Future. RISSEF 2002. Lecture Notes in Computer Science, vol 2941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24626-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24626-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21179-2
Online ISBN: 978-3-540-24626-8
eBook Packages: Springer Book Archive