{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:26:53Z","timestamp":1748071613230},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662020"},{"type":"electronic","value":"9783540486831"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48683-6_15","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T23:22:18Z","timestamp":1191712938000},"page":"146-159","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Aurore","family":"Annichini","sequence":"additional","affiliation":[]},{"given":"Saddek","family":"Bensalem","sequence":"additional","affiliation":[]},{"given":"Ahmed","family":"Bouajjani","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Habermehl","sequence":"additional","affiliation":[]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","volume-title":"TACAS\u201999","author":"P. Abdulla","year":"1999","unstructured":"P. Abdulla, A. Annichini, and A. Bouajjani. Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol. In TACAS\u201999. LNCS 1579, 1999. 149, 154"},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201998","author":"P. Abdulla","year":"1998","unstructured":"P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In CAV\u201998. LNCS 1427, 1998. 147, 149, 154, 154, 154"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"P.A. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. Inform. and Comput., 127(2):91\u2013101, 1996. 147","journal-title":"Inform. and Comput."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The Algorithmic Analysis of Hybrid Systems. TCS, 138, 1995. 147","DOI":"10.1016\/0304-3975(94)00202-T"},{"key":"15_CR5","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201998","author":"S. Bensalem","year":"1998","unstructured":"S. Bensalem, Y. Lakhnech, and S. Owre. Computing Abstractions of Infinite State Systems Compositionally and Automatically. In CAV\u201998. LNCS 1427, 1998. 147, 148, 151"},{"key":"15_CR6","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201998","author":"S. Bensalem","year":"1998","unstructured":"S. Bensalem, Y. Lakhnech, and S. Owre. InVeSt: A Tool for the Verification of Invariants. In CAV\u201998. LNCS 1427, 1998. 147, 148"},{"key":"15_CR7","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201996","author":"B. Boigelot","year":"1996","unstructured":"B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In CAV\u201996. LNCS 1102, 1996. 147, 154"},{"key":"15_CR8","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201994","author":"B. Boigelot","year":"1994","unstructured":"B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV\u201994. LNCS 818, 1994. 147, 154"},{"key":"15_CR9","series-title":"Lect Notes Comput Sci","volume-title":"CONCUR\u201997","author":"A. Bouajjani","year":"1997","unstructured":"A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR\u201997. LNCS 1243, 1997. 147"},{"key":"15_CR10","series-title":"Lect Notes Comput Sci","volume-title":"ICALP\u201997","author":"A. Bouajjani","year":"1997","unstructured":"A. Bouajjani and P. Habermehl. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. In ICALP\u201997. LNCS 1256, 1997. 147"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"G\u00e9rard C\u00e9c\u00e9, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Inform. and Comput., 124(1):20\u201331, 1996. 154","journal-title":"Inform. and Comput."},{"issue":"5","key":"15_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM TOPLAS, 16(5), 1994. 147, 151","journal-title":"ACM TOPLAS"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In IFIP Conf. on Formal Description of Programming Concepts. North-Holland Pub., 1977. 147, 150, 154","DOI":"10.1145\/800022.808314"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In POPL\u201978. ACM, 1978. 147","DOI":"10.1145\/512760.512770"},{"key":"15_CR15","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201993","author":"D. Dams","year":"1993","unstructured":"D. Dams, R. Gerth, and O. Grumberg. Generation of ReducedModels for Checking Fragments of CTL. In CAV\u201993. LNCS 697, 1993. 147"},{"key":"15_CR16","series-title":"Lect Notes Comput Sci","volume-title":"TACAS\u201997","author":"P. D\u2019Argenio","year":"1997","unstructured":"P. D\u2019Argenio, J-P. Katoen, T. Ruys, and G.J. Tretmans. The Bounded Retransmission Protocol must be on Time. In TACAS\u201997. LNCS 1217, 1997. 156"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems. In Infinity\u201997, 1997. 147","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"15_CR18","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201993","author":"S. Graf","year":"1993","unstructured":"S. Graf and C. Loiseaux. A Tool for Symbolic Program Verification and Abstraction. In CAV\u201993. LNCS 697, 1993. 147"},{"key":"15_CR19","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201997","author":"S. Graf","year":"1997","unstructured":"S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In CAV\u201997, volume 1254 of LNCS, 1997. 147"},{"key":"15_CR20","series-title":"Lect Notes Comput Sci","volume-title":"AMAST\u201996","author":"J.-F. Groote","year":"1996","unstructured":"J-F. Groote and J. van de Pol. A Bounded Retransmission Protocol for Large Data Packets. In AMAST\u201996. LNCS 1101, 1996. 156"},{"key":"15_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58085-9_75","volume-title":"Types for Proofs and Programs","author":"L. Helmink","year":"1994","unstructured":"L. Helmink, M.P.A. Sellink, and F. Vaandrager. Proof checking a Data Link Protocol. In Types for Proofs and Programs. LNCS 806, 1994. 156"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"R.M. Karp and R.E. Miller. Parallel Program Schemata: A Mathematical Model for Parallel Computation. In Switch. and Automata Theory Symp. IEEE, 1967. 154","DOI":"10.1109\/FOCS.1967.27"},{"issue":"1","key":"15_CR23","first-page":"150","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property Preserving Abstractions for the Verification of Concurrent Systems. FMSD, 6(1), 1995. 147, 150, 151","journal-title":"FMSD"},{"key":"15_CR24","unstructured":"Oliver Matz, Axel Miller, Andreas Potthoff, Wolfgang Thomas, and Erich Valkema. Report on the Program AMoRE. Technical Report 9507, Inst. f. Informatik u. Prakt. Math., CAU Kiel, 1995. 149, 153"},{"key":"15_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60580-0","volume-title":"TACAS\u201995","author":"O. M\u00fcller","year":"1995","unstructured":"O. M\u00fcller and T. Nipkow. Combining Model Checking and Deduction for I\/OAutomata. In TACAS\u201995. LNCS 1019, 1995. 152"},{"issue":"2","key":"15_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/32.345827","volume":"21","author":"S. Owre","year":"1995","unstructured":"S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for faulttolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107\u2013125, Feb. 1995. 148","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48683-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T02:05:57Z","timestamp":1586138757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48683-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662020","9783540486831"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-48683-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}