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

First Page		Document Content
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

	A Specification of Java Loading and Bytecode Verification Allen Goldberg Kestrel Institute 3260 Hillview Av. Palo Alto, CA 94304 DocID: 1xUOd - View Document
	Aachen Department of Computer Science Technical Report Modular Termination Proofs of Recursive Java Bytecode Programs DocID: 1t6jP - View Document
	Bytecodes and bytecode interpretation © 2015 Oracle, Mario Wolczko Interpretation technique #2: DocID: 1t2XO - View Document
	ActionScript Bytecode Verification With Co-Logic Programming ∗ Brian W. DeVries Gopal Gupta Kevin W. Hamlen DocID: 1sYRr - View Document
	Assignment 4: Writing a Feeny Bytecode Compiler Patrick S. Li September 17, DocID: 1sWIi - View Document