Download Information Flow Control for Java: A Comprehensive Approach by Christian Hammer PDF

By Christian Hammer

Info move keep an eye on (IFC) is a method to claim the protection of a given software with recognize to a given protection coverage. The classical coverage noninterference calls for that public output of a application is probably not prompted from mystery enter. This paintings leverages a method referred to as application cutting, that's heavily hooked up to IFC and provides many dimensions for bettering research precision, the main strong are direction stipulations. Our assessment exhibits scalability with a low annotation burden.

Show description

Read or Download Information Flow Control for Java: A Comprehensive Approach Based on Path Conditions in Dependence Graphs PDF

Best programming: programming languages books

Webseitenlayout mit CSS

Keine Angst vor CSS! Auch in Zeiten von Joomla! und WordPress sorgen Cascading kind Sheets fur unverwechselbares Webseitendesign. Anhand von 23 Praxisbeispielen zeigt der erfahrene Webentwickler, Dozent und coach Clemens Gull, wie Sie CSS gezielt einsetzen und welche Designeffekte Sie damit erzielen konnen.

Web-Programmierung: Softwareentwicklung mit Internet-Technologien — Grundlagen, Auswahl, Einsatz — XHTML & HTML, CSS, XML, JavaScript, VBScript, PHP, ASP, Java

Endlich zuverlässiges Wissen zur Entwicklung von Internet-Anwendungen - alles in einem Buch. Das Buch eignet sich sowohl für den Einsatz in der Praxis wie auch als Lehrbuch. Orientierung für die Software-Entwicklung im net und Intranet kompakt und verständlich: Ab sofort müssen Sie das Wissen, das Sie benötigen, nicht mehr aus vielen Büchern zusammensuchen.

Additional info for Information Flow Control for Java: A Comprehensive Approach Based on Path Conditions in Dependence Graphs

Sample text

31 CHAPTER 2. 1 Slicing in the PDG Later, Ottenstein and Ottenstein [OO84] presented an alternative way of slicing: They reformulate slicing as a reachability analysis in a program representation called Program Dependence Graph (PDG) as defined by Ferrante et al. [FOW87]. In the PDG, slicing can be done in time linear to the number of statements, with a single backward-traversal of dependences between these statements (defined later). e. the first property of a slice may be violated. The notion of a static slice with a PDG is rather the set of statements that may directly or indirectly affect the slicing criterion.

Object-sensitivity Object-sensitive analyses2 take different ’host’ objects for the same field (attribute) into account, while object-insensitive analyses merge the information for a given field over all objects of the same class (and its subclasses). Virtual method resolution Most inter-procedural analyses are based on a pre-computed call graph3 to approximate virtual method resolution. Typical analysis techniques for determining such a graph are class hierarchy analysis (CHA) [DGC95], rapid type analysis RTA [BS96] and its extension XTA [TP00].

G. static variables in Java) receive special treatment: They are handled like additional read-write-parameters of that procedure [HRB90] and are thus ignored in the subsequent discussions. The SDG consists of all the PDGs involved in the program connected by interprocedural edges, which are inserted in accordance to the invocation edges of the call graph: An actual-in parameter node is connected to its corresponding formal-in node with an parameter-in edge (pi), formal-out nodes to their corresponding actual-out nodes with an parameter-out edge (po).

Download PDF sample

Rated 4.46 of 5 – based on 35 votes