{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T19:46:24Z","timestamp":1779392784025,"version":"3.53.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319214009","type":"print"},{"value":"9783319214016","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21401-6_30","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T10:13:46Z","timestamp":1437732826000},"page":"434-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Exploring Theories with a Model-Finding Assistant"],"prefix":"10.1007","author":[{"given":"Salman","family":"Saghafi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryan","family":"Danas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel J.","family":"Dougherty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"30_CR1","unstructured":"Zhang, J., Zhang, H.: SEM: a system for enumerating models. In: International Joint Conference On Artificial Intelligence (1995)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"McCune, W.: MACE 2.0 Reference Manual and Guide. CoRR (2001)","DOI":"10.2172\/797949"},{"key":"30_CR3","unstructured":"Claessen, K., S\u00f6rensson, N.: New techniques that improve MACE-Style finite model finding. In: CADE Workshop on Model Computation-Principles, Algorithms, Applications (2003)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11814771_11","volume-title":"Automated Reasoning","author":"P Baumgartner","year":"2006","unstructured":"Baumgartner, P., Schmidt, R.A.: Blocking and other enhancements for bottom-up model generation methods. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 125\u2013139. Springer, Heidelberg (2006)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11814771_28","volume-title":"Automated Reasoning","author":"H de Nivelle","year":"2006","unstructured":"de Nivelle, H., Meng, J.: Geometric resolution: a proof procedure based on finite model search. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 303\u2013317. Springer, Heidelberg (2006)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-540-71209-1_49","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Torlak","year":"2007","unstructured":"Torlak, E., Jackson, D.: Kodkod: a relational model finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632\u2013647. Springer, Heidelberg (2007)"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jal.2007.07.005","volume":"7","author":"P Baumgartner","year":"2009","unstructured":"Baumgartner, P., Fuchs, A., De Nivelle, H., Tinelli, C.: Computing finite models by reduction to function-free clause logic. J. Appl. Logic 7(1), 58\u201374 (2009)","journal-title":"J. Appl. Logic"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-39799-8_42","volume-title":"Computer Aided Verification","author":"A Reynolds","year":"2013","unstructured":"Reynolds, A., Tinelli, C., Goel, A., Krsti\u0107, S.: Finite model finding in SMT. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 640\u2013655. Springer, Heidelberg (2013)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-14203-1_17","volume-title":"Automated Reasoning","author":"K Korovin","year":"2010","unstructured":"Korovin, K., Sticksel, C.: iProver-Eq: an instantiation-based theorem prover with equality. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 196\u2013202. Springer, Heidelberg (2010)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-49545-2_9","volume-title":"Logics in Artificial Intelligence","author":"F Bry","year":"1998","unstructured":"Bry, F., Torge, S.: A deduction method complete for refutation and finite satisfiability. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol. 1489, pp. 122\u2013138. Springer, Heidelberg (1998)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/11853107_2","volume-title":"Principles and Practice of Semantic Web Reasoning","author":"P Baumgartner","year":"2006","unstructured":"Baumgartner, P., Suchanek, F.M.: Automated reasoning support for first-order ontologies. In: Alferes, J.J., Bailey, J., May, W., Schwertel, U. (eds.) PPSWR 2006. LNCS, vol. 4187, pp. 18\u201332. Springer, Heidelberg (2006)"},{"key":"30_CR12","volume-title":"Software Abstractions","author":"D Jackson","year":"2012","unstructured":"Jackson, D.: Software Abstractions, 2nd edn. MIT Press, London (2012)","edition":"2"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Fisler, K., Krishnamurthi, S., Meyerovich, L.A., Tschantz, M.C.: Verification and change-impact analysis of access-control policies. In: International Conference on Software Engineering (2005)","DOI":"10.1145\/1062455.1062502"},{"key":"30_CR14","unstructured":"Nelson, T., Barratt, C., Dougherty, D.J., Fisler, K., Krishnamurthi, S.: The margrave tool for firewall analysis. In: USENIX Large Installation System Administration Conference (2010)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I.: A tableau calculus for minimal model reasoning. In: Workshop on Theorem Proving with Analytic Tableaux and Related Methods (1996)","DOI":"10.1007\/3-540-61208-4_18"},{"issue":"1","key":"30_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1006291616338","volume":"25","author":"F Bry","year":"2000","unstructured":"Bry, F., Yahya, A.: Positive unit hyperresolution tableaux and their application to minimal model generation. J. Autom. Reasoning 25(1), 35\u201382 (2000)","journal-title":"J. Autom. Reasoning"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Nelson, T., Saghafi, S., Dougherty, D.J., Fisler, K., Krishnamurthi, S.: Aluminum: principled scenario exploration through minimality. In: International Conference on Software Engineering (2013)","DOI":"10.1109\/ICSE.2013.6606569"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-71209-1_41","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"SF Doghmi","year":"2007","unstructured":"Doghmi, S.F., Guttman, J.D., Thayer, F.J.: Searching for shapes in cryptographic protocols. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 523\u2013537. Springer, Heidelberg (2007)"},{"key":"30_CR19","unstructured":"Lopes, N., Bjorner, N., Godefroid, P., Jayaraman, K., Varghese, G.: Checking beliefs in dynamic networks. Technical report, Microsoft Research (2014)"},{"key":"30_CR20","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 de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain theory in logical form. Ann. Pure Appl. Logic 51, 1\u201377 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"key":"30_CR22","unstructured":"Vickers, S.: Geometric logic as a specification language. In: Imperial College Department of Computing Workshop on Theory and Formal Methods (1995)"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.entcs.2009.02.024","volume":"230","author":"V Sofronie-Stokkermans","year":"2009","unstructured":"Sofronie-Stokkermans, V.: Sheaves and Geometric Logic and Applications to Modular Verification of Complex Systems. Electronic Notes on Theoretical Computer Science 230, 161\u2013187 (2009)","journal-title":"Electronic Notes on Theoretical Computer Science"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/11591191_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M Bezem","year":"2005","unstructured":"Bezem, M., Coquand, T.: Automating coherent logic. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 246\u2013260. Springer, Heidelberg (2005)"},{"key":"30_CR25","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/320107.320115","volume":"4","author":"D Maier","year":"1979","unstructured":"Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4, 445\u2013469 (1979)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"30_CR26","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1145\/1634.1636","volume":"31","author":"C Beeri","year":"1984","unstructured":"Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. J. ACM 31(4), 718\u2013741 (1984)","journal-title":"J. ACM"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Tannen, V.: XML queries and constraints, containment and reformulation. ACM Symposium on Theory Computer Science (2005)","DOI":"10.1016\/j.tcs.2004.10.032"},{"key":"30_CR28","unstructured":"Rossman, B.: Existential positive types and preservation under homomorphisms. In: IEEE Logic in Computer Science. IEEE (2005)"},{"key":"30_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0066201","volume-title":"First Order Categorical Logic","author":"M Makkai","year":"1977","unstructured":"Makkai, M., Reyes, G.E.: First Order Categorical Logic. Springer, Heidelberg (1977)"},{"key":"30_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36285-1_14","volume-title":"Database Theory - ICDT 2003","author":"R Fagin","year":"2002","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207\u2013224. Springer, Heidelberg (2002)"},{"key":"30_CR31","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Nash, A., Remmel, J.: The chase revisited. In: ACM Symposium on Principles of Database Systems (2008)","DOI":"10.1145\/1376916.1376938"},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Dougherty, D.J., Guttman, J.D.: Decidability for lightweight Diffie-Hellman protocols. In: IEEE Symposium on Computer Security Foundations, pp. 217\u2013231 (2014)","DOI":"10.1109\/CSF.2014.23"},{"key":"30_CR33","unstructured":"Saghafi, S., Dougherty, D.J.: Razor: provenance and exploration in model-finding. In: 4th Workshop on Practical Aspects of Automated Reasoning (PAAR) (2014)"},{"issue":"4","key":"30_CR34","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10817-009-9143-8","volume":"43","author":"G Sutcliffe","year":"2009","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure: The FOF and CNF parts, v3.5.0. J. Autom. Reasoning 43(4), 337\u2013362 (2009)","journal-title":"J. Autom. Reasoning"},{"key":"30_CR35","unstructured":"Nelson, T., Ferguson, A.D., Scheer, M., Krishnamurthi, S.: Tierless programming and reasoning for software-defined networks. NSDI, April (2014)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-25"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21401-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:08:44Z","timestamp":1675865324000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21401-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214009","9783319214016"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21401-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}