Optimality and condensing of information flow through linear refinement

DOI10.1016/j.tcs.2007.05.004zbMath1143.68040OpenAlexW2036231928MaRDI QIDQ2464935

Fausto Spoto

Publication date: 18 December 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.004

zbMATH Keywords

static analysisabstract interpretationinformation flowlinear refinement

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• A logic for information flow analysis with an application to forward slicing of simple imperative programs
• Logical optimality of groundness analysis
• Information flow for Algol-like languages
• Abstract non-interference
• Graph-Based Algorithms for Boolean Function Manipulation
• Certification of programs for secure information flow
• Trust in the λ-calculus
• Systematic design of program transformation frameworks by abstract interpretation
• Making abstract domains condensing
• On flow-sensitive security types
• A logic for information flow in object-oriented programs
• Theoretical Aspects of Computing – ICTAC 2005
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• A per model of secure information flow in sequential programs

This page was built for publication: Optimality and condensing of information flow through linear refinement