SAT Instances for Termination Analysis with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

First Page		Document Content
Date: 2009-06-09 05:12:21 Theoretical computer science Logic in computer science Formal languages Hans Zantema International Conference on Rewriting Techniques and Applications Rewriting Termination analysis Divergence NP-completeness		SAT Instances for Termination Analysis 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: 150,85 KB Share Document on Facebook

	Termination Analysis of Programs with Bitvector Arithmetic by Symbolic Execution J¨ urgen Giesl LuFG Informatik 2, RWTH Aachen University, Germany DocID: 1vhFO - View Document
	Internship report Laboratoire d’Informatique Fondamentale de Lille Lucas Seguinot August 23, 2013 Improvement of a termination analysis DocID: 1uAlb - View Document
	Termination Analysis for GPU KernelsI Jeroen Ketema, Alastair F. Donaldson Department of Computing, Imperial College London London, United Kingdom Abstract DocID: 1tsT6 - View Document
	Aachen Department of Computer Science Technical Report Dependency Triples for Improving Termination Analysis of Logic DocID: 1t7al - View Document
	Aachen Department of Computer Science Technical Report Dependency Triples for Improving Termination Analysis of Logic DocID: 1t5Az - View Document