{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:04:00Z","timestamp":1725501840731},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779643"},{"type":"electronic","value":"9783540779667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77966-7_12","type":"book-chapter","created":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T08:59:24Z","timestamp":1201856364000},"page":"120-135","source":"Crossref","is-referenced-by-count":1,"title":["Test Case Generation for Ultimately Periodic Paths"],"prefix":"10.1007","author":[{"given":"Saddek","family":"Bensalem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyang","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stavros","family":"Tripakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lenore","family":"Zuck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A., Artho, C., Schuppan, V.: Liveness Checking as Safety Checking. FMICS 2002, Malaga, Spain, ENTCS 66(2) (2002)","DOI":"10.1016\/S1571-0661(04)80410-9"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-540-73420-8_16","volume-title":"Automata, Languages and Programming","author":"D. Bosnacki","year":"2007","unstructured":"Bosnacki, D., et al.: On Commutativity Based Edge Lean Search. In: Arge, L., et al. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 158\u2013170. Springer, Heidelberg (2007)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic. In: Kozen, D. (ed.) Logics of Programs. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"12_CR4","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: PLDI 2006, Ottawa, Ontario, Canada, pp. 415\u2013426 (2006)","DOI":"10.1145\/1133981.1134029"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Floyd, R.: Assigning meanings to programs. In: Proceedings of Symposia in Applied Mathematics, vol.\u00a019, pp. 19\u201332 (1967)","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simpler on-the-fly automatic Cverification of linear temporal logic. In: PSTV 1995, Warsaw, Poland, pp. 3\u201318 (1995)","DOI":"10.1007\/978-0-387-34892-6_1"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","first-page":"176","volume-title":"Computer Aided Verification","author":"P. Godefroid","year":"1992","unstructured":"Godefroid, P., Wolper, P.: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 176\u2013185. Springer, Heidelberg (1992)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","first-page":"548","volume-title":"Verification: Theory and Practice","author":"E.L. Gunter","year":"2004","unstructured":"Gunter, E.L., Peled, D.: Unit Checking: Symbolic Model Checking for a Unit of Code. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 548\u2013567. Springer, Heidelberg (2004)"},{"issue":"10","key":"12_CR10","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An Axiomatic Basis for Computer Programming. Communication ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Communication ACM"},{"key":"12_CR11","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1990","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs (1990)"},{"key":"12_CR12","volume-title":"Hilbert\u2019s 10th Problem","author":"Y.V. Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.V.: Hilbert\u2019s 10th Problem. MIT Press, Cambridge (1993)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0013025","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"A.W. Mazurkiewicz","year":"1989","unstructured":"Mazurkiewicz, A.W.: Basic Notions of Trace Theory. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 285\u2013363. Springer, Heidelberg (1989)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The Temporal Logic of Programs. In: FOCS 1977, Rhode Island, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A Complete Method for the Synthesis of Linear Ranking Functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, Springer, Heidelberg (2004)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Podelski, A., Rybalchenko, A.: Transition Invariants. LICS 2004, 32\u201341, Turku, Finland (2004)","DOI":"10.1109\/LICS.2004.1319598"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Queille, J.-P., Sifakis, J.: Iterative Methods for the Analysis of Petri Nets. In: Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets Bad Honnef, Informatik-Fachberichte 52, pp. 161\u2013167 (1981)","DOI":"10.1007\/978-3-642-68353-4_27"},{"key":"12_CR18","unstructured":"Wolfram, S.: The Mathematica Book, 5 th edn, Wolfram Media (2003)"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software: Verification and Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77966-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:57:23Z","timestamp":1619521043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77966-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540779643","9783540779667"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77966-7_12","relation":{},"subject":[]}}