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:
| Main Author: | |
|---|---|
| Format: | Electronic Book Chapter |
| Language: | English |
| Published: |
KIT Scientific Publishing
2009
|
| Subjects: | |
| Online Access: | DOAB: download the publication DOAB: description of the publication |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000naaaa2200000uu 4500 | ||
|---|---|---|---|
| 001 | doab_20_500_12854_50219 | ||
| 005 | 20210211 | ||
| 003 | oapen | ||
| 006 | m o d | ||
| 007 | cr|mn|---annan | ||
| 008 | 20210211s2009 xx |||||o ||| 0|eng d | ||
| 020 | |a KSP/1000012049 | ||
| 020 | |a 9783866443983 | ||
| 040 | |a oapen |c oapen | ||
| 024 | 7 | |a 10.5445/KSP/1000012049 |c doi | |
| 041 | 0 | |a eng | |
| 042 | |a dc | ||
| 100 | 1 | |a Hammer, Christian |4 auth | |
| 245 | 1 | 0 | |a Information flow control for java : a comprehensive approach based on path conditions in dependence Graphs |
| 260 | |b KIT Scientific Publishing |c 2009 | ||
| 300 | |a 1 electronic resource (221 p. p.) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 506 | 0 | |a Open Access |2 star |f Unrestricted online access | |
| 520 | |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. | ||
| 540 | |a Creative Commons |f https://creativecommons.org/licenses/by-nc-nd/4.0/ |2 cc |4 https://creativecommons.org/licenses/by-nc-nd/4.0/ | ||
| 546 | |a English | ||
| 653 | |a information flow control | ||
| 653 | |a software security | ||
| 653 | |a program slicing | ||
| 653 | |a program dependence graph | ||
| 653 | |a path conditions | ||
| 856 | 4 | 0 | |a www.oapen.org |u https://www.ksp.kit.edu/9783866443983 |7 0 |z DOAB: download the publication |
| 856 | 4 | 0 | |a www.oapen.org |u https://directory.doabooks.org/handle/20.500.12854/50219 |7 0 |z DOAB: description of the publication |