Effective blame for information-flow violations

Authors:
Dave King;Trent Jaeger;Somesh Jha;Sanjit A. Seshia
Affiliations:
The Pennyslvania State University, University Park, PA;The Pennyslvania State University, University Park, PA;University of Wisconsin, Madison, WI;University of California, Berkeley, CA
Venue:
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Year:
2008

Citing 23
Cited 4

Interprocedural slicing using dependence graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient generation of counterexamples and witnesses in symbolic model checking

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
JFlow: practical mostly-static information flow control

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A theory of type qualifiers

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Tractable constraints in finite semilattices

Science of Computer Programming
Certification of programs for secure information flow

Communications of the ACM
A lattice model of secure information flow

Communications of the ACM
Information flow inference for ML

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finding the source of type errors

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Tracking down software bugs using automatic anomaly detection

Proceedings of the 24th International Conference on Software Engineering
Efficient path conditions in dependence graphs

Proceedings of the 24th International Conference on Software Engineering
From symptom to cause: localizing errors in counterexample traces

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using CQUAL for Static Analysis of Authorization Hook Placement

Proceedings of the 11th USENIX Security Symposium
A static analyzer for large safety-critical software

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Program slicing

ICSE '81 Proceedings of the 5th international conference on Software engineering
Dynamic path conditions in dependence graphs

Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Refactoring programs to secure information flows

Proceedings of the 2006 workshop on Programming languages and analysis for security
Type inference and informative error reporting for secure information flow

Proceedings of the 44th annual Southeast regional conference
From Languages to Systems: Understanding Practical Application Development in Security-typed Languages

ACSAC '06 Proceedings of the 22nd Annual Computer Security Applications Conference
Finding user/kernel pointer bugs with type inference

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
SIF: enforcing confidentiality and integrity in web applications

SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Security-typed languages for implementation of cryptographic protocols: a case study

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security

Implicit Flows: Can't Live with `Em, Can't Live without `Em

ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Automating security mediation placement

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Security type error diagnosis for higher-order, polymorphic languages

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Toward general diagnosis of static errors

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Programs trusted with secure information should not release that information in ways contrary to system policy. However, when a program contains an illegal flow of information, current information-flow reporting techniques are inadequate for determining the cause of the error. Reasoning about information-flow errors can be difficult, as the flows involved can be quite subtle. We present a general model for information-flow blame that can explain the source of such security errors in code. This model is implemented by changing the information-flow verification procedure to: (1) generate supplementary information to reveal otherwise hidden program dependencies; (2) modify the constraint solver to construct a blame dependency graph; and (3) develop an explanation procedure that returns a complete and minimal error report. Our experiments show that information-flow errors can generally be explained and resolved by viewing only a small fraction of the total code.