LEADER 01721nam  2200361z- 450 
001 9910346922603321
005 20231214133332.0
010   $a1000012049
035   $a(CKB)4920000000101296
035   $a(oapen)https://directory.doabooks.org/handle/20.500.12854/50219
035   $a(EXLCZ)994920000000101296
100   $a20202102d2009      |y             0
101 0 $aeng
135   $aurmn|---annan
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aInformation flow control for java : a comprehensive approach based on path conditions in dependence Graphs
210   $cKIT Scientific Publishing$d2009
215   $a1 electronic resource (221 p. p.)
311   $a3-86644-398-6 
330   $aInformation 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.
517   $aInformation flow control for java 
610   $ainformation flow control
610   $asoftware security
610   $aprogram slicing
610   $aprogram dependence graph
610   $apath conditions
700   $aHammer$b Christian$4auth$0887149
906   $aBOOK
912   $a9910346922603321
996   $aInformation flow control for java : a comprehensive approach based on path conditions in dependence Graphs$93025967
997   $aUNINA