{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:46Z","timestamp":1725488626412},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672821"},{"type":"electronic","value":"9783540464198"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46419-0_15","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:17:25Z","timestamp":1186615045000},"page":"204-219","source":"Crossref","is-referenced-by-count":7,"title":["FMona: A Tool for Expressing Validation Techniques over Infinite State Systems"],"prefix":"10.1007","author":[{"given":"J.-P.","family":"Bodeveix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Filali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/6513.6514","volume":"4","author":"J. Archibald","year":"1986","unstructured":"J. Archibald and J.-L. Baer. Cache coherence protocols: Evaluation using a multiprocessor simulation model. ACM Transactions on Computer Systems, 4(4):273\u2013298, November 1986. 214","journal-title":"ACM Transactions on Computer Systems"},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48683-6_14","volume-title":"Proc. 11th Int. Conf. on Computer Aided Verification","author":"P. A. Abdulla","year":"1999","unstructured":"Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling Global Conditions in Parameterized System Verification. In Proc. 11th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 134\u2013145. Springer Verlag, 1999. 217"},{"key":"15_CR3","series-title":"Lect Notes Comput Sci","first-page":"18","volume-title":"11th International Conference of the European Association for Computer Science Logic (CSL\u2019 97)","author":"A. Ayari","year":"1997","unstructured":"A. Ayari, D. Basin, and A. Podelski. Lisa: A specification language based on ws2s. In 11th International Conference of the European Association for Computer Science Logic (CSL\u2019 97), volume 1414 of LNCS, pages 18\u201334. Springer-Verlag, 1997. 209"},{"key":"15_CR4","unstructured":"A. Arnold. Syst\u00e8mes de transitions finis et s\u00e9mantiques des processus communicants. Etudes et recherches en informatique. MASSON, 1992. 206"},{"key":"15_CR5","unstructured":"BBC+97._B. Barras, S. Boutin, C. Cornes, J. Courant, J.C. Filliatre, E. Gim\u00e9nez, H. Herbelin, G. Huet, C. Mu\u00f1oz, C. Murthy, C. Parent, C. Paulin, A. Sa\u00efbi, and B. Werner. The Coq Proof Assistant Reference Manual \u2014 Version V6.1. Technical Report 0203, INRIA, August 1997. 204"},{"key":"15_CR6","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill. Symbolic model checking: 10E20 states and beyond. In 5th Symposium on Logic in Computer Science, June 1990. 204, 209"},{"key":"15_CR7","unstructured":"J.-P. Bodeveix and M. Filali. Reduction and quantifier elimination techniques for program validation. Formal Methods in System Design, to appear, 1999. 215"},{"key":"15_CR8","unstructured":"J.-P. Bodeveix and M. Filali. The FMONA tool. Technical Report \n                    http:\/\/www.irit.fr\/ACTIVITES\/EQ_COS\/MF\/FMONA\n                    \n                  , IRIT, may 1999. 206, 214"},{"key":"15_CR9","volume-title":"International Workshop on Distributed System Validation and Verification","author":"J.-P. Bodeveix","year":"2000","unstructured":"J.-P. Bodeveix and M. Filali. Experimenting acceleration methods for the validation of infinite state systems. In Dr. Pao-Ann Hsiung, editor, International Workshop on Distributed System Validation and Verification, Institute of Information Science, Academia Sinica, Taiwan, R.O.C., april 2000. to appear. 217"},{"key":"15_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BFb0028755","volume-title":"Computer-Aided Verification (CAV\u201998)","author":"S. Bensalem","year":"1998","unstructured":"S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionnaly and automatically. In Computer-Aided Verification (CAV\u201998), volume 1427 of Lecture Notes in Computer Science, pages 319\u2013331, Vancouver, BC, Canada, june 1998. Springer-Verlag. \n                    http:\/\/www.csl.sri.com\/~owre\/cav98.html\n                    \n                  . 208, 212"},{"issue":"5","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"E.M. Clarke, O. Grumber, and D.E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512\u20131542, september 1994. 208","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"5","key":"15_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E. W. Dijkstra","year":"1983","unstructured":"E. W. Dijkstra, W. H. J. Feijen, and A. J. M. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16(5):217\u2013219, june 1983. 217","journal-title":"Information Processing Letters"},{"key":"15_CR13","unstructured":"M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge University Press, 1994. 204"},{"key":"15_CR14","unstructured":"HJJ+95._J.G. Henriksen, J.L. Jensen, M.S. Jorgensen, N. Klarlund, R. Paige, T. Rauhe, and A.B. Sandholm. Mona: Monadic second-order logic in practice. In Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 58\u201373, Aarhus, May 1995. 204, 206"},{"key":"15_CR15","unstructured":"G.J. Holzmann. Design and validation of computer protocols. Prentice Hall, 1991. 204"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S1571-0661(05)80429-3","volume":"9","author":"D. Lessens","year":"1997","unstructured":"Lessens, D. and Sa\u00efdi, H. Abstraction of parameterized networks. Electronic notes in theoretical computer science, 9:12, 1997. \n                    http:\/\/www.elsevier.nl\/locate\/entcs\/volume9.html\n                    \n                  . 211","journal-title":"Electronic notes in theoretical computer science"},{"issue":"3","key":"15_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0167-6423(85)90015-2","volume":"5","author":"A.J. Martin","year":"1985","unstructured":"A.J. Martin. Distributed mutual exclusion on a ring of processes. Science of Computer Programming, 5(3):265\u2013276, October 1985. 217","journal-title":"Science of Computer Programming"},{"key":"15_CR18","series-title":"Lect Notes Comput Sci","volume-title":"PVS: A prototype verification system","author":"S. Owre","year":"1992","unstructured":"S. Owre, J.M. Rushby, and N. Shankar. PVS: A prototype verification system. Lecture Notes in Computer Science, 607, 1992. 204"},{"key":"15_CR19","unstructured":"J.L. Peterson and A. Silberschatz. Operating system concepts. Addison-Wesley, 1985. 214"},{"issue":"6","key":"15_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/2.55497","volume":"23","author":"P. Stenstrom","year":"1990","unstructured":"P. Stenstrom. A survey of cache coherence schemes for multiprocessors. Computer, 23(6):11\u201325, June 1990. 214","journal-title":"Computer"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"B.K. Szymanski. Mutual exclusion revisited. In fifth Jerusalem conference on information technology, pages 110\u2013117. IEEE Computer Society Press, 1990. 217","DOI":"10.1109\/JCIT.1990.128275"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J.v. Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133\u2013192. MIT Press, 1990. 205, 209","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46419-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T05:08:10Z","timestamp":1550725690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46419-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672821","9783540464198"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-46419-0_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}