Compositionality, concurrency, and partial correctness: proof theories for networks of processes, and their relationship
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin u.a
Springer
1989
|
Schriftenreihe: | Lecture notes in computer science
321 |
Schlagworte: | |
Beschreibung: | Literaturverz. S. 266 - 272 |
Beschreibung: | VI, 272 S. graph. Darst. |
ISBN: | 3540508457 0387508457 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV001801500 | ||
003 | DE-604 | ||
005 | 19910916 | ||
007 | t| | ||
008 | 890131s1989 gw d||| |||| 00||| eng d | ||
020 | |a 3540508457 |9 3-540-50845-7 | ||
020 | |a 0387508457 |9 0-387-50845-7 | ||
035 | |a (OCoLC)423161718 | ||
035 | |a (DE-599)BVBBV001801500 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-12 |a DE-91G |a DE-384 |a DE-703 |a DE-739 |a DE-20 |a DE-19 |a DE-706 |a DE-11 |a DE-188 |a DE-83 | ||
050 | 0 | |a QA75.5L4V.321 | |
084 | |a DAT 325f |2 stub | ||
100 | 1 | |a Zwiers, Job |e Verfasser |4 aut | |
245 | 1 | 0 | |a Compositionality, concurrency, and partial correctness |b proof theories for networks of processes, and their relationship |c J. Zwiers |
264 | 1 | |a Berlin u.a |b Springer |c 1989 | |
300 | |a VI, 272 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 321 | |
500 | |a Literaturverz. S. 266 - 272 | ||
650 | 4 | |a Parallélisme (Informatique) | |
650 | 4 | |a Théorèmes - Démonstration automatique | |
650 | 0 | 7 | |a Programmverifikation |0 (DE-588)4135576-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Modulare Programmierung |0 (DE-588)4120756-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Dekomposition |0 (DE-588)4149030-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Korrektheit |0 (DE-588)4240223-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Partiell korrektes Programm |0 (DE-588)4210084-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |2 gnd |9 rswk-swf |
655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
655 | 7 | |a Prozeßnetz |2 gnd |9 rswk-swf | |
689 | 0 | 0 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |D s |
689 | 0 | 1 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
689 | 0 | 2 | |a Dekomposition |0 (DE-588)4149030-7 |D s |
689 | 0 | 3 | |a Partiell korrektes Programm |0 (DE-588)4210084-7 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Prozeßnetz |A f |
689 | 1 | 1 | |a Korrektheit |0 (DE-588)4240223-2 |D s |
689 | 1 | 2 | |a Beweis |0 (DE-588)4132532-1 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Programmverifikation |0 (DE-588)4135576-3 |D s |
689 | 2 | |5 DE-604 | |
689 | 3 | 0 | |a Modulare Programmierung |0 (DE-588)4120756-7 |D s |
689 | 3 | |5 DE-604 | |
830 | 0 | |a Lecture notes in computer science |v 321 |w (DE-604)BV000000607 |9 321 | |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-001210680 |
Datensatz im Suchindex
_version_ | 1820874837130739712 |
---|---|
adam_text | |
any_adam_object | |
author | Zwiers, Job |
author_facet | Zwiers, Job |
author_role | aut |
author_sort | Zwiers, Job |
author_variant | j z jz |
building | Verbundindex |
bvnumber | BV001801500 |
callnumber-first | Q - Science |
callnumber-label | QA75 |
callnumber-raw | QA75.5L4V.321 |
callnumber-search | QA75.5L4V.321 |
callnumber-sort | QA 275.5 L4 V 3321 |
callnumber-subject | QA - Mathematics |
classification_rvk | SS 4800 |
classification_tum | DAT 325f |
ctrlnum | (OCoLC)423161718 (DE-599)BVBBV001801500 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV001801500</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19910916</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">890131s1989 gw d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540508457</subfield><subfield code="9">3-540-50845-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387508457</subfield><subfield code="9">0-387-50845-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)423161718</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV001801500</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5L4V.321</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 325f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zwiers, Job</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Compositionality, concurrency, and partial correctness</subfield><subfield code="b">proof theories for networks of processes, and their relationship</subfield><subfield code="c">J. Zwiers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a</subfield><subfield code="b">Springer</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 272 S.</subfield><subfield code="b">graph. Darst.</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">Lecture notes in computer science</subfield><subfield code="v">321</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 266 - 272</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallélisme (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorèmes - Démonstration automatique</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Modulare Programmierung</subfield><subfield code="0">(DE-588)4120756-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Partiell korrektes Programm</subfield><subfield code="0">(DE-588)4210084-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Prozeßnetz</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Partiell korrektes Programm</subfield><subfield code="0">(DE-588)4210084-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Prozeßnetz</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Korrektheit</subfield><subfield code="0">(DE-588)4240223-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Programmverifikation</subfield><subfield code="0">(DE-588)4135576-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Modulare Programmierung</subfield><subfield code="0">(DE-588)4120756-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">321</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">321</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001210680</subfield></datafield></record></collection> |
genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Prozeßnetz gnd |
genre_facet | Hochschulschrift Prozeßnetz |
id | DE-604.BV001801500 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:06:05Z |
institution | BVB |
isbn | 3540508457 0387508457 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001210680 |
oclc_num | 423161718 |
open_access_boolean | |
owner | DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-11 DE-188 DE-83 |
owner_facet | DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-11 DE-188 DE-83 |
physical | VI, 272 S. graph. Darst. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Zwiers, Job Verfasser aut Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship J. Zwiers Berlin u.a Springer 1989 VI, 272 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 321 Literaturverz. S. 266 - 272 Parallélisme (Informatique) Théorèmes - Démonstration automatique Programmverifikation (DE-588)4135576-3 gnd rswk-swf Modulare Programmierung (DE-588)4120756-7 gnd rswk-swf Beweis (DE-588)4132532-1 gnd rswk-swf Dekomposition (DE-588)4149030-7 gnd rswk-swf Korrektheit (DE-588)4240223-2 gnd rswk-swf Partiell korrektes Programm (DE-588)4210084-7 gnd rswk-swf Nebenläufigkeit (DE-588)4115352-2 gnd rswk-swf 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Prozeßnetz gnd rswk-swf Nebenläufigkeit (DE-588)4115352-2 s Programmverifikation (DE-588)4135576-3 s Dekomposition (DE-588)4149030-7 s Partiell korrektes Programm (DE-588)4210084-7 s DE-604 Prozeßnetz f Korrektheit (DE-588)4240223-2 s Beweis (DE-588)4132532-1 s Modulare Programmierung (DE-588)4120756-7 s Lecture notes in computer science 321 (DE-604)BV000000607 321 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Zwiers, Job Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship Lecture notes in computer science Parallélisme (Informatique) Théorèmes - Démonstration automatique Programmverifikation (DE-588)4135576-3 gnd Modulare Programmierung (DE-588)4120756-7 gnd Beweis (DE-588)4132532-1 gnd Dekomposition (DE-588)4149030-7 gnd Korrektheit (DE-588)4240223-2 gnd Partiell korrektes Programm (DE-588)4210084-7 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
subject_GND | (DE-588)4135576-3 (DE-588)4120756-7 (DE-588)4132532-1 (DE-588)4149030-7 (DE-588)4240223-2 (DE-588)4210084-7 (DE-588)4115352-2 (DE-588)4113937-9 |
title | Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship |
title_auth | Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship |
title_exact_search | Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship |
title_full | Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship J. Zwiers |
title_fullStr | Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship J. Zwiers |
title_full_unstemmed | Compositionality, concurrency, and partial correctness proof theories for networks of processes, and their relationship J. Zwiers |
title_short | Compositionality, concurrency, and partial correctness |
title_sort | compositionality concurrency and partial correctness proof theories for networks of processes and their relationship |
title_sub | proof theories for networks of processes, and their relationship |
topic | Parallélisme (Informatique) Théorèmes - Démonstration automatique Programmverifikation (DE-588)4135576-3 gnd Modulare Programmierung (DE-588)4120756-7 gnd Beweis (DE-588)4132532-1 gnd Dekomposition (DE-588)4149030-7 gnd Korrektheit (DE-588)4240223-2 gnd Partiell korrektes Programm (DE-588)4210084-7 gnd Nebenläufigkeit (DE-588)4115352-2 gnd |
topic_facet | Parallélisme (Informatique) Théorèmes - Démonstration automatique Programmverifikation Modulare Programmierung Beweis Dekomposition Korrektheit Partiell korrektes Programm Nebenläufigkeit Hochschulschrift Prozeßnetz |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT zwiersjob compositionalityconcurrencyandpartialcorrectnessprooftheoriesfornetworksofprocessesandtheirrelationship |