Proof planning the verification of CCS programs:
Abstract: "The verification of CCS programs has often been characterised as an expensive, time-consuming, and error-prone task, where computer assistance is thought to be essential. Yet, existing theorem proving based frameworks, for the verification of programs using CCS, are no [sic] much use...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1996
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
781 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The verification of CCS programs has often been characterised as an expensive, time-consuming, and error-prone task, where computer assistance is thought to be essential. Yet, existing theorem proving based frameworks, for the verification of programs using CCS, are no [sic] much use because their poor level of automation. In this paper, we propose the use of proof plans as the chief mechanism for the automation of CCS program verification. We present a collection of proof plan methods that guide a proof plan formation for the verification of deterministic, and divergence-free CCS programs. The meta-level reasoning embedded in these methods takes full advantage of the operational interpretation of processes while outputting plan steps to the appropriate object-level representation." |
| Beschreibung: | [15] S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011045981 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961108s1996 |||| 00||| engod | ||
| 035 | |a (OCoLC)35590619 | ||
| 035 | |a (DE-599)BVBBV011045981 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 245 | 1 | 0 | |a Proof planning the verification of CCS programs |c Monroy, R. ... |
| 264 | 1 | |a Edinburgh |c 1996 | |
| 300 | |a [15] S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 781 | |
| 520 | 3 | |a Abstract: "The verification of CCS programs has often been characterised as an expensive, time-consuming, and error-prone task, where computer assistance is thought to be essential. Yet, existing theorem proving based frameworks, for the verification of programs using CCS, are no [sic] much use because their poor level of automation. In this paper, we propose the use of proof plans as the chief mechanism for the automation of CCS program verification. We present a collection of proof plan methods that guide a proof plan formation for the verification of deterministic, and divergence-free CCS programs. The meta-level reasoning embedded in these methods takes full advantage of the operational interpretation of processes while outputting plan steps to the appropriate object-level representation." | |
| 650 | 7 | |a Applied statistics, operational research |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Computer network protocols | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Machine theory | |
| 700 | 1 | |a Monroy, Raúl |e Sonstige |4 oth | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 781 |w (DE-604)BV010450646 |9 781 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007396985 | ||
Datensatz im Suchindex
| _version_ | 1804125535692914688 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV011045981 |
| ctrlnum | (OCoLC)35590619 (DE-599)BVBBV011045981 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01964nam a2200349 cb4500</leader><controlfield tag="001">BV011045981</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961108s1996 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35590619</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011045981</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proof planning the verification of CCS programs</subfield><subfield code="c">Monroy, R. ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">[15] S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">781</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The verification of CCS programs has often been characterised as an expensive, time-consuming, and error-prone task, where computer assistance is thought to be essential. Yet, existing theorem proving based frameworks, for the verification of programs using CCS, are no [sic] much use because their poor level of automation. In this paper, we propose the use of proof plans as the chief mechanism for the automation of CCS program verification. We present a collection of proof plan methods that guide a proof plan formation for the verification of deterministic, and divergence-free CCS programs. The meta-level reasoning embedded in these methods takes full advantage of the operational interpretation of processes while outputting plan steps to the appropriate object-level representation."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Applied statistics, operational research</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Monroy, Raúl</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">781</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">781</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007396985</subfield></datafield></record></collection> |
| id | DE-604.BV011045981 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007396985 |
| oclc_num | 35590619 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | [15] S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Proof planning the verification of CCS programs Monroy, R. ... Edinburgh 1996 [15] S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 781 Abstract: "The verification of CCS programs has often been characterised as an expensive, time-consuming, and error-prone task, where computer assistance is thought to be essential. Yet, existing theorem proving based frameworks, for the verification of programs using CCS, are no [sic] much use because their poor level of automation. In this paper, we propose the use of proof plans as the chief mechanism for the automation of CCS program verification. We present a collection of proof plan methods that guide a proof plan formation for the verification of deterministic, and divergence-free CCS programs. The meta-level reasoning embedded in these methods takes full advantage of the operational interpretation of processes while outputting plan steps to the appropriate object-level representation." Applied statistics, operational research sigle Computer software sigle Automatic theorem proving Computer network protocols Logic, Symbolic and mathematical Machine theory Monroy, Raúl Sonstige oth Department of Artificial Intelligence: DAI research paper University <Edinburgh> 781 (DE-604)BV010450646 781 |
| spellingShingle | Proof planning the verification of CCS programs Applied statistics, operational research sigle Computer software sigle Automatic theorem proving Computer network protocols Logic, Symbolic and mathematical Machine theory |
| title | Proof planning the verification of CCS programs |
| title_auth | Proof planning the verification of CCS programs |
| title_exact_search | Proof planning the verification of CCS programs |
| title_full | Proof planning the verification of CCS programs Monroy, R. ... |
| title_fullStr | Proof planning the verification of CCS programs Monroy, R. ... |
| title_full_unstemmed | Proof planning the verification of CCS programs Monroy, R. ... |
| title_short | Proof planning the verification of CCS programs |
| title_sort | proof planning the verification of ccs programs |
| topic | Applied statistics, operational research sigle Computer software sigle Automatic theorem proving Computer network protocols Logic, Symbolic and mathematical Machine theory |
| topic_facet | Applied statistics, operational research Computer software Automatic theorem proving Computer network protocols Logic, Symbolic and mathematical Machine theory |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT monroyraul proofplanningtheverificationofccsprograms |