{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:09Z","timestamp":1753894389928,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T00:00:00Z","timestamp":1661904000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We develop a framework for model checking infinite-state systems by\nautomatically augmenting them with auxiliary variables, enabling\nquantifier-free induction proofs for systems that would otherwise require\nquantified invariants. We combine this mechanism with a counterexample-guided\nabstraction refinement scheme for the theory of arrays. Our framework can thus,\nin many cases, reduce inductive reasoning with quantifiers and arrays to\nquantifier-free and array-free reasoning. We evaluate the approach on a wide\nset of benchmarks from the literature. The results show that our implementation\noften outperforms state-of-the-art tools, demonstrating its practical\npotential.<\/jats:p>","DOI":"10.46298\/lmcs-18(3:26)2022","type":"journal-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T08:29:45Z","timestamp":1662366585000},"source":"Crossref","is-referenced-by-count":2,"title":["Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays"],"prefix":"10.46298","volume":"Volume 18, Issue 3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1555-5784","authenticated-orcid":false,"given":"Makai","family":"Mann","sequence":"first","affiliation":[]},{"given":"Ahmed","family":"Irfan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3311-0893","authenticated-orcid":false,"given":"Alberto","family":"Griggio","sequence":"additional","affiliation":[]},{"given":"Oded","family":"Padon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9522-3084","authenticated-orcid":false,"given":"Clark","family":"Barrett","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2022,8,31]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/9984\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/9984\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:19Z","timestamp":1687292419000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/8436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,31]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(3:26)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2101.06825v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2101.06825v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2101.06825","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2101.06825","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,8,31]]},"article-number":"8436"}}