SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

First Page		Document Content
Date: 2011-06-23 09:19:29 Theoretical computer science Computing Software engineering Logic in computer science Automated theorem proving Static program analysis Termination analysis Rewriting KeY Automated reasoning Bytecode Christoph Walther		SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany Add to Reading List Source URL: www.dcs.bbk.ac.uk Download Document from Source Website File Size: 231,59 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