{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:34:51Z","timestamp":1742358891065,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642279393"},{"type":"electronic","value":"9783642279409"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27940-9_29","type":"book-chapter","created":{"date-parts":[[2012,1,19]],"date-time":"2012-01-19T07:29:29Z","timestamp":1326958169000},"page":"445-460","source":"Crossref","is-referenced-by-count":12,"title":["Ideal Abstractions for Well-Structured Transition Systems"],"prefix":"10.1007","author":[{"given":"Damien","family":"Zufferey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313\u2013321 (1996)","DOI":"10.1109\/LICS.1996.561359"},{"issue":"1","key":"29_CR2","first-page":"39","volume":"25","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. FMSD\u00a025(1), 39\u201365 (2004)","journal-title":"FMSD"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: LICS, pp. 160\u2013170 (1993)","DOI":"10.1109\/LICS.1993.287591"},{"key":"29_CR4","unstructured":"Azzopardi, T.: Generic compute server in Scala using remote actors (2008), http:\/\/tiny.cc\/yjzva (accessed November 2011)"},{"issue":"4\/5","key":"29_CR5","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10009-005-0215-8","volume":"8","author":"R. Bagnara","year":"2006","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. Software Tools for Technology Transfer\u00a08(4\/5), 449\u2013466 (2006)","journal-title":"Software Tools for Technology Transfer"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P.W., Yang, H.: Compositional shape analysis by means of bi-abduction. In: POPL, pp. 289\u2013300 (2009)","DOI":"10.1145\/1594834.1480917"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL, pp. 269\u2013282. ACM (1979)","DOI":"10.1145\/567752.567778"},{"issue":"4","key":"29_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation\u00a02(4), 511\u2013547 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(97)00179-5","volume":"211","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Gelsema, T.: Multisets and structural congruence of the pi-calculus with replication. Theor. Comput. Sci.\u00a0211(1-2), 311\u2013337 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part I: Completions. In: STACS. Dagstuhl Sem. Proc., vol.\u00a009001, pp. 433\u2013444 (2009)","DOI":"10.1007\/978-3-642-02930-1_16"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-02930-1_16","volume-title":"Automata, Languages and Programming","author":"A. Finkel","year":"2009","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part\u00a0II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 188\u2013199. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11609773_4","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Ganty","year":"2005","unstructured":"Ganty, P., Raskin, J.-F., Van Begin, L.: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 49\u201364. Springer, Heidelberg (2005)"},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jcss.2005.09.001","volume":"72","author":"G. Geeraerts","year":"2006","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci.\u00a072(1), 180\u2013203 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Goubault-Larrecq, J.: On noetherian spaces. In: LICS, pp. 453\u2013462. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.34"},{"issue":"2-3","key":"29_CR18","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2008.09.019","volume":"410","author":"P. Haller","year":"2009","unstructured":"Haller, P., Odersky, M.: Scala actors: Unifying thread-based and event-based programming. Theor. Comput. Sci.\u00a0410(2-3), 202\u2013220 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70545-1_21","volume-title":"Computer Aided Verification","author":"S. Joshi","year":"2008","unstructured":"Joshi, S., K\u00f6nig, B.: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 214\u2013226. Springer, Heidelberg (2008)"},{"issue":"2","key":"29_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR21","unstructured":"Lift. Lift web framework, http:\/\/liftweb.net\/"},{"key":"29_CR22","series-title":"IFIP","first-page":"477","volume-title":"IFIP TCS","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the pi-calculus. In: IFIP TCS. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Boston (2008)"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Milner, E.C.: Basic wqo- and bqo-theory. Graphs and order (1985)","DOI":"10.1007\/978-94-009-5315-4_14"},{"key":"29_CR24","series-title":"Computer and Systems Sciences","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic pi-calculus: A tutorial. In: Logic and Algebra of Specification. Computer and Systems Sciences. Springer, Heidelberg (1993)"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Petri, C.A., Reisig, W.: Scholarpedia\u00a03(4), 6477 (2008), http:\/\/www.scholarpedia.org\/article\/Petri_net","DOI":"10.4249\/scholarpedia.6477"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst.\u00a029(5) (2007)","DOI":"10.1145\/1275497.1275501"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P. Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 616\u2013628. Springer, Heidelberg (2010)"},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-12032-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"T. Wies","year":"2010","unstructured":"Wies, T., Zufferey, D., Henzinger, T.A.: Forward Analysis of Depth-Bounded Processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 94\u2013108. Springer, Heidelberg (2010)"},{"key":"29_CR29","unstructured":"Zufferey, D., Wies, T.: Picasso Analyzer, http:\/\/ist.ac.at\/~zufferey\/picasso\/"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Zufferey, D., Wies, T., Henzinger, T.A.: On ideal abstractions for well-structured transition systems. Technical Report IST-2011-10, IST Austria (November 2011)","DOI":"10.1007\/978-3-642-27940-9_29"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27940-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T23:24:48Z","timestamp":1742340288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27940-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642279393","9783642279409"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27940-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}