Information flow in parallel programs: an axiomatic approach
The information flow problem is concerned with controlling the transmission of information in computer systems. This thesis addresses this problem by developing an axiomatic logic that captures the information flow semantics of a program. Using this technique the scope of information flow analysis i...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, New York
1978
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
350 |
| Schlagworte: | |
| Zusammenfassung: | The information flow problem is concerned with controlling the transmission of information in computer systems. This thesis addresses this problem by developing an axiomatic logic that captures the information flow semantics of a program. Using this technique the scope of information flow analysis is extended from terminating sequential programs to parallel programs in which non-termination, synchronization and deadlock are possible. Once the information flow generated by a program has been determined, it is easy to check whether or not the program satisfies a given security policy The main contribution of the thesis is an axiomatic proof system for determining the flow of information produced by sequential or parallel programs. Just as proofs of correctness capture the effect of program execution upon the values in variables, proofs of information flow capture the effect of program execution upon the information in variables. An advantage of this approach is that once a flow proof of a program has been generated, various security policies, such as high water mark or final value, can be verified readily Although flows in parallel programs need to be determined so that confidentiality in shared systems can be maintained, current information flow techniques are limited to terminating sequential programs. The thesis addresses this problem by capturing the flows generated by programs containing independent processes that synchronize with each other. The practicability of the method is demonstrated by developing the flow semantics for Concurrent Pascal |
| Beschreibung: | 170 Sp. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009891728 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941109s1978 |||| 00||| engod | ||
| 035 | |a (OCoLC)4637415 | ||
| 035 | |a (DE-599)BVBBV009891728 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.7858 |b R37i | |
| 100 | 1 | |a Reitman, Richard Philip |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Information flow in parallel programs |b an axiomatic approach |c Richard Philip Reitman |
| 264 | 1 | |a Ithaca, New York |c 1978 | |
| 300 | |a 170 Sp. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 350 | |
| 520 | 3 | |a The information flow problem is concerned with controlling the transmission of information in computer systems. This thesis addresses this problem by developing an axiomatic logic that captures the information flow semantics of a program. Using this technique the scope of information flow analysis is extended from terminating sequential programs to parallel programs in which non-termination, synchronization and deadlock are possible. Once the information flow generated by a program has been determined, it is easy to check whether or not the program satisfies a given security policy | |
| 520 | 3 | |a The main contribution of the thesis is an axiomatic proof system for determining the flow of information produced by sequential or parallel programs. Just as proofs of correctness capture the effect of program execution upon the values in variables, proofs of information flow capture the effect of program execution upon the information in variables. An advantage of this approach is that once a flow proof of a program has been generated, various security policies, such as high water mark or final value, can be verified readily | |
| 520 | 3 | |a Although flows in parallel programs need to be determined so that confidentiality in shared systems can be maintained, current information flow techniques are limited to terminating sequential programs. The thesis addresses this problem by capturing the flows generated by programs containing independent processes that synchronize with each other. The practicability of the method is demonstrated by developing the flow semantics for Concurrent Pascal | |
| 650 | 4 | |a Computers |x Access control | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 655 | 7 | |8 1\p |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 350 |w (DE-604)BV006185504 |9 350 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006549455 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804124249579847680 |
|---|---|
| any_adam_object | |
| author | Reitman, Richard Philip |
| author_facet | Reitman, Richard Philip |
| author_role | aut |
| author_sort | Reitman, Richard Philip |
| author_variant | r p r rp rpr |
| building | Verbundindex |
| bvnumber | BV009891728 |
| ctrlnum | (OCoLC)4637415 (DE-599)BVBBV009891728 |
| dewey-full | 510.7858 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.7858 |
| dewey-search | 510.7858 |
| dewey-sort | 3510.7858 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02821nam a2200361 cb4500</leader><controlfield tag="001">BV009891728</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941109s1978 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)4637415</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009891728</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="082" ind1="0" ind2=" "><subfield code="a">510.7858</subfield><subfield code="b">R37i</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Reitman, Richard Philip</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Information flow in parallel programs</subfield><subfield code="b">an axiomatic approach</subfield><subfield code="c">Richard Philip Reitman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">170 Sp.</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">350</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The information flow problem is concerned with controlling the transmission of information in computer systems. This thesis addresses this problem by developing an axiomatic logic that captures the information flow semantics of a program. Using this technique the scope of information flow analysis is extended from terminating sequential programs to parallel programs in which non-termination, synchronization and deadlock are possible. Once the information flow generated by a program has been determined, it is easy to check whether or not the program satisfies a given security policy</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The main contribution of the thesis is an axiomatic proof system for determining the flow of information produced by sequential or parallel programs. Just as proofs of correctness capture the effect of program execution upon the values in variables, proofs of information flow capture the effect of program execution upon the information in variables. An advantage of this approach is that once a flow proof of a program has been generated, various security policies, such as high water mark or final value, can be verified readily</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Although flows in parallel programs need to be determined so that confidentiality in shared systems can be maintained, current information flow techniques are limited to terminating sequential programs. The thesis addresses this problem by capturing the flows generated by programs containing independent processes that synchronize with each other. The practicability of the method is demonstrated by developing the flow semantics for Concurrent Pascal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield><subfield code="x">Access control</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</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="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">350</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">350</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006549455</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></record></collection> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009891728 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:40Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006549455 |
| oclc_num | 4637415 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 170 Sp. |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Reitman, Richard Philip Verfasser aut Information flow in parallel programs an axiomatic approach Richard Philip Reitman Ithaca, New York 1978 170 Sp. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 350 The information flow problem is concerned with controlling the transmission of information in computer systems. This thesis addresses this problem by developing an axiomatic logic that captures the information flow semantics of a program. Using this technique the scope of information flow analysis is extended from terminating sequential programs to parallel programs in which non-termination, synchronization and deadlock are possible. Once the information flow generated by a program has been determined, it is easy to check whether or not the program satisfies a given security policy The main contribution of the thesis is an axiomatic proof system for determining the flow of information produced by sequential or parallel programs. Just as proofs of correctness capture the effect of program execution upon the values in variables, proofs of information flow capture the effect of program execution upon the information in variables. An advantage of this approach is that once a flow proof of a program has been generated, various security policies, such as high water mark or final value, can be verified readily Although flows in parallel programs need to be determined so that confidentiality in shared systems can be maintained, current information flow techniques are limited to terminating sequential programs. The thesis addresses this problem by capturing the flows generated by programs containing independent processes that synchronize with each other. The practicability of the method is demonstrated by developing the flow semantics for Concurrent Pascal Computers Access control Parallel processing (Electronic computers) 1\p (DE-588)4113937-9 Hochschulschrift gnd-content Department of Computer Science: Technical report Cornell University <Ithaca, NY> 350 (DE-604)BV006185504 350 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Reitman, Richard Philip Information flow in parallel programs an axiomatic approach Computers Access control Parallel processing (Electronic computers) |
| subject_GND | (DE-588)4113937-9 |
| title | Information flow in parallel programs an axiomatic approach |
| title_auth | Information flow in parallel programs an axiomatic approach |
| title_exact_search | Information flow in parallel programs an axiomatic approach |
| title_full | Information flow in parallel programs an axiomatic approach Richard Philip Reitman |
| title_fullStr | Information flow in parallel programs an axiomatic approach Richard Philip Reitman |
| title_full_unstemmed | Information flow in parallel programs an axiomatic approach Richard Philip Reitman |
| title_short | Information flow in parallel programs |
| title_sort | information flow in parallel programs an axiomatic approach |
| title_sub | an axiomatic approach |
| topic | Computers Access control Parallel processing (Electronic computers) |
| topic_facet | Computers Access control Parallel processing (Electronic computers) Hochschulschrift |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT reitmanrichardphilip informationflowinparallelprogramsanaxiomaticapproach |