Interpolation and SAT-Based Model Checking

We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	McMillan, K. L.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Boolean Formula Bound Model Check Computer science control theory systems Conjunctive Normal Form Exact sciences and technology Logical, boolean and switching functions Model Check Symbolic Model Check Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	13
container_issue
container_start_page	1
container_title
container_volume
creator	McMillan, K. L.
description	We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
doi_str_mv	10.1007/978-3-540-45069-6_1
format	Book Chapter
fullrecord	<record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_15618367</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>15618367</sourcerecordid><originalsourceid>FETCH-LOGICAL-p272t-61e7fad8966b2836c6fdbcc2682a0eeebe57f8fbc3484fb7009b2047e34ed0253</originalsourceid><addsrcrecordid>eNotkEtPwzAQhM1LopT-Ai65cEEyrL1-JMdS8ahUxIFytmzHLqEhieJe-PeYtnNZzc5oDh8hNwzuGYB-qHRJkUoBVEhQFVWGnZArzI-9V6dkwhRjFFFUZ8cAJBdwTiaAwGmlBV6SWUrfkIWcg5YTcrfsdmEc-tbumr4rbFcXH_M1fbQp1MVbX4e2WHwFv226zTW5iLZNYXa8U_L5_LRevNLV-8tyMV_RgWu-o4oFHW1dVko5XqLyKtbOe65KbiGE4ILUsYzOoyhFdBqgchyEDihCDVzilNwedgebvG3jaDvfJDOMzY8dfw2TiuVZnXvs0Es56jZhNK7vt8kwMP_ETCZm0GQOZk_IZGL4B_YyWAg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Interpolation and SAT-Based Model Checking</title><source>Springer Books</source><creator>McMillan, K. L.</creator><contributor>Hunt, Warren A. ; Somenzi, Fabio</contributor><creatorcontrib>McMillan, K. L. ; Hunt, Warren A. ; Somenzi, Fabio</creatorcontrib><description>We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540405240</identifier><identifier>ISBN: 9783540405245</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540450696</identifier><identifier>EISBN: 9783540450696</identifier><identifier>DOI: 10.1007/978-3-540-45069-6_1</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Boolean Formula ; Bound Model Check ; Computer science; control theory; systems ; Conjunctive Normal Form ; Exact sciences and technology ; Logical, boolean and switching functions ; Model Check ; Symbolic Model Check ; Theoretical computing</subject><ispartof>Computer Aided Verification, 2003, p.1-13</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-45069-6_1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-45069-6_1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15618367$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Hunt, Warren A.</contributor><contributor>Somenzi, Fabio</contributor><creatorcontrib>McMillan, K. L.</creatorcontrib><title>Interpolation and SAT-Based Model Checking</title><title>Computer Aided Verification</title><description>We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.</description><subject>Applied sciences</subject><subject>Boolean Formula</subject><subject>Bound Model Check</subject><subject>Computer science; control theory; systems</subject><subject>Conjunctive Normal Form</subject><subject>Exact sciences and technology</subject><subject>Logical, boolean and switching functions</subject><subject>Model Check</subject><subject>Symbolic Model Check</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540405240</isbn><isbn>9783540405245</isbn><isbn>3540450696</isbn><isbn>9783540450696</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2003</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkEtPwzAQhM1LopT-Ai65cEEyrL1-JMdS8ahUxIFytmzHLqEhieJe-PeYtnNZzc5oDh8hNwzuGYB-qHRJkUoBVEhQFVWGnZArzI-9V6dkwhRjFFFUZ8cAJBdwTiaAwGmlBV6SWUrfkIWcg5YTcrfsdmEc-tbumr4rbFcXH_M1fbQp1MVbX4e2WHwFv226zTW5iLZNYXa8U_L5_LRevNLV-8tyMV_RgWu-o4oFHW1dVko5XqLyKtbOe65KbiGE4ILUsYzOoyhFdBqgchyEDihCDVzilNwedgebvG3jaDvfJDOMzY8dfw2TiuVZnXvs0Es56jZhNK7vt8kwMP_ETCZm0GQOZk_IZGL4B_YyWAg</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>McMillan, K. L.</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>Interpolation and SAT-Based Model Checking</title><author>McMillan, K. L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p272t-61e7fad8966b2836c6fdbcc2682a0eeebe57f8fbc3484fb7009b2047e34ed0253</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Boolean Formula</topic><topic>Bound Model Check</topic><topic>Computer science; control theory; systems</topic><topic>Conjunctive Normal Form</topic><topic>Exact sciences and technology</topic><topic>Logical, boolean and switching functions</topic><topic>Model Check</topic><topic>Symbolic Model Check</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>McMillan, K. L.</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>McMillan, K. L.</au><au>Hunt, Warren A.</au><au>Somenzi, Fabio</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Interpolation and SAT-Based Model Checking</atitle><btitle>Computer Aided Verification</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2003</date><risdate>2003</risdate><spage>1</spage><epage>13</epage><pages>1-13</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540405240</isbn><isbn>9783540405245</isbn><eisbn>3540450696</eisbn><eisbn>9783540450696</eisbn><abstract>We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-45069-6_1</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Computer Aided Verification, 2003, p.1-13
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_15618367
source	Springer Books
subjects	Applied sciences Boolean Formula Bound Model Check Computer science control theory systems Conjunctive Normal Form Exact sciences and technology Logical, boolean and switching functions Model Check Symbolic Model Check Theoretical computing
title	Interpolation and SAT-Based Model Checking
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T13%3A28%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Interpolation%20and%20SAT-Based%20Model%20Checking&rft.btitle=Computer%20Aided%20Verification&rft.au=McMillan,%20K.%20L.&rft.date=2003&rft.spage=1&rft.epage=13&rft.pages=1-13&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540405240&rft.isbn_list=9783540405245&rft_id=info:doi/10.1007/978-3-540-45069-6_1&rft_dat=%3Cpascalfrancis_sprin%3E15618367%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540450696&rft.eisbn_list=9783540450696&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true