Summaries for While Programs with Recursion

Summaries for While Programs with Recursion

Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Podelski, Andreas, Schaefer, Ina, Wagner, Silke
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming languages
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 107
container_issue
container_start_page 94
container_title
container_volume
creator Podelski, Andreas
Schaefer, Ina
Wagner, Silke
description Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a general class of while programs with recursion. We provide a fixpoint system for computing summaries, and a proof rule for total correctness of a program given a summary. With suitable abstraction methods and algorithms for efficient summary computation, the results presented here can be used for the automatic verification of termination and liveness properties for while programs with recursion.
doi_str_mv 10.1007/978-3-540-31987-0_8
format Book Chapter
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16895686</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16895686</sourcerecordid><originalsourceid>FETCH-LOGICAL-p272t-fc78a9d1d18a0c8863ce7e7ddb3c0186c37ecafa4fd2b9576c41efdd184213043</originalsourceid><addsrcrecordid>eNotkElPAzEMhcMmUUp_AZe5cEIBe5zJckSITaoEYhHHKM0k7UDbqZJWiH9PaPHFst_zk_UxdoZwiQDqyijNiTcCOKHRioPVe-yEymI7N_tsgBKREwlzsBPqRlCjD9kACGpulKBjNsr5E0qVIwk0YBevm8XCpS7kKvap-ph181A9p36a3CJX3916Vr0Ev0m565en7Ci6eQ6j_z5k73e3bzcPfPx0_3hzPearWtVrHr3SzrTYonbgtZbkgwqqbSfkAbX0pIJ30YnY1hPTKOkFhtgWu6iRQNCQne9yVy57N4_JLX2X7Sp15dMfi1KbRpbYIcOdLxdpOQ3JTvr-K1sE-4fMFmSWbAFht4hsQUa_RjZZlA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Summaries for While Programs with Recursion</title><source>Springer Books</source><creator>Podelski, Andreas ; Schaefer, Ina ; Wagner, Silke</creator><contributor>Sagiv, Mooly</contributor><creatorcontrib>Podelski, Andreas ; Schaefer, Ina ; Wagner, Silke ; Sagiv, Mooly</creatorcontrib><description>Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a general class of while programs with recursion. We provide a fixpoint system for computing summaries, and a proof rule for total correctness of a program given a summary. With suitable abstraction methods and algorithms for efficient summary computation, the results presented here can be used for the automatic verification of termination and liveness properties for while programs with recursion.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540254358</identifier><identifier>ISBN: 9783540254355</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540319875</identifier><identifier>EISBN: 9783540319870</identifier><identifier>DOI: 10.1007/978-3-540-31987-0_8</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Programming languages ; Software</subject><ispartof>Lecture notes in computer science, 2005, p.94-107</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 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-31987-0_8$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-31987-0_8$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16895686$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Sagiv, Mooly</contributor><creatorcontrib>Podelski, Andreas</creatorcontrib><creatorcontrib>Schaefer, Ina</creatorcontrib><creatorcontrib>Wagner, Silke</creatorcontrib><title>Summaries for While Programs with Recursion</title><title>Lecture notes in computer science</title><description>Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a general class of while programs with recursion. We provide a fixpoint system for computing summaries, and a proof rule for total correctness of a program given a summary. With suitable abstraction methods and algorithms for efficient summary computation, the results presented here can be used for the automatic verification of termination and liveness properties for while programs with recursion.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Programming languages</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540254358</isbn><isbn>9783540254355</isbn><isbn>3540319875</isbn><isbn>9783540319870</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkElPAzEMhcMmUUp_AZe5cEIBe5zJckSITaoEYhHHKM0k7UDbqZJWiH9PaPHFst_zk_UxdoZwiQDqyijNiTcCOKHRioPVe-yEymI7N_tsgBKREwlzsBPqRlCjD9kACGpulKBjNsr5E0qVIwk0YBevm8XCpS7kKvap-ph181A9p36a3CJX3916Vr0Ev0m565en7Ci6eQ6j_z5k73e3bzcPfPx0_3hzPearWtVrHr3SzrTYonbgtZbkgwqqbSfkAbX0pIJ30YnY1hPTKOkFhtgWu6iRQNCQne9yVy57N4_JLX2X7Sp15dMfi1KbRpbYIcOdLxdpOQ3JTvr-K1sE-4fMFmSWbAFht4hsQUa_RjZZlA</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Podelski, Andreas</creator><creator>Schaefer, Ina</creator><creator>Wagner, Silke</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Summaries for While Programs with Recursion</title><author>Podelski, Andreas ; Schaefer, Ina ; Wagner, Silke</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p272t-fc78a9d1d18a0c8863ce7e7ddb3c0186c37ecafa4fd2b9576c41efdd184213043</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Programming languages</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Podelski, Andreas</creatorcontrib><creatorcontrib>Schaefer, Ina</creatorcontrib><creatorcontrib>Wagner, Silke</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Podelski, Andreas</au><au>Schaefer, Ina</au><au>Wagner, Silke</au><au>Sagiv, Mooly</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Summaries for While Programs with Recursion</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>94</spage><epage>107</epage><pages>94-107</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540254358</isbn><isbn>9783540254355</isbn><eisbn>3540319875</eisbn><eisbn>9783540319870</eisbn><abstract>Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a general class of while programs with recursion. We provide a fixpoint system for computing summaries, and a proof rule for total correctness of a program given a summary. With suitable abstraction methods and algorithms for efficient summary computation, the results presented here can be used for the automatic verification of termination and liveness properties for while programs with recursion.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-31987-0_8</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2005, p.94-107
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_16895686
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming languages
Software
title Summaries for While Programs with Recursion
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T03%3A38%3A57IST&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=Summaries%20for%20While%20Programs%20with%20Recursion&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Podelski,%20Andreas&rft.date=2005&rft.spage=94&rft.epage=107&rft.pages=94-107&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540254358&rft.isbn_list=9783540254355&rft_id=info:doi/10.1007/978-3-540-31987-0_8&rft_dat=%3Cpascalfrancis_sprin%3E16895686%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540319875&rft.eisbn_list=9783540319870&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true