First Page | Document Content | |
---|---|---|
Date: 2011-06-23 09:19:29Theoretical 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, GermanyAdd to Reading ListSource URL: www.dcs.bbk.ac.ukDownload Document from Source WebsiteFile Size: 231,59 KBShare Document on Facebook |