Skip to main content
Conference ProceedingsOPEN ACCESS

Bounded-memory algorithms for verification on-the-fly

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 575 LNCS 192-202
DOI: 10.1007/3-540-55179-4_19
38Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Cite

CITATION STYLE

APA

Jard, C., & Jéron, T. (1992). Bounded-memory algorithms for verification on-the-fly. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 192–202). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free