000			01719naaaa2200301uu 4500
001			https://directory.doabooks.org/handle/20.500.12854/50219
005			20220220025403.0
020			_aKSP/1000012049
020			_a9783866443983
024	7		_a10.5445/KSP/1000012049 _cdoi
041	0		_aEnglish
042			_adc
100	1		_aHammer, Christian _4auth
245	1	0	_aInformation flow control for java : a comprehensive approach based on path conditions in dependence Graphs
260			_bKIT Scientific Publishing _c2009
300			_a1 electronic resource (221 p. p.)
506	0		_aOpen Access _2star _fUnrestricted online access
520			_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.
540			_aCreative Commons _fhttps://creativecommons.org/licenses/by-nc-nd/4.0/ _2cc _4https://creativecommons.org/licenses/by-nc-nd/4.0/
546			_aEnglish
653			_ainformation flow control
653			_asoftware security
653			_aprogram slicing
653			_aprogram dependence graph
653			_apath conditions
856	4	0	_awww.oapen.org _uhttps://www.ksp.kit.edu/9783866443983 _70 _zDOAB: download the publication
856	4	0	_awww.oapen.org _uhttps://directory.doabooks.org/handle/20.500.12854/50219 _70 _zDOAB: description of the publication
999			_c60685 _d60685