Department of Computer Science

Available Reports

2007-01

Fachgruppe Informatik
Jahresbericht 2006

2007-02

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, and Harald Zankl
SAT Solving for Termination Analysis with Polynomial Interpretations

• Abstract, BibTeX, Paper:    

2007-03

Jürgen Giesl, René Thiemann, Stephan Swiderski, and Peter Schneider-Kamp
Proving Termination by Bounded Increase

• Abstract, BibTeX, Paper:    

2007-04

Jan Buchholz, Eric Lee, Jonathan Klein, and Jan Borchers
coJIVE: A System to Support Collaborative Jazz Improvisation

• Abstract, BibTeX, Paper:    

2007-05

Uwe Naumann
On Optimal DAG Reversal

• Abstract, BibTeX, Paper:    

2007-06

Joost-Pieter Katoen, Thomas Noll, and Stefan Rieger
Verifying Concurrent List-Manipulating Programs by LTL Model Checking

• Abstract, BibTeX, Paper:    

2007-07

Alexander Nyßen, Horst Lichter
MeDUSA - MethoD for UML2-based Design of Embedded Software Applications

• Abstract, BibTeX, Paper:    

2007-08

Falk Salewski and Stefan Kowalewski
Achieving Highly Reliable Embedded Software: An empirical evaluation of different approaches

• Abstract, BibTeX, Paper:    

2007-09

Tina Kraußer, Heiko Mantel, and Henning Sudbrock
A Probabilistic Justification of the Combining Calculus under the Uniform Scheduler Assumption

• Abstract, BibTeX, Paper:    

2007-10

Martin Neuhäußer, Joost-Pieter Katoen
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes

• Abstract, BibTeX, Paper:    

2007-11

Klaus Wehrle (editor)
6. Fachgespräch Sensornetzwerke

• Abstract, BibTeX, Paper:    

2007-12

Uwe Naumann
An L-Attributed Grammar for Adjoint Code

• Abstract, BibTeX, Paper:    

2007-13

Uwe Naumann, Michael Maier, Jan Riehme, and Bruce Christianson
Second-Order Adjoints by Source Code Manipulation of Numerical Programs

• Abstract, BibTeX, Paper:    

2007-14

Jean Utke, Uwe Naumann, Mike Fagan, Nathan Tallent, Michelle Strout, Patrick Heimbach, Chris Hill, and Carl Wunsch
OpenAD/F: A Modular, Open-Source Tool for Automatic Differentiation of Fortran Codes

• Abstract, BibTeX, Paper:    

2007-15

Volker Stolz
Temporal assertions for sequential and concurrent programs

• Abstract, BibTeX, Paper:    

2007-16

Sadeq Ali Makram, Mesut Güneç, Martin Wenig, Alexander Zimmermann
Adaptive Channel Assignment to Support QoS and Load Balancing for Wireless Mesh Networks

• Abstract, BibTeX, Paper:    

2007-17

René Thiemann
The DP Framework for Proving Termination of Term Rewriting

• Abstract, BibTeX, Paper:    

2007-18

Uwe Naumann
Call Tree Reversal is NP-Complete

• Abstract, BibTeX, Paper:    

2007-19

Jan Riehme, Andrea Walther, Jörg Stiller, Uwe Naumann
Adjoints for Time-Dependent Optimal Control

• Abstract, BibTeX, Paper:    

2007-20

Joost-Pieter Katoen, Daniel Klink, Martin Leucker, and Verena Wolf
Three-Valued Abstraction for Probabilistic Systems

• Abstract, BibTeX, Paper:    

2007-21

Tingting Han, Joost-Pieter Katoen, and Alexandru Mereacre
Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains

• Abstract, BibTeX, Paper:    

2007-22

Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, and Berthold Vöcking
Uncoordinated Two-Sided Markets

• Abstract, BibTeX, Paper:    

Last modified: Thursday, 31-Mar-2016 19:22:32 MEST  /  TR-Admin

Disclaimer