Index of 2011
Department Of Computer Science
Technical Reports
Aachener Informatik-Berichte (AIB)

Available Reports

2011-01
Fachgruppe Informatik
Jahresbericht 2011
2011-02
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
2011-03
Lars Noschinski, Fabian Emmes, Jürgen Giesl
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems
2011-04
Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll
A Local Greibach Normal Form for Hyperedge Replacement Grammars
2011-06
Johannes Lotz, Klaus Leppkes, and Uwe Naumann
dco/c++ - Derivative Code by Overloading in C++
2011-07
Shahar Maoz, Jan Oliver Ringert, Bernhard Rumpe
An Operational Semantics for Activity Diagrams using SMV
2011-08
Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
2011-09
Markus Beckers, Johannes Lotz, Viktor Mosenkis, Uwe Naumann (Editors)
Fifth SIAM Workshop on Combinatorial Scientific Computing
2011-10
Markus Beckers, Viktor Mosenkis, Michael Maier, Uwe Naumann
Adjoint Subgradient Calculation for McCormick Relaxations
2011-11
Nils Jansen, Erika Ábrahám, Jens Katelaan, Ralf Wimmer, Joost-Pieter Katoen, Bernd Becker
Hierarchical Counterexamples for Discrete-Time Markov Chains
2011-12
Ingo Felscher, Wolfgang Thomas
On Compositional Failure Detection in Structured Transition Systems
2011-13
Michael Förster, Uwe Naumann, Jean Utke
Toward Adjoint OpenMP
2011-14
Daniel Neider, Roman Rabinovich, Martin Zimmermann
Solving Muller Games via Safety Games
2011-16
Niloofar Safiran, Uwe Naumann
Toward Adjoint OpenFOAM
2011-17
Carsten Fuhs
SAT Encodings: From Constraint-Based Termination Analysis to Circuit Synthesis
2011-18
Kamal Barakat
Introducing Timers to pi-Calculus
2011-19
Marc Brockschmidt, Thomas Ströder, Carsten Otto, Jürgen Giesl
Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode
2011-24
Callum Corbett, Uwe Naumann, Alexander Mitsos
Demonstration of a Branch-and-Bound Algorithm for Global Optimization using McCormick Relaxations
2011-25
Callum Corbett, Michael Maier, Markus Beckers, Uwe Naumann, Amin Ghobeity, Alexander Mitsos
Compiler-Generated Subgradient Code for McCormick Relaxations
2011-26
Hongfei Fu
The Complexity of Deciding a Behavioural Pseudometric on Probabilistic Automata