No. Title Author Year
1 Inferring Lower Bounds for Runtime Complexity Frohn, Florian et al. 2015
2 Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting Brockschmidt, Marc et al. 2011
3 09411 Abstracts Collection -- Interaction versus Automation: The two Faces of Deduction Ball, Thomas et al. 2010
4 09411 Executive Summary -- Interaction versus Automation: The two Faces of Deductions Ball, Thomas et al. 2010
5 Automated Termination Analysis of Java Bytecode by Term Rewriting Otto, Carsten et al. 2010
6 Inductive Theorem Proving meets Dependency Pairs Swiderski, Stephan et al. 2010
7 Termination of Integer Term Rewriting Fuhs, Carsten et al. 2010
8 07401 Abstracts Collection -- Deduction and Decision Procedures Baader, Franz et al. 2007
9 07401 Executive Summary -- Deduction and Decision Procedures Baader, Franz et al. 2007
10 Decision Procedures for Loop Detection Thiemann, René et al. 2007
Current Page :
Number of result pages: 2
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint Published by LZI