<--- Back to Details
First PageDocument Content
Compiler optimizations / Computing / Program analysis / Abstract interpretation / Data-flow analysis / Abstraction / Static single assignment form / Graph / Bytecode / Register allocation / Algorithm / Academia
Date: 2016-06-05 23:38:28
Compiler optimizations
Computing
Program analysis
Abstract interpretation
Data-flow analysis
Abstraction
Static single assignment form
Graph
Bytecode
Register allocation
Algorithm
Academia

A posteriori taint-tracking for demonstrating non-interference in expressive low-level languages Peter Aldous University of Utah

Add to Reading List

Source URL: spw16.langsec.org

Download Document from Source Website

File Size: 228,83 KB

Share Document on Facebook

Similar Documents

Overview  Abstraction The Rest

Overview Abstraction The Rest

DocID: 1xW1V - View Document

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

DocID: 1xVQq - View Document

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

DocID: 1xVJt - View Document

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

DocID: 1xVFk - View Document