{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:24:19Z","timestamp":1725791059336},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548611"},{"type":"electronic","value":"9783642548628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54862-8_35","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:33:34Z","timestamp":1395408814000},"page":"418-420","source":"Crossref","is-referenced-by-count":1,"title":["Ultimate Automizer with Unsatisfiable Cores"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Heizmann","sequence":"first","affiliation":[]},{"given":"J\u00fcrgen","family":"Christ","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Dietsch","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Hoenicke","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Lindenmann","sequence":"additional","affiliation":[]},{"given":"Betim","family":"Musa","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schilling","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Wissert","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Dietsch, D.: STALIN: A plugin-based modular framework for program analysis. Bachelor Thesis, Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany (2008)"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-642-36742-7_53","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Heizmann","year":"2013","unstructured":"Heizmann, M., et al.: Ultimate automizer with SMTInterpol. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 641\u2013643. Springer, Heidelberg (2013)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-319-02444-8_26","volume-title":"Automated Technology for Verification and Analysis","author":"M. Heizmann","year":"2013","unstructured":"Heizmann, M., Hoenicke, J., Leike, J., Podelski, A.: Linear ranking for linear lasso programs. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol.\u00a08172, pp. 365\u2013380. Springer, Heidelberg (2013)"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-39799-8_2","volume-title":"Computer Aided Verification","author":"M. Heizmann","year":"2013","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 36\u201352. Springer, Heidelberg (2013)"},{"key":"35_CR5","unstructured":"Leike, J.: Ranking function synthesis for linear lasso programs. Master\u2019s thesis, University of Freiburg, Germany (2013)"},{"key":"35_CR6","unstructured":"Leino, K.R.M.: This is Boogie 2. Manuscript working draft, Microsoft Research, Redmond, WA, USA (June 2008), \n \n http:\/\/research.microsoft.com\/en-us\/um\/people\/leino\/papers\/krml178.pdf"},{"key":"35_CR7","unstructured":"Lindenmann, M.: A simple but sufficient memory model for ultimate. Master\u2019s thesis, University of Freiburg, Germany (2012)"},{"key":"35_CR8","unstructured":"Musa, B.: Trace abstraction with unsatisfiable cores. Bachelor\u2019s thesis, University of Freiburg, Germany (2013)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Reps, T.W., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995, pp. 49\u201361. ACM (1995)","DOI":"10.1145\/199448.199462"},{"key":"35_CR10","unstructured":"Schilling, C.: Minimization of nested word automata. Master\u2019s thesis, University of Freiburg, Germany (2013)"},{"key":"35_CR11","unstructured":"Wissert, S.: Adaptive block encoding for recursive control flow graphs. Master\u2019s thesis, University of Freiburg, Germany (2013)"}],"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\/978-3-642-54862-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T11:58:15Z","timestamp":1558871895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54862-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548611","9783642548628"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54862-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}