Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs
Information flow control (IFC) is a technique to assert the security of a given program with respect to a given security policy. The classical policy noninterference requires that public output of a program may not be influenced from secret input. This work leverages a technique called program slici...
Saved in:
| : | |
|---|---|
| Year of Publication: | 2009 |
| Language: | English |
| Physical Description: | 1 electronic resource (221 p. p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
993545664704498 |
|---|---|
| ctrlnum |
(CKB)4920000000101296 (oapen)https://directory.doabooks.org/handle/20.500.12854/50219 (EXLCZ)994920000000101296 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Hammer, Christian auth Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs Information flow control for java KIT Scientific Publishing 2009 1 electronic resource (221 p. p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier Information flow control (IFC) is a technique to assert the security of a given program with respect to a given security policy. The classical policy noninterference requires that public output of a program may not be influenced from secret input. This work leverages a technique called program slicing, which is closely connected to IFC and offers many dimensions for improving analysis precision, the most powerful are Path Conditions. Our evaluation shows scalability with a low annotation burden. English information flow control software security program slicing program dependence graph path conditions 3-86644-398-6 |
| language |
English |
| format |
eBook |
| author |
Hammer, Christian |
| spellingShingle |
Hammer, Christian Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| author_facet |
Hammer, Christian |
| author_variant |
c h ch |
| author_sort |
Hammer, Christian |
| title |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| title_full |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| title_fullStr |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| title_full_unstemmed |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| title_auth |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| title_alt |
Information flow control for java |
| title_new |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| title_sort |
information flow control for java : a comprehensive approach based on path conditions in dependence graphs |
| publisher |
KIT Scientific Publishing |
| publishDate |
2009 |
| physical |
1 electronic resource (221 p. p.) |
| isbn |
1000012049 3-86644-398-6 |
| illustrated |
Not Illustrated |
| work_keys_str_mv |
AT hammerchristian informationflowcontrolforjavaacomprehensiveapproachbasedonpathconditionsindependencegraphs AT hammerchristian informationflowcontrolforjava |
| status_str |
n |
| ids_txt_mv |
(CKB)4920000000101296 (oapen)https://directory.doabooks.org/handle/20.500.12854/50219 (EXLCZ)994920000000101296 |
| carrierType_str_mv |
cr |
| is_hierarchy_title |
Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| _version_ |
1796651960946917376 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01570nam-a2200337z--4500</leader><controlfield tag="001">993545664704498</controlfield><controlfield tag="005">20231214133332.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr|mn|---annan</controlfield><controlfield tag="008">202102s2009 xx |||||o ||| 0|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1000012049</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)4920000000101296</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/50219</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)994920000000101296</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hammer, Christian</subfield><subfield code="4">auth</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs</subfield></datafield><datafield tag="246" ind1=" " ind2=" "><subfield code="a">Information flow control for java </subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="b">KIT Scientific Publishing</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 electronic resource (221 p. p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Information flow control (IFC) is a technique to assert the security of a given program with respect to a given security policy. The classical policy noninterference requires that public output of a program may not be influenced from secret input. This work leverages a technique called program slicing, which is closely connected to IFC and offers many dimensions for improving analysis precision, the most powerful are Path Conditions. Our evaluation shows scalability with a low annotation burden.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">information flow control</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">software security</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">program slicing</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">program dependence graph</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">path conditions</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-86644-398-6</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-12-15 05:50:39 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2019-11-10 04:18:40 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5337991990004498&Force_direct=true</subfield><subfield code="Z">5337991990004498</subfield><subfield code="b">Available</subfield><subfield code="8">5337991990004498</subfield></datafield></record></collection> |