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

	Automated Reasoning for EXplainable Artificial Intelligence Maria Paola Bonacina Dipartimento di Informatica Universit` a degli Studi di Verona DocID: 1xVwB - View Document
	Automated Reasoning for Explainable Artificial Intelligence∗ Maria Paola Bonacina1 Dipartimento di Informatica Universit` a degli Studi di Verona Strada Le Grazie 15 DocID: 1xVfb - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Self-Formalisation of Higher-Order Logic Semantics, Soundness, and a Verified Implementation Ramana Kumar · Rob Arthan · DocID: 1xV5B - View Document
	Automated Deduction for Verification Natarajan Shankar SRI International Automated deduction uses computation to perform symbolic logical reasoning. It has been a core technology for program verification from the very be DocID: 1xV0v - View Document
	arXiv:1805.03418v1 [cs.SC] 9 MayComputing an LLL-reduced basis of the orthogonal lattice Jingwei Chen Chongqing Key Lab of Automated Reasoning & Cognition, DocID: 1xU0M - View Document