Trace-based network proof systems: expressiveness and completeness
We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions.
Gespeichert in:
| Veröffentlicht in: | ACM transactions on programming languages and systems 1992-05, Vol.14 (3), p.396-416 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 416 |
|---|---|
| container_issue | 3 |
| container_start_page | 396 |
| container_title | ACM transactions on programming languages and systems |
| container_volume | 14 |
| creator | Widom, Jennifer Gries, David Schneider, Fred B. |
| description | We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions. |
| doi_str_mv | 10.1145/129393.129396 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_25920949</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>25920949</sourcerecordid><originalsourceid>FETCH-LOGICAL-a269t-f565f0b2c2a24db30382e76510983029145c6cbd4af64759a85ace995916a6453</originalsourceid><addsrcrecordid>eNpFkE1Lw0AQhhdRsFaPHrxVEG9b92u2maMUv6DgpZ7DZLsL1aSpOynSf280RU_v5ZnnfRkhLrWaau3gThu0aKe_4Y_ESAMU0gHaYzFS2jup0MCpOGN-V0rpAoqRuF5mClFWxHE12cTuq80fk21u2zThPXex4XNxkqjmeHHIsXh7fFjOn-Xi9ellfr-QZDx2MoGHpCoTDBm3qqyyhYkzD1phYZXBfmDwoVo5St7NAKmAvhgRUHvyDuxY3A7evv1zF7krmzWHWNe0ie2OSwNoFDrsQTmAIbfMOaZym9cN5X2pVfnziHJ4xBC-528OYuJAdcq0CWv-O4J-uPKzHrsaMArNv3FQfANXDmJm</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25920949</pqid></control><display><type>article</type><title>Trace-based network proof systems: expressiveness and completeness</title><source>Access via ACM Digital Library</source><creator>Widom, Jennifer ; Gries, David ; Schneider, Fred B.</creator><creatorcontrib>Widom, Jennifer ; Gries, David ; Schneider, Fred B.</creatorcontrib><description>We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions.</description><identifier>ISSN: 0164-0925</identifier><identifier>EISSN: 1558-4593</identifier><identifier>DOI: 10.1145/129393.129396</identifier><identifier>CODEN: ATPSDT</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computing methodologies ; Concurrent computing methodologies ; Concurrent programming languages ; Correctness ; Exact sciences and technology ; Formal language definitions ; General programming languages ; Language types ; Logic ; Program reasoning ; Program semantics ; Proof theory ; Semantics ; Semantics and reasoning ; Software ; Software and its engineering ; Software engineering ; Software functional properties ; Software notations and tools ; Software organization and properties ; Symbolic and algebraic algorithms ; Symbolic and algebraic manipulation ; Theorem proving algorithms ; Theory of computation</subject><ispartof>ACM transactions on programming languages and systems, 1992-05, Vol.14 (3), p.396-416</ispartof><rights>ACM</rights><rights>1992 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-a269t-f565f0b2c2a24db30382e76510983029145c6cbd4af64759a85ace995916a6453</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/129393.129396$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,780,784,2282,27924,27925,40196,76228</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=5565067$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Widom, Jennifer</creatorcontrib><creatorcontrib>Gries, David</creatorcontrib><creatorcontrib>Schneider, Fred B.</creatorcontrib><title>Trace-based network proof systems: expressiveness and completeness</title><title>ACM transactions on programming languages and systems</title><addtitle>ACM TOPLAS</addtitle><description>We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computing methodologies</subject><subject>Concurrent computing methodologies</subject><subject>Concurrent programming languages</subject><subject>Correctness</subject><subject>Exact sciences and technology</subject><subject>Formal language definitions</subject><subject>General programming languages</subject><subject>Language types</subject><subject>Logic</subject><subject>Program reasoning</subject><subject>Program semantics</subject><subject>Proof theory</subject><subject>Semantics</subject><subject>Semantics and reasoning</subject><subject>Software</subject><subject>Software and its engineering</subject><subject>Software engineering</subject><subject>Software functional properties</subject><subject>Software notations and tools</subject><subject>Software organization and properties</subject><subject>Symbolic and algebraic algorithms</subject><subject>Symbolic and algebraic manipulation</subject><subject>Theorem proving algorithms</subject><subject>Theory of computation</subject><issn>0164-0925</issn><issn>1558-4593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNpFkE1Lw0AQhhdRsFaPHrxVEG9b92u2maMUv6DgpZ7DZLsL1aSpOynSf280RU_v5ZnnfRkhLrWaau3gThu0aKe_4Y_ESAMU0gHaYzFS2jup0MCpOGN-V0rpAoqRuF5mClFWxHE12cTuq80fk21u2zThPXex4XNxkqjmeHHIsXh7fFjOn-Xi9ellfr-QZDx2MoGHpCoTDBm3qqyyhYkzD1phYZXBfmDwoVo5St7NAKmAvhgRUHvyDuxY3A7evv1zF7krmzWHWNe0ie2OSwNoFDrsQTmAIbfMOaZym9cN5X2pVfnziHJ4xBC-528OYuJAdcq0CWv-O4J-uPKzHrsaMArNv3FQfANXDmJm</recordid><startdate>199205</startdate><enddate>199205</enddate><creator>Widom, Jennifer</creator><creator>Gries, David</creator><creator>Schneider, Fred B.</creator><general>ACM</general><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>199205</creationdate><title>Trace-based network proof systems</title><author>Widom, Jennifer ; Gries, David ; Schneider, Fred B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a269t-f565f0b2c2a24db30382e76510983029145c6cbd4af64759a85ace995916a6453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computing methodologies</topic><topic>Concurrent computing methodologies</topic><topic>Concurrent programming languages</topic><topic>Correctness</topic><topic>Exact sciences and technology</topic><topic>Formal language definitions</topic><topic>General programming languages</topic><topic>Language types</topic><topic>Logic</topic><topic>Program reasoning</topic><topic>Program semantics</topic><topic>Proof theory</topic><topic>Semantics</topic><topic>Semantics and reasoning</topic><topic>Software</topic><topic>Software and its engineering</topic><topic>Software engineering</topic><topic>Software functional properties</topic><topic>Software notations and tools</topic><topic>Software organization and properties</topic><topic>Symbolic and algebraic algorithms</topic><topic>Symbolic and algebraic manipulation</topic><topic>Theorem proving algorithms</topic><topic>Theory of computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Widom, Jennifer</creatorcontrib><creatorcontrib>Gries, David</creatorcontrib><creatorcontrib>Schneider, Fred B.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><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>ACM transactions on programming languages and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Widom, Jennifer</au><au>Gries, David</au><au>Schneider, Fred B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Trace-based network proof systems: expressiveness and completeness</atitle><jtitle>ACM transactions on programming languages and systems</jtitle><stitle>ACM TOPLAS</stitle><date>1992-05</date><risdate>1992</risdate><volume>14</volume><issue>3</issue><spage>396</spage><epage>416</epage><pages>396-416</pages><issn>0164-0925</issn><eissn>1558-4593</eissn><coden>ATPSDT</coden><abstract>We consider incomplete trace-based network proof systems for safety properties, identifying extensions that are necessary and sufficient to achieve relative completeness. We investigate the expressiveness required of any trace logic to encode these extensions.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/129393.129396</doi><tpages>21</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0164-0925 |
| ispartof | ACM transactions on programming languages and systems, 1992-05, Vol.14 (3), p.396-416 |
| issn | 0164-0925 1558-4593 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_25920949 |
| source | Access via ACM Digital Library |
| subjects | Applied sciences Computer science control theory systems Computing methodologies Concurrent computing methodologies Concurrent programming languages Correctness Exact sciences and technology Formal language definitions General programming languages Language types Logic Program reasoning Program semantics Proof theory Semantics Semantics and reasoning Software Software and its engineering Software engineering Software functional properties Software notations and tools Software organization and properties Symbolic and algebraic algorithms Symbolic and algebraic manipulation Theorem proving algorithms Theory of computation |
| title | Trace-based network proof systems: expressiveness and completeness |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T20%3A17%3A13IST&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=Trace-based%20network%20proof%20systems:%20expressiveness%20and%20completeness&rft.jtitle=ACM%20transactions%20on%20programming%20languages%20and%20systems&rft.au=Widom,%20Jennifer&rft.date=1992-05&rft.volume=14&rft.issue=3&rft.spage=396&rft.epage=416&rft.pages=396-416&rft.issn=0164-0925&rft.eissn=1558-4593&rft.coden=ATPSDT&rft_id=info:doi/10.1145/129393.129396&rft_dat=%3Cproquest_cross%3E25920949%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=25920949&rft_id=info:pmid/&rfr_iscdi=true |