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

	Vinta: Verification with INTerpolation and Abstract iterpretation Arie Gurfinkel Software Engineering Institute Carnegie Mellon University DocID: 1xVXp - View Document
	IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, # 1 Swarm Verification Techniques Gerard J. Holzmann, Rajeev Joshi, and Alex Groce DocID: 1xVM2 - View Document
	Education Sharif University of Technology, Tehran, Iran BS in Computer Engineering - Software Engineering Grade Point Average: 18.29 out of 20 GPAKasra Edalat Nejad DocID: 1xVB5 - View Document
	Improving the Adoption of Software Engineering Practices Through Persuasive Interventions Von der Fakultät für Elektrotechnik und Informatik der Gottfried Wilhelm Leibniz Universität Hannover zur Erlangung des Grades DocID: 1xVuG - View Document
	Software Bug Localization with Markov Logic Sai Zhang Congle Zhang Department of Computer Science & Engineering DocID: 1xVks - View Document