State caching reconsidered

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2989, Issue , 2004, Pages 23-38

  Geldenhuys, Jaco ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MEMORY REQUIREMENTS; RANDOM GRAPHS; RANDOM REPLACEMENTS; TIME CONSUMPTION; UPPER BOUND; VERIFICATION MODEL;

MODEL CHECKING;

EID: 35048849927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24732-6_3     Document Type: Article

References (23)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation. Springer-Verlag, 1999.
2. G. Berhmann, K. G. Larsen, R. Pelánek. To store or not to store. Proc. 15th Intl. Conf. on Computer-Aided Verification, LNCS#2725, pp. 433-445, 2003.
3. L. Brim, I. Černá, M. Nečesal. Randomization helps in LTL model checking. Proc. Joint Intl. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification, LNCS#2165, pp. 105-119, 2001.
4. S. Edelkamp, A. L. Lafuente, S. Leue. Directed explicit model checking with HSF-SPIN. Proc. 8th Intl. SPIN Workshop on Model Checking of Software, LNCS#2057, pp. 57-79, 2001.
5. J. Geldenhuys. Efficiency Issues in the Design of a Model Checker. Master's thesis, University of Stellenbosch, 1999.
6. P. Godefroid. Using partial orders to improve automatic verification methods. Proc. 2nd Intl. Conf. on Computer-Aided Verification, LNCS#531, pp. 176-185, 1990.
7. P. Godefroid, G. J. Holzmann, D. Pirottin. State space caching revisited. Proc. 4th Intl. Conf. on Computer-Aided Verification, LNCS#663, pp. 175-186, 1992.
8. Also appeared in Formal Methods in System Design, 7(3):227-241, 1995. [://www.monteflore.ulg.ac.be/services/verif/po-pack.html
9. P. Godefroid. Partial-order Methods for the Verification of Concurrent Systems, An Approach to the State-explosion Problem. PhD thesis, University of Liège, Dec 1994.
10. Also published as LNCS #1032, Springer-Verlag, 1996.
11. P. Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. Proc. Workshop on Partial Order Methods in Verification, DIMACS Series vol. 29, pp. 289-303, 1996.
12. G. J. Holzmann. Tracing protocols. AT&T Technical J., 64(10):2413-2433, 1985.
13. G. J. Holzmann. Automated protocol validation in Argos, assertion proving and scatter searching. IEEE Trans. on Software Engineering, 13(6):683-696, 1987.
14. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
15. C. Jard, T. Jéron. On-line model checking for finite linear temporal logic specifications. Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS#407, pp. 275-285, 1989.
16. C. Jard, T. Jéron. Bounded memory algorithm for verification on-the-fly. Proc. 3rd Intl. Conf. on Computer-Aided Verification, LNCS#575, pp. 192-202, 1991.
17. C. Jard, T. Jéron, J.-C. Fernandez, L. Mounier. On-the-fly Verification of Finite Transition Systems. Tech. rep. #701, IRISA, 1993.
18. M. Matsumoto, T. Nishimura. Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. on Modeling and Computer Simulation, 8(1):3-30, 1998. [://www.math.keio.ac.jp/~matumoto/emt. html
19. A. N. Parashkevov, J. T. Yantchev. Space efficient reachability analysis through use of pseudo-root states. Proc. 3rd Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, LNCS#1217, pp. 50-64, 1997.
20. D. Peled. All from one, one for all: On model checking using representatives. In Proc. 5th Intl. Conf. Computer-Aided Verification, LNCS #697, pp. 409-423, Jun 1993.
21. U. Stern, D. L. Dill. Combining state space caching and hash compaction. Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI/ITG/GME Workshop, pp. 81-90, 1996.
22. G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2nd edition, 2000.
23. A. Valmari. A stubborn attack on state explosion. Formal Methods in System Design 1(1), pp. 297-322, 1992.