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

	Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007 DocID: 1xVOl - View Document
	Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008 DocID: 1uHka - View Document
	αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu DocID: 1ux8H - View Document
	23rd Annual IEEE Symposium on Logic in Computer Science Winning regions of higher-order pushdown games∗ A. Carayol† M. Hague‡ DocID: 1uwn4 - View Document
	Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK DocID: 1ud4n - View Document