{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:29:43Z","timestamp":1725748183631},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405365"},{"type":"electronic","value":"9783642405372"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40537-2_5","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T08:33:51Z","timestamp":1378888431000},"page":"28-43","source":"Crossref","is-referenced-by-count":1,"title":["Tableaux for Verification of Data-Centric Processes"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Peter","family":"Baumgartner","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Diller","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Norrish","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Baader, F., Liu, H., ul Mehdi, A.: Verifying properties of infinite sequences of description logic actions. In: ECAI, pp. 53\u201358 (2010)"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1093\/logcom\/exn075","volume":"20","author":"A. Bauer","year":"2010","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Comparing LTL semantics for runtime verification. Logic and Computation\u00a020(3), 651\u2013674 (2010)","journal-title":"Logic and Computation"},{"key":"5_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-38574-2_3","volume-title":"Automated Deduction \u2013 CADE-24","author":"P. Baumgartner","year":"2013","unstructured":"Baumgartner, P., Waldmann, U.: Hierarchic superposition with weak abstraction. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol.\u00a07898, pp. 39\u201357. Springer, Heidelberg (2013)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bersani, M.M., Cavallaro, L., Frigeri, A., Pradella, M., Rossi, M.: SMT-based verification of LTL specification with integer constraints and its application to runtime checking of service substitutability. In: Fiadeiro, J.L., Gnesi, S., Maggiolo-Schettini, A. (eds.) SEFM, pp. 244\u2013254. IEEE Computer Society (2010)","DOI":"10.1109\/SEFM.2010.37"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-010-9210-1","volume":"49","author":"L. Chang","year":"2012","unstructured":"Chang, L., Shi, Z., Gu, T., Zhao, L.: A family of dynamic description logics for representing and reasoning about actions. J. Autom. Reasoning\u00a049(1), 1\u201352 (2012)","journal-title":"J. Autom. Reasoning"},{"key":"5_CR6","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Crockford, D.: RFC 4627\u2014The application\/json media type for JavaScript Object Notation (JSON). Technical report, IETF (2006)","DOI":"10.17487\/rfc4627"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-23059-2_3","volume-title":"Business Process Management","author":"E. Damaggio","year":"2011","unstructured":"Damaggio, E., Deutsch, A., Hull, R., Vianu, V.: Automatic verification of data-centric business processes. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol.\u00a06896, pp. 3\u201316. Springer, Heidelberg (2011)"},{"key":"5_CR9","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-73595-3_25","volume-title":"Automated Deduction \u2013 CADE-21","author":"S. Ghilardi","year":"2007","unstructured":"Ghilardi, S., Nicolini, E., Ranise, S., Zucchelli, D.: Combination methods for satisfiability and model-checking of infinite-state systems. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 362\u2013378. Springer, Heidelberg (2007)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gor\u00e9, R.: Tableau methods for modal and temporal logics. In: D\u2019Agostino, M., Gabbay, D., H\u00e4hnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, ch. 6, pp. 297\u2013396. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-94-017-1754-0_6"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/2274706","volume":"56","author":"J. Halpern","year":"1991","unstructured":"Halpern, J.: Presburger Arithmetic With Unary Predicates is $\\Pi_1^1$ -Complete. Journal of Symbolic Logic\u00a056(2), 637\u2013642 (1991)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR12","unstructured":"Hariri, B.B., Calvanese, D., Giacomo, G.D., Masellis, R.D., Felli, P., Montali, M.: Verification of description logic knowledge and action bases. In: Raedt, L.D., Bessi\u00e8re, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., Lucas, P.J.F. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol.\u00a0242, pp. 103\u2013108. IOS Press (2012)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kahsai, T., Tinelli, C.: Pkind: A parallel k-induction based model checker. In: Barnat, J., Heljanko, K. (eds.) PDMC. EPTCS, vol.\u00a072, pp. 55\u201362 (2011)","DOI":"10.4204\/EPTCS.72.6"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-45069-6_2","volume-title":"Computer Aided Verification","author":"L. Moura de","year":"2003","unstructured":"de Moura, L., Rue\u00df, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 14\u201326. Springer, Heidelberg (2003)"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1147\/sj.423.0428","volume":"42","author":"A. Nigam","year":"2003","unstructured":"Nigam, A., Caswell, N.S.: Business artifacts: An approach to operational specification. IBM Systems Journal\u00a042(3), 428\u2013445 (2003)","journal-title":"IBM Systems Journal"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Pesic, M., van der Aalst, W.M.P.: A declarative approach for flexible business processes management. In: Eder, J., Dustdar, S. (eds.) BPM 2006 Workshops. LNCS, vol.\u00a04103, pp. 169\u2013180. Springer, Heidelberg (2006)","DOI":"10.1007\/11837862_18"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-05089-3_26","volume-title":"FM 2009: Formal Methods","author":"M. Reynolds","year":"2009","unstructured":"Reynolds, M.: A tableau for CTL*. In: Cavalcanti, A., Dams, D. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 403\u2013418. Springer, Heidelberg (2009)"},{"key":"5_CR19","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1987","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. The MIT Press, Cambridge (1987)"},{"key":"5_CR20","first-page":"67","volume-title":"SEFM","author":"T. Schuele","year":"2004","unstructured":"Schuele, T., Schneider, K.: Global vs. local model checking: A comparison of verification techniques for infinite state systems. In: SEFM, pp. 67\u201376. IEEE Computer Society, Washington, Dc (2004)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Sutcliffe, G., Schulz, S., Claessen, K., Baumgartner, P.: The TPTP typed first-order form with arithmetic. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18. LNCS, vol.\u00a07180, pp. 406\u2013419. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-28717-6_32"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a SAT-solver. In: Hunt Jr., W.A., Johnson, S.D. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 108\u2013125. Springer, Heidelberg (2000)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Vianu, V.: Automatic verification of database-driven systems: a new frontier. In: Fagin, R. (ed.) ICDT. ACM International Conference Proceeding Series, vol.\u00a0361, pp. 1\u201313. ACM (2009)","DOI":"10.1145\/1514894.1514896"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40537-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T18:48:50Z","timestamp":1563907730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40537-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405365","9783642405372"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40537-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}