A mechanized proof environment for the convenient computations proof method

A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the "convenient computations" method. This method reduces the conceptual difficulty of proving a given property for all the possible com...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Formal methods in system design 2003-09, Vol.23 (2), p.115-142
1. Verfasser: Katz, M G
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 142
container_issue 2
container_start_page 115
container_title Formal methods in system design
container_volume 23
creator Katz, M G
description A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the "convenient computations" method. This method reduces the conceptual difficulty of proving a given property for all the possible computations of a system by separating two different concerns: (1) proving that special convenient computations satisfy the property, and (2) proving that every computation is related to a convenient one by a relation which preserves the property. The approach is especially appropriate for applications in which the first concern is trivial once the second has been shown, e.g., where the specification itself is that every computation reduces to a convenient one. Two examples are the serializability of transactions in distributed databases, and sequential consistency of distributed shared memories. To reduce the repetition of effort, a clear separation is made between "infrastructural" theories to be supplied as a proof environment PVS library to users, and the specification and proof of particular examples. The provided infrastructure formally defines the method in its most general way. It also defines a computation model and a reduction relation-the equivalence of computations that differ only in the order of finitely many independent operations. One way to prove that this relation holds between every computation and some convenient one involves the definition of a measure function from computations into a well-founded set. Two possible default measures, which can be applied in many cases, are also defined in the infrastructure, along with useful lemmas that assist in their usage. We show how the proof environment can be used, by a step-by-step explanation of an application example.
doi_str_mv 10.1023/A:1024746015231
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_27842441</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>27842441</sourcerecordid><originalsourceid>FETCH-LOGICAL-p184t-56ced8e98705c5ae79c3358ed933994882f5eb6d6eb25af62549e7d776f12ddf3</originalsourceid><addsrcrecordid>eNotjTtPwzAYRT2ARCnMrJ7YAn4_2KKKl6jEAnPl2p-VoMQOsdOBX08RnY50pXMPQjeU3FHC-H37cITQQhEqGadnaEUsk401Ul2gy1K-CCGGKr5Cby0ewXcu9T8Q8DTnHDGkQz_nNEKqOOYZ1w6wz-kAqf-bfB6npbra51ROxgi1y-EKnUc3FLg-cY0-nx4_Ni_N9v35ddNum4kaURupPAQD1mgivXSgredcGgiWc2uFMSxK2KugYM-ki4pJYUEHrVWkLITI1-j2__cY_16g1N3YFw_D4BLkpeyYNoIJQfkvDclP1Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27842441</pqid></control><display><type>article</type><title>A mechanized proof environment for the convenient computations proof method</title><source>Springer Nature - Complete Springer Journals</source><creator>Katz, M G</creator><creatorcontrib>Katz, M G</creatorcontrib><description>A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the "convenient computations" method. This method reduces the conceptual difficulty of proving a given property for all the possible computations of a system by separating two different concerns: (1) proving that special convenient computations satisfy the property, and (2) proving that every computation is related to a convenient one by a relation which preserves the property. The approach is especially appropriate for applications in which the first concern is trivial once the second has been shown, e.g., where the specification itself is that every computation reduces to a convenient one. Two examples are the serializability of transactions in distributed databases, and sequential consistency of distributed shared memories. To reduce the repetition of effort, a clear separation is made between "infrastructural" theories to be supplied as a proof environment PVS library to users, and the specification and proof of particular examples. The provided infrastructure formally defines the method in its most general way. It also defines a computation model and a reduction relation-the equivalence of computations that differ only in the order of finitely many independent operations. One way to prove that this relation holds between every computation and some convenient one involves the definition of a measure function from computations into a well-founded set. Two possible default measures, which can be applied in many cases, are also defined in the infrastructure, along with useful lemmas that assist in their usage. We show how the proof environment can be used, by a step-by-step explanation of an application example.</description><identifier>ISSN: 0925-9856</identifier><identifier>DOI: 10.1023/A:1024746015231</identifier><language>eng</language><ispartof>Formal methods in system design, 2003-09, Vol.23 (2), p.115-142</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Katz, M G</creatorcontrib><title>A mechanized proof environment for the convenient computations proof method</title><title>Formal methods in system design</title><description>A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the "convenient computations" method. This method reduces the conceptual difficulty of proving a given property for all the possible computations of a system by separating two different concerns: (1) proving that special convenient computations satisfy the property, and (2) proving that every computation is related to a convenient one by a relation which preserves the property. The approach is especially appropriate for applications in which the first concern is trivial once the second has been shown, e.g., where the specification itself is that every computation reduces to a convenient one. Two examples are the serializability of transactions in distributed databases, and sequential consistency of distributed shared memories. To reduce the repetition of effort, a clear separation is made between "infrastructural" theories to be supplied as a proof environment PVS library to users, and the specification and proof of particular examples. The provided infrastructure formally defines the method in its most general way. It also defines a computation model and a reduction relation-the equivalence of computations that differ only in the order of finitely many independent operations. One way to prove that this relation holds between every computation and some convenient one involves the definition of a measure function from computations into a well-founded set. Two possible default measures, which can be applied in many cases, are also defined in the infrastructure, along with useful lemmas that assist in their usage. We show how the proof environment can be used, by a step-by-step explanation of an application example.</description><issn>0925-9856</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNotjTtPwzAYRT2ARCnMrJ7YAn4_2KKKl6jEAnPl2p-VoMQOsdOBX08RnY50pXMPQjeU3FHC-H37cITQQhEqGadnaEUsk401Ul2gy1K-CCGGKr5Cby0ewXcu9T8Q8DTnHDGkQz_nNEKqOOYZ1w6wz-kAqf-bfB6npbra51ROxgi1y-EKnUc3FLg-cY0-nx4_Ni_N9v35ddNum4kaURupPAQD1mgivXSgredcGgiWc2uFMSxK2KugYM-ki4pJYUEHrVWkLITI1-j2__cY_16g1N3YFw_D4BLkpeyYNoIJQfkvDclP1Q</recordid><startdate>20030901</startdate><enddate>20030901</enddate><creator>Katz, M G</creator><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20030901</creationdate><title>A mechanized proof environment for the convenient computations proof method</title><author>Katz, M G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p184t-56ced8e98705c5ae79c3358ed933994882f5eb6d6eb25af62549e7d776f12ddf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Katz, M G</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Formal methods in system design</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Katz, M G</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A mechanized proof environment for the convenient computations proof method</atitle><jtitle>Formal methods in system design</jtitle><date>2003-09-01</date><risdate>2003</risdate><volume>23</volume><issue>2</issue><spage>115</spage><epage>142</epage><pages>115-142</pages><issn>0925-9856</issn><abstract>A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the "convenient computations" method. This method reduces the conceptual difficulty of proving a given property for all the possible computations of a system by separating two different concerns: (1) proving that special convenient computations satisfy the property, and (2) proving that every computation is related to a convenient one by a relation which preserves the property. The approach is especially appropriate for applications in which the first concern is trivial once the second has been shown, e.g., where the specification itself is that every computation reduces to a convenient one. Two examples are the serializability of transactions in distributed databases, and sequential consistency of distributed shared memories. To reduce the repetition of effort, a clear separation is made between "infrastructural" theories to be supplied as a proof environment PVS library to users, and the specification and proof of particular examples. The provided infrastructure formally defines the method in its most general way. It also defines a computation model and a reduction relation-the equivalence of computations that differ only in the order of finitely many independent operations. One way to prove that this relation holds between every computation and some convenient one involves the definition of a measure function from computations into a well-founded set. Two possible default measures, which can be applied in many cases, are also defined in the infrastructure, along with useful lemmas that assist in their usage. We show how the proof environment can be used, by a step-by-step explanation of an application example.</abstract><doi>10.1023/A:1024746015231</doi><tpages>28</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0925-9856
ispartof Formal methods in system design, 2003-09, Vol.23 (2), p.115-142
issn 0925-9856
language eng
recordid cdi_proquest_miscellaneous_27842441
source Springer Nature - Complete Springer Journals
title A mechanized proof environment for the convenient computations proof method
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T00%3A17%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20mechanized%20proof%20environment%20for%20the%20convenient%20computations%20proof%20method&rft.jtitle=Formal%20methods%20in%20system%20design&rft.au=Katz,%20M%20G&rft.date=2003-09-01&rft.volume=23&rft.issue=2&rft.spage=115&rft.epage=142&rft.pages=115-142&rft.issn=0925-9856&rft_id=info:doi/10.1023/A:1024746015231&rft_dat=%3Cproquest%3E27842441%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=27842441&rft_id=info:pmid/&rfr_iscdi=true