The ICS Decision Procedures for Embedded Deduction

The ICS Decision Procedures for Embedded Deduction

Automated theorem proving lies at the heart of all tools for formal analysis of software and system descriptions. In formal verification systems such as PVS [10], the deductive capability is explicit and visible to the user, whereas in tools such as test case generators it is hidden and often ad-hoc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: de Moura, Leonardo, Owre, Sam, Rueß, Harald, Rushby, John, Shankar, Natarajan
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Logical, boolean and switching functions
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 222
container_issue
container_start_page 218
container_title
container_volume 3097
creator de Moura, Leonardo
Owre, Sam
Rueß, Harald
Rushby, John
Shankar, Natarajan
description Automated theorem proving lies at the heart of all tools for formal analysis of software and system descriptions. In formal verification systems such as PVS [10], the deductive capability is explicit and visible to the user, whereas in tools such as test case generators it is hidden and often ad-hoc. Many tools for formal analysis would benefit—both in performance and ease of construction—if they could draw on a powerful embedded service to perform common deductive tasks.
doi_str_mv 10.1007/978-3-540-25984-8_14
format Book Chapter
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15992803</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3087754_20_234</sourcerecordid><originalsourceid>FETCH-LOGICAL-c321t-e12c35e56c7484e4f604b0d5fd70bed1f908553db409ebd4b487ae7472e345373</originalsourceid><addsrcrecordid>eNpFkEFPGzEQhV1aEFGaf8BhLxwNY884to8o0IKERCXC2dq1Z0sgZIO9OfDvcQCJuYz05r0n-xPiRMGZArDn3jqJ0hBIbbwj6YKiH2JWZazih-YOxETNlZKI5H9-3zSSgV9iAghaekt4JCa-Wqz3Xh2LWSlPUEeB9QQToZeP3Nws7ptLjquyGjbNvzxETrvMpemH3Fy9dJwSp2pIuzhWx29x2LfrwrOvPRUPf66Wi2t5e_f3ZnFxKyNqNUpWOqJhM4-WHDH1c6AOkumThVqpeg_OGEwdgecuUUfOtmzJaq5fQItTcfrZu21LbNd9bjf1iWGbVy9tfgvKeK8dYPXpT1-pp81_zqEbhucSFIQ9zFDJBAyVTfgAF_Ywawi_yvPwuuMyBt6nIm_G3K7jY7sdOZeA4Kw1FHQNI-E7xP1vsg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3087754_20_234</pqid></control><display><type>book_chapter</type><title>The ICS Decision Procedures for Embedded Deduction</title><source>Springer Books</source><creator>de Moura, Leonardo ; Owre, Sam ; Rueß, Harald ; Rushby, John ; Shankar, Natarajan</creator><contributor>Basin, David ; Rusinowitch, Michael</contributor><creatorcontrib>de Moura, Leonardo ; Owre, Sam ; Rueß, Harald ; Rushby, John ; Shankar, Natarajan ; Basin, David ; Rusinowitch, Michael</creatorcontrib><description>Automated theorem proving lies at the heart of all tools for formal analysis of software and system descriptions. In formal verification systems such as PVS [10], the deductive capability is explicit and visible to the user, whereas in tools such as test case generators it is hidden and often ad-hoc. Many tools for formal analysis would benefit—both in performance and ease of construction—if they could draw on a powerful embedded service to perform common deductive tasks.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540223450</identifier><identifier>ISBN: 3540223452</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540259848</identifier><identifier>EISBN: 3540259848</identifier><identifier>DOI: 10.1007/978-3-540-25984-8_14</identifier><identifier>OCLC: 934979991</identifier><identifier>LCCallNum: Q334-342</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Logical, boolean and switching functions ; Theoretical computing</subject><ispartof>Automated Reasoning, 2004, Vol.3097, p.218-222</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c321t-e12c35e56c7484e4f604b0d5fd70bed1f908553db409ebd4b487ae7472e345373</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3087754-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-25984-8_14$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-25984-8_14$$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&amp;idt=15992803$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Basin, David</contributor><contributor>Rusinowitch, Michael</contributor><creatorcontrib>de Moura, Leonardo</creatorcontrib><creatorcontrib>Owre, Sam</creatorcontrib><creatorcontrib>Rueß, Harald</creatorcontrib><creatorcontrib>Rushby, John</creatorcontrib><creatorcontrib>Shankar, Natarajan</creatorcontrib><title>The ICS Decision Procedures for Embedded Deduction</title><title>Automated Reasoning</title><description>Automated theorem proving lies at the heart of all tools for formal analysis of software and system descriptions. In formal verification systems such as PVS [10], the deductive capability is explicit and visible to the user, whereas in tools such as test case generators it is hidden and often ad-hoc. Many tools for formal analysis would benefit—both in performance and ease of construction—if they could draw on a powerful embedded service to perform common deductive tasks.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Logical, boolean and switching functions</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540223450</isbn><isbn>3540223452</isbn><isbn>9783540259848</isbn><isbn>3540259848</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNpFkEFPGzEQhV1aEFGaf8BhLxwNY884to8o0IKERCXC2dq1Z0sgZIO9OfDvcQCJuYz05r0n-xPiRMGZArDn3jqJ0hBIbbwj6YKiH2JWZazih-YOxETNlZKI5H9-3zSSgV9iAghaekt4JCa-Wqz3Xh2LWSlPUEeB9QQToZeP3Nws7ptLjquyGjbNvzxETrvMpemH3Fy9dJwSp2pIuzhWx29x2LfrwrOvPRUPf66Wi2t5e_f3ZnFxKyNqNUpWOqJhM4-WHDH1c6AOkumThVqpeg_OGEwdgecuUUfOtmzJaq5fQItTcfrZu21LbNd9bjf1iWGbVy9tfgvKeK8dYPXpT1-pp81_zqEbhucSFIQ9zFDJBAyVTfgAF_Ywawi_yvPwuuMyBt6nIm_G3K7jY7sdOZeA4Kw1FHQNI-E7xP1vsg</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>de Moura, Leonardo</creator><creator>Owre, Sam</creator><creator>Rueß, Harald</creator><creator>Rushby, John</creator><creator>Shankar, Natarajan</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>The ICS Decision Procedures for Embedded Deduction</title><author>de Moura, Leonardo ; Owre, Sam ; Rueß, Harald ; Rushby, John ; Shankar, Natarajan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c321t-e12c35e56c7484e4f604b0d5fd70bed1f908553db409ebd4b487ae7472e345373</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Logical, boolean and switching functions</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>de Moura, Leonardo</creatorcontrib><creatorcontrib>Owre, Sam</creatorcontrib><creatorcontrib>Rueß, Harald</creatorcontrib><creatorcontrib>Rushby, John</creatorcontrib><creatorcontrib>Shankar, Natarajan</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>de Moura, Leonardo</au><au>Owre, Sam</au><au>Rueß, Harald</au><au>Rushby, John</au><au>Shankar, Natarajan</au><au>Basin, David</au><au>Rusinowitch, Michael</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>The ICS Decision Procedures for Embedded Deduction</atitle><btitle>Automated Reasoning</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><volume>3097</volume><spage>218</spage><epage>222</epage><pages>218-222</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540223450</isbn><isbn>3540223452</isbn><eisbn>9783540259848</eisbn><eisbn>3540259848</eisbn><abstract>Automated theorem proving lies at the heart of all tools for formal analysis of software and system descriptions. In formal verification systems such as PVS [10], the deductive capability is explicit and visible to the user, whereas in tools such as test case generators it is hidden and often ad-hoc. Many tools for formal analysis would benefit—both in performance and ease of construction—if they could draw on a powerful embedded service to perform common deductive tasks.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-25984-8_14</doi><oclcid>934979991</oclcid><tpages>5</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Automated Reasoning, 2004, Vol.3097, p.218-222
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_15992803
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Logical, boolean and switching functions
Theoretical computing
title The ICS Decision Procedures for Embedded Deduction
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T19%3A21%3A13IST&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=The%20ICS%20Decision%20Procedures%20for%20Embedded%20Deduction&rft.btitle=Automated%20Reasoning&rft.au=de%20Moura,%20Leonardo&rft.date=2004&rft.volume=3097&rft.spage=218&rft.epage=222&rft.pages=218-222&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540223450&rft.isbn_list=3540223452&rft_id=info:doi/10.1007/978-3-540-25984-8_14&rft_dat=%3Cproquest_pasca%3EEBC3087754_20_234%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540259848&rft.eisbn_list=3540259848&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3087754_20_234&rft_id=info:pmid/&rfr_iscdi=true