Verification of distributed systems with local–global predicates

This paper describes a methodology for developing and verifying a class of distributed systems in which the state space may be discrete or continuous. Our focus is on systems where changes are local in that a small number of components change state while the remainder of the system is unchanged. A p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Formal aspects of computing 2011-09, Vol.23 (5), p.649-679
Hauptverfasser: Chandy, K. Mani, Go, Brian, Mitra, Sayan, Pilotto, Concetta, White, Jerome
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 679
container_issue 5
container_start_page 649
container_title Formal aspects of computing
container_volume 23
creator Chandy, K. Mani
Go, Brian
Mitra, Sayan
Pilotto, Concetta
White, Jerome
description This paper describes a methodology for developing and verifying a class of distributed systems in which the state space may be discrete or continuous. Our focus is on systems where changes are local in that a small number of components change state while the remainder of the system is unchanged. A proof methodology is developed that ensures global properties, such as invariants and convergence, by guaranteeing local properties within subsystems. This methodology is used to prove the correctness of concrete examples. We present a PVS library of theorems and proofs that can be used to reduce the work required to develop and verify programs in this class. A transformation of these libraries to Java is also outlined.
doi_str_mv 10.1007/s00165-010-0150-7
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671290306</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671290306</sourcerecordid><originalsourceid>FETCH-LOGICAL-c421t-d024ce813adf1f8ad53a9c48eede98c0d9b9af586586030e65ed25d2636974d23</originalsourceid><addsrcrecordid>eNp1kMtKJDEUhoM4YNvjA7grBMFN6cmtqrJU8QbCbGYGdyGdnGoj1VVtTjXSu3kH33CexDQtCoJwwlnk-38OH2OHHE45QH1GALzSJXDIT0NZ77AJV1KWwpiHXTYBI1WpQck9tk_0lGltOJ-wi7-YYhu9G-PQF0NbhEhjirPViKGgNY24oOIljo9FN3jX_f_3Ou-GmeuKZcKwiSH9ZD9a1xEevO8p-3N99fvytrz_dXN3eX5feiX4WAYQymPDpQstbxsXtHTGqwYxoGk8BDMzrtVNlQckYKUxCB1EJStTqyDklJ1se5dpeF4hjXYRyWPXuR6HFVle1VyYHK0yevQFfRpWqc_X2abRNWjFIUN8C_k0ECVs7TLFhUtry8FupNqtVJul2o1UW-fM8Xuxo6yjTa73kT6CQmnZSCEzJ7Yc5a9-junzgO_L3wC-cIcw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>885705410</pqid></control><display><type>article</type><title>Verification of distributed systems with local–global predicates</title><source>Springer Online Journals</source><source>EZB Electronic Journals Library</source><creator>Chandy, K. Mani ; Go, Brian ; Mitra, Sayan ; Pilotto, Concetta ; White, Jerome</creator><creatorcontrib>Chandy, K. Mani ; Go, Brian ; Mitra, Sayan ; Pilotto, Concetta ; White, Jerome</creatorcontrib><description>This paper describes a methodology for developing and verifying a class of distributed systems in which the state space may be discrete or continuous. Our focus is on systems where changes are local in that a small number of components change state while the remainder of the system is unchanged. A proof methodology is developed that ensures global properties, such as invariants and convergence, by guaranteeing local properties within subsystems. This methodology is used to prove the correctness of concrete examples. We present a PVS library of theorems and proofs that can be used to reduce the work required to develop and verify programs in this class. A transformation of these libraries to Java is also outlined.</description><identifier>ISSN: 0934-5043</identifier><identifier>EISSN: 1433-299X</identifier><identifier>DOI: 10.1007/s00165-010-0150-7</identifier><identifier>CODEN: FACME5</identifier><language>eng</language><publisher>London: Springer-Verlag</publisher><subject>Applied sciences ; Computer networks ; Computer Science ; Computer science; control theory; systems ; Convergence ; Exact sciences and technology ; Invariants ; Java (programming language) ; Libraries ; Math Applications in Computer Science ; Methodology ; Miscellaneous ; Proving ; Theoretical computing ; Theory of Computation ; Transformations</subject><ispartof>Formal aspects of computing, 2011-09, Vol.23 (5), p.649-679</ispartof><rights>British Computer Society 2010</rights><rights>2015 INIST-CNRS</rights><rights>British Computer Society 2011</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c421t-d024ce813adf1f8ad53a9c48eede98c0d9b9af586586030e65ed25d2636974d23</citedby><cites>FETCH-LOGICAL-c421t-d024ce813adf1f8ad53a9c48eede98c0d9b9af586586030e65ed25d2636974d23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00165-010-0150-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00165-010-0150-7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,314,776,780,785,786,23910,23911,25119,27903,27904,41467,42536,51297</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=24538323$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Chandy, K. Mani</creatorcontrib><creatorcontrib>Go, Brian</creatorcontrib><creatorcontrib>Mitra, Sayan</creatorcontrib><creatorcontrib>Pilotto, Concetta</creatorcontrib><creatorcontrib>White, Jerome</creatorcontrib><title>Verification of distributed systems with local–global predicates</title><title>Formal aspects of computing</title><addtitle>Form Asp Comp</addtitle><description>This paper describes a methodology for developing and verifying a class of distributed systems in which the state space may be discrete or continuous. Our focus is on systems where changes are local in that a small number of components change state while the remainder of the system is unchanged. A proof methodology is developed that ensures global properties, such as invariants and convergence, by guaranteeing local properties within subsystems. This methodology is used to prove the correctness of concrete examples. We present a PVS library of theorems and proofs that can be used to reduce the work required to develop and verify programs in this class. A transformation of these libraries to Java is also outlined.</description><subject>Applied sciences</subject><subject>Computer networks</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Convergence</subject><subject>Exact sciences and technology</subject><subject>Invariants</subject><subject>Java (programming language)</subject><subject>Libraries</subject><subject>Math Applications in Computer Science</subject><subject>Methodology</subject><subject>Miscellaneous</subject><subject>Proving</subject><subject>Theoretical computing</subject><subject>Theory of Computation</subject><subject>Transformations</subject><issn>0934-5043</issn><issn>1433-299X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kMtKJDEUhoM4YNvjA7grBMFN6cmtqrJU8QbCbGYGdyGdnGoj1VVtTjXSu3kH33CexDQtCoJwwlnk-38OH2OHHE45QH1GALzSJXDIT0NZ77AJV1KWwpiHXTYBI1WpQck9tk_0lGltOJ-wi7-YYhu9G-PQF0NbhEhjirPViKGgNY24oOIljo9FN3jX_f_3Ou-GmeuKZcKwiSH9ZD9a1xEevO8p-3N99fvytrz_dXN3eX5feiX4WAYQymPDpQstbxsXtHTGqwYxoGk8BDMzrtVNlQckYKUxCB1EJStTqyDklJ1se5dpeF4hjXYRyWPXuR6HFVle1VyYHK0yevQFfRpWqc_X2abRNWjFIUN8C_k0ECVs7TLFhUtry8FupNqtVJul2o1UW-fM8Xuxo6yjTa73kT6CQmnZSCEzJ7Yc5a9-junzgO_L3wC-cIcw</recordid><startdate>20110901</startdate><enddate>20110901</enddate><creator>Chandy, K. Mani</creator><creator>Go, Brian</creator><creator>Mitra, Sayan</creator><creator>Pilotto, Concetta</creator><creator>White, Jerome</creator><general>Springer-Verlag</general><general>Springer</general><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20110901</creationdate><title>Verification of distributed systems with local–global predicates</title><author>Chandy, K. Mani ; Go, Brian ; Mitra, Sayan ; Pilotto, Concetta ; White, Jerome</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c421t-d024ce813adf1f8ad53a9c48eede98c0d9b9af586586030e65ed25d2636974d23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Applied sciences</topic><topic>Computer networks</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Convergence</topic><topic>Exact sciences and technology</topic><topic>Invariants</topic><topic>Java (programming language)</topic><topic>Libraries</topic><topic>Math Applications in Computer Science</topic><topic>Methodology</topic><topic>Miscellaneous</topic><topic>Proving</topic><topic>Theoretical computing</topic><topic>Theory of Computation</topic><topic>Transformations</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chandy, K. Mani</creatorcontrib><creatorcontrib>Go, Brian</creatorcontrib><creatorcontrib>Mitra, Sayan</creatorcontrib><creatorcontrib>Pilotto, Concetta</creatorcontrib><creatorcontrib>White, Jerome</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Databases</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Formal aspects of computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chandy, K. Mani</au><au>Go, Brian</au><au>Mitra, Sayan</au><au>Pilotto, Concetta</au><au>White, Jerome</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Verification of distributed systems with local–global predicates</atitle><jtitle>Formal aspects of computing</jtitle><stitle>Form Asp Comp</stitle><date>2011-09-01</date><risdate>2011</risdate><volume>23</volume><issue>5</issue><spage>649</spage><epage>679</epage><pages>649-679</pages><issn>0934-5043</issn><eissn>1433-299X</eissn><coden>FACME5</coden><abstract>This paper describes a methodology for developing and verifying a class of distributed systems in which the state space may be discrete or continuous. Our focus is on systems where changes are local in that a small number of components change state while the remainder of the system is unchanged. A proof methodology is developed that ensures global properties, such as invariants and convergence, by guaranteeing local properties within subsystems. This methodology is used to prove the correctness of concrete examples. We present a PVS library of theorems and proofs that can be used to reduce the work required to develop and verify programs in this class. A transformation of these libraries to Java is also outlined.</abstract><cop>London</cop><pub>Springer-Verlag</pub><doi>10.1007/s00165-010-0150-7</doi><tpages>31</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0934-5043
ispartof Formal aspects of computing, 2011-09, Vol.23 (5), p.649-679
issn 0934-5043
1433-299X
language eng
recordid cdi_proquest_miscellaneous_1671290306
source Springer Online Journals; EZB Electronic Journals Library
subjects Applied sciences
Computer networks
Computer Science
Computer science
control theory
systems
Convergence
Exact sciences and technology
Invariants
Java (programming language)
Libraries
Math Applications in Computer Science
Methodology
Miscellaneous
Proving
Theoretical computing
Theory of Computation
Transformations
title Verification of distributed systems with local–global predicates
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T18%3A28%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Verification%20of%20distributed%20systems%20with%20local%E2%80%93global%20predicates&rft.jtitle=Formal%20aspects%20of%20computing&rft.au=Chandy,%20K.%20Mani&rft.date=2011-09-01&rft.volume=23&rft.issue=5&rft.spage=649&rft.epage=679&rft.pages=649-679&rft.issn=0934-5043&rft.eissn=1433-299X&rft.coden=FACME5&rft_id=info:doi/10.1007/s00165-010-0150-7&rft_dat=%3Cproquest_cross%3E1671290306%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=885705410&rft_id=info:pmid/&rfr_iscdi=true