This work was partly funded by the french national project C 3 on parallelism.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G.V. Bochmann. Finite state description of communication protocols. Computer Networks, 2, October 1978.
A. Bouajjani, J.-C. Fernandez, and N. Halbwachs. Minimal model generation. In Workshop on Computer Aided Verification DIMACS 90, June 1990.
E.M. Clarke and O. Grumberg. Avoiding the state explosion problem in temporal logic model checking algorithms. 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1987.
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. In Workshop on Computer Aided Verification, DIMACS 90, June 1990.
J.-C. Fernandez and L. Mounier. Verifying bisimulation on the fly. In Third International Conference on Formal Description Techniques, FORTE'90, Madrid, November 1990.
A. Finkel and G. Memmi. An introduction to fifo nets — monogeneous nets: a subclass of fifo nets. Theoretical Computer Science, 35:191–214, 1985.
P. Godefroid and P. Wolper. A partial approach to model checking. In 6th IEEE Symposium on Logic in Computer Science, Amsterdam, July 1991.
S. Graf and B. Steffen. Compositional minimization of finite state processes. In Workshop on Computer Aided Verification DIMACS 90, June 1990.
G. Holzmann. Tracing protocols. ATT Technical Journal, 64(10):2413–2434, 1985.
G.J. Holzmann. Algorithms for automated protocol validation. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, June 1989.
G.J. Holzmann. Automated protocol validation in ARGOS, assertion proving and scatter searching. IEEE trans. on Software Engineering, Vol 13, No 6, June 1987.
ISO 9074. Estelle: a Formal Description Technique based on an Extented State Transition Model. ISO TC97/SC21/WG6.1, 1986.
C. Jard, R. Groz, and J.F. Monin. Development of VEDA: a prototyping tool for distributed algorithms. In IEEE Trans. on Software Engin., March 1988.
C. Jard, R. Groz, and J-F. Monin. Véda: a software simulator for the validation of protocol specifications. In COMNET'85, Hungary, October 1985.
C. Jard and T. Jéron. On-line model-checking for finite linear temporal logic specifications. In Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, June 1989. Springer-Verlag, LNCS #407, pages 275–285.
T. Jéron. Contribution à la validation des protocoles: test d'infinitude et vérification à la volée. Ph.D Thesis, University of Rennes I, May 1991.
T. Jéron. Testing for unboundedness of fifo channels. In STACS 91: Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 1991. Springer-Verlag, LNCS #480, pages 322–333.
R. Martin and G. Memmi. Spécification et validation de systèmes temps réel à l'aide de réseaux de Pétri à files. Technical Report 3, Revue Tech. Thomson-CSF, Sept. 1981.
J.-M. Pageot and C. Jard. Experience in guiding simulation. Protocol Specification, Testing and Verification, VIII, IFIP, 207–218, June 1988.
A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. LNCS #224, Current Trends in Concurrency, 510–584, 1986.
A. Valmari. A stubborn attack on state explosion. In Workshop on Computer Aided Verification DIMACS 90, June 1990.
C.H. West. General techniques for communication protocols. IBM J. Res. Develop., 22, july 1978.
C. H. West. Protocol validation by random state exploration. In 6th IFIP International Workshop on Protocol Specification, Testing and Verification, Montréal, Gray rock, North Holland, June 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jard, C., Jéron, T. (1992). Bounded-memory algorithms for verification on-the-fly. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive