Combinations of Model Checking and Theorem Proving
The two main approaches to the formal verification of reactive systems are based, respectively, on model checking (algorithmic verification) and theorem proving (deductive verification). These two approaches have complementary strengths and weaknesses, and their combination promises to enhance the c...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 170 |
|---|---|
| container_issue | |
| container_start_page | 151 |
| container_title | |
| container_volume | 1794 |
| creator | Uribe, Tomás E. |
| description | The two main approaches to the formal verification of reactive systems are based, respectively, on model checking (algorithmic verification) and theorem proving (deductive verification). These two approaches have complementary strengths and weaknesses, and their combination promises to enhance the capabilities of each. This paper surveys a number of methods for doing so. As is often the case, the combinations can be classified according to how tightly the different components are integrated, their range of application, and their degree of automation. |
| doi_str_mv | 10.1007/10720084_11 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1375722</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3087948_16_160</sourcerecordid><originalsourceid>FETCH-LOGICAL-p262t-65948fcd8c25f41df36f1bca5e515cdbe92bcf6d74dbd6029bdc1c16b96bf18b3</originalsourceid><addsrcrecordid>eNpNkEtLxDAUheMTyzgr_0AXblxUc5M0aZdSfMGILsZ1yHOmTqepSRX891ZmEC8XLtzzcTgchC4AXwPG4gawIBhXTAIcoHktKloyzDgjAIcoAw5QUMrqoz-NC1IBO0YZppgUtWD0FGX1hFQYWHmG5im942kooZTwDJEmbHXbq7ENfcqDz5-DdV3erJ3ZtP0qV73Nl2sXotvmrzF8Tb9zdOJVl9x8f2fo7f5u2TwWi5eHp-Z2UQyEk7HgZc0qb2xlSOkZWE-5B21U6UoojdWuJtp4bgWz2nJMam0NGOC65tpDpekMXe58B5WM6nxUvWmTHGK7VfFbAhWlIGTCrnZYmpR-5aLUIWySBCx_K5T_KpxYureM4ePTpVG6X9i4foyqM2s1jC4mSXElpvAS-LSY_gD8tGzi</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3087948_16_160</pqid></control><display><type>book_chapter</type><title>Combinations of Model Checking and Theorem Proving</title><source>Springer Books</source><creator>Uribe, Tomás E.</creator><contributor>Kirchner, Helene ; Ringeissen, Christophe ; Kirchner, Hélène ; Ringeissen, Christophe</contributor><creatorcontrib>Uribe, Tomás E. ; Kirchner, Helene ; Ringeissen, Christophe ; Kirchner, Hélène ; Ringeissen, Christophe</creatorcontrib><description>The two main approaches to the formal verification of reactive systems are based, respectively, on model checking (algorithmic verification) and theorem proving (deductive verification). These two approaches have complementary strengths and weaknesses, and their combination promises to enhance the capabilities of each. This paper surveys a number of methods for doing so. As is often the case, the combinations can be classified according to how tightly the different components are integrated, their range of application, and their degree of automation.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540672814</identifier><identifier>ISBN: 3540672818</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540464211</identifier><identifier>EISBN: 3540464212</identifier><identifier>DOI: 10.1007/10720084_11</identifier><identifier>OCLC: 934980145</identifier><identifier>LCCallNum: QA8.9-10.3</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Abstract Interpretation ; Applied sciences ; Computer science; control theory; systems ; Decision Procedure ; Exact sciences and technology ; Invariant Generation ; Language processing and microprogramming ; Model Check ; Software ; Theorem Prove</subject><ispartof>Frontiers of Combining Systems, 2000, Vol.1794, p.151-170</ispartof><rights>Springer-Verlag Berlin Heidelberg 2000</rights><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3087948-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/10720084_11$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/10720084_11$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27930,38260,41447,42516</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1375722$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Kirchner, Helene</contributor><contributor>Ringeissen, Christophe</contributor><contributor>Kirchner, Hélène</contributor><contributor>Ringeissen, Christophe</contributor><creatorcontrib>Uribe, Tomás E.</creatorcontrib><title>Combinations of Model Checking and Theorem Proving</title><title>Frontiers of Combining Systems</title><description>The two main approaches to the formal verification of reactive systems are based, respectively, on model checking (algorithmic verification) and theorem proving (deductive verification). These two approaches have complementary strengths and weaknesses, and their combination promises to enhance the capabilities of each. This paper surveys a number of methods for doing so. As is often the case, the combinations can be classified according to how tightly the different components are integrated, their range of application, and their degree of automation.</description><subject>Abstract Interpretation</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Decision Procedure</subject><subject>Exact sciences and technology</subject><subject>Invariant Generation</subject><subject>Language processing and microprogramming</subject><subject>Model Check</subject><subject>Software</subject><subject>Theorem Prove</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540672814</isbn><isbn>3540672818</isbn><isbn>9783540464211</isbn><isbn>3540464212</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2000</creationdate><recordtype>book_chapter</recordtype><recordid>eNpNkEtLxDAUheMTyzgr_0AXblxUc5M0aZdSfMGILsZ1yHOmTqepSRX891ZmEC8XLtzzcTgchC4AXwPG4gawIBhXTAIcoHktKloyzDgjAIcoAw5QUMrqoz-NC1IBO0YZppgUtWD0FGX1hFQYWHmG5im942kooZTwDJEmbHXbq7ENfcqDz5-DdV3erJ3ZtP0qV73Nl2sXotvmrzF8Tb9zdOJVl9x8f2fo7f5u2TwWi5eHp-Z2UQyEk7HgZc0qb2xlSOkZWE-5B21U6UoojdWuJtp4bgWz2nJMam0NGOC65tpDpekMXe58B5WM6nxUvWmTHGK7VfFbAhWlIGTCrnZYmpR-5aLUIWySBCx_K5T_KpxYureM4ePTpVG6X9i4foyqM2s1jC4mSXElpvAS-LSY_gD8tGzi</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Uribe, Tomás E.</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>Combinations of Model Checking and Theorem Proving</title><author>Uribe, Tomás E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p262t-65948fcd8c25f41df36f1bca5e515cdbe92bcf6d74dbd6029bdc1c16b96bf18b3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Abstract Interpretation</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Decision Procedure</topic><topic>Exact sciences and technology</topic><topic>Invariant Generation</topic><topic>Language processing and microprogramming</topic><topic>Model Check</topic><topic>Software</topic><topic>Theorem Prove</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Uribe, Tomás E.</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Uribe, Tomás E.</au><au>Kirchner, Helene</au><au>Ringeissen, Christophe</au><au>Kirchner, Hélène</au><au>Ringeissen, Christophe</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Combinations of Model Checking and Theorem Proving</atitle><btitle>Frontiers of Combining Systems</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2000</date><risdate>2000</risdate><volume>1794</volume><spage>151</spage><epage>170</epage><pages>151-170</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540672814</isbn><isbn>3540672818</isbn><eisbn>9783540464211</eisbn><eisbn>3540464212</eisbn><abstract>The two main approaches to the formal verification of reactive systems are based, respectively, on model checking (algorithmic verification) and theorem proving (deductive verification). These two approaches have complementary strengths and weaknesses, and their combination promises to enhance the capabilities of each. This paper surveys a number of methods for doing so. As is often the case, the combinations can be classified according to how tightly the different components are integrated, their range of application, and their degree of automation.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/10720084_11</doi><oclcid>934980145</oclcid><tpages>20</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Frontiers of Combining Systems, 2000, Vol.1794, p.151-170 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1375722 |
| source | Springer Books |
| subjects | Abstract Interpretation Applied sciences Computer science control theory systems Decision Procedure Exact sciences and technology Invariant Generation Language processing and microprogramming Model Check Software Theorem Prove |
| title | Combinations of Model Checking and Theorem Proving |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-14T12%3A07%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Combinations%20of%20Model%20Checking%20and%20Theorem%20Proving&rft.btitle=Frontiers%20of%20Combining%20Systems&rft.au=Uribe,%20Tom%C3%A1s%20E.&rft.date=2000&rft.volume=1794&rft.spage=151&rft.epage=170&rft.pages=151-170&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540672814&rft.isbn_list=3540672818&rft_id=info:doi/10.1007/10720084_11&rft_dat=%3Cproquest_pasca%3EEBC3087948_16_160%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540464211&rft.eisbn_list=3540464212&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3087948_16_160&rft_id=info:pmid/&rfr_iscdi=true |