RWTH Informatik
Department Of Computer Science
Technical Reports
Aachener Informatik-Berichte (AIB)

Available Reports

2021-10
David Thönnessen
Hardware-in-the-Loop Testing of Industrial Automation Systems Using PLC Languages
2021-07
Martin Schweigler
Ground Surface Pattern Recognition for Enhanced Navigation
2021-06
Manfred Nagl
Characterization of Shallow and Deep Reuse
2021-05
Manfred Nagl
Process Interaction Diagrams are more than Process Chains or Transport Networks
2021-04
Manfred Nagl
Embedded Systems: Simple Rules to Improve Adaptability
2021-03
Manfred Nagl
Sequences of Software Architectures
2021-02
Manfred Nagl
An Integrative Approach for Software Architectures
2021-01
Mathias Obster
Unterstützung der SPS-Programmierung durch Statische Analyse während der Programmeingabe
2020-05
Imke Drave, Oliver Kautz, Judith Michael, and Bernhard Rumpe
Pre-Study on the Usefulness of Difference Operators for Modeling Languages in Software Development
2020-04
Gereon Kremer
Cylindrical Algebraic Decomposition for Nonlinear Arithmetic Problems
2020-03
John F. Schommer
Adaptierung des Zeitverhaltens nicht-echtzeitfähiger Software für den Einsatz in zeitheterogenen Netzwerken
2020-02
Jens Christoph Bürger, Hendrik Kausch, Deni Raco, Jan Oliver Ringert, Bernhard Rumpe, Sebastian Stüber, and Marc Wiartalla
Towards an Isabelle Theory for distributed, interactive systems - the untimed case
2019-05
Florian Göbe
Runtime Supervision of PLC Programs Using Discrete-Event Systems
2019-03
Sebastian Patrick Grobosch
Formale Methoden für die Entwicklung von eingebetteter Software in kleinen und mittleren Unternehmen
2019-02
Tim Felix Lange
IC3 Software Model Checking
2018-06
Christian Hensel
The Probabilistic Model Checker Storm - Symbolic Methods for Probabilistic Model Checking
2018-05
Matthias Terber
Real-World Deployment and Evaluation of Synchronous Programming in Reactive Embedded Systems
2018-04
Andreas Ganser
Operation-Based Model Recommenders
2018-03
Igor Kalkov
A Real-time Capable, Open-Source-based Platform for Off-the-Shelf Embedded Devices
2018-02
Jens Deussen, Viktor Mosenkis, and Uwe Naumann
Fast Estimates of Greeks from American Options: A Case Study in Adjoint Algorithmic Differentiation
2017-09
Muhammad Hamad Alizai, Jan Beutel, Jó Ágila Bitsch, Olaf Landsiedel, Luca Mottola, Przemyslaw Pawelczak, Klaus Wehrle, and Kasim Sinan Yildirim
Proc. IDEA League Doctoral School on Transiently Powered Computing
2017-08
Thomas Gerlitz
Incremental Integration and Static Analysis of Model-Based Automotive Software Artifacts
2017-07
Klaus Leppkes, Johannes Lotz, Uwe Naumann, and Jacques du Toit
Meta Adjoint Programming in C++
2017-06
Oliver Kautz, Shahar Maoz, Jan Oliver Ringert, and Bernhard Rumpe
CD2Alloy: A Translation of Class Diagrams to Alloy
2017-05
Matthias Naaf, Florian Frohn, Marc Brockschmidt, Carsten Fuhs, and Jürgen Giesl
Complexity Analysis for Term Rewriting by Integer Transition Systems
2017-04
Florian Frohn and Jürgen Giesl
Complexity Analysis for Java with AProVE
2017-02
Florian Frohn and Jürgen Giesl
Analyzing Runtime Complexity via Innermost Runtime Complexity
2017-01
Fachgruppe Informatik
Annual Report 2017
2016-10
Stefan Wüller, Ulrike Meyer, and Susanne Wetzel
Towards Privacy-Preserving Multi-Party Bartering
2016-09
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp, and Cornelius Aschermann
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic
2016-08
Uwe Naumann, Klaus Leppkes, and Johannes Lotz
dco/c++: Derivative Code by Overloading in C++: Introduction and Summary of Features
2016-07
Sebastian Biallas
Verification of Programmable Logic Controller Code using Model Checking and Static Analysis
2016-06
Martin Henze, René Hummen, Roman Matzutt, and Klaus Wehrle
The SensorCloud Protocol: Securely Outsourcing Sensor Data to the Cloud
2016-05
Mathias Pelka, Grigori Goronzy, Jó Ágila Bitsch, Horst Hellbrück, and Klaus Wehrle (Editors)
Proceedings of the 2nd KuVS Expert Talk on Localization
2016-04
Jera Hensel, Jürgen Giesl, Florian Frohn, and Thomas Ströder
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution
2016-03
Florian Frohn, Matthias Naaf, Jera Hensel, Marc Brockschmidt, and Jürgen Giesl
Lower Runtime Bounds for Integer Programs
2016-02
Ibtissem Ben Makhlouf
Comparative Evaluation and Improvement of Computational Approaches to Reachability Analysis of Linear Hybrid Systems
2016-01
Fachgruppe Informatik
Annual Report 2016
2015-14
Niloofar Safiran and Uwe Naumann
Symbolic vs. Algorithmic Differentiation of GSL Integration Routines
2015-13
Andreas Polzer
Ansatz zur variantenreichen und modellbasierten Entwicklung von eingebetteten Systemen unter Berücksichtigung regelungs- und softwaretechnischer Anforderungen
2015-12
Christoph Matheja, Christina Jansen, and Thomas Noll
Tree-like Grammars and Separation Logic
2015-11
Stefan Wüller, Marián Kühnel, and Ulrike Meyer
Information Hiding in the Public RSA Modulus
2015-09
Xin Chen
Reachability Analysis of Non-Linear Hybrid Systems Using Taylor Models
2015-08
Mathias Pelka, Jó Ágila Bitsch, Horst Hellbrück, and Klaus Wehrle (Editors)
Proceedings of the 1st KuVS Expert Talk on Localization
2015-07
Hilal Diab
Experimental Validation and Mathematical Analysis of Cooperative Vehicles in a Platoon
2015-06
Thomas Ströder and Wolfgang Thomas (Editors)
Proceedings of the Young Researchers' Conference "Frontiers of Formal Methods"
2015-05
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, and Thomas Ströder
Inferring Lower Bounds for Runtime Complexity
2015-02
Dominik Franke
Testing Life Cycle-related Properties of Mobile Applications
2015-01
Fachgruppe Informatik
Annual Report 2015
2014-16
Hongfei Fu
Verifying Probabilistic Systems: New Algorithms and Complexity Results
2014-15
Dominique Gückel
Synthesis of State Space Generators for Model Checking Microcontroller Code
2014-14
Florian Schmidt, Matteo Ceriotti, Niklas Hauser, and Klaus Wehrle
HotBox: Testing Temperature Effects in Sensor Networks
2014-09
Thomas Ströder and Terrance Swift (Editors)
Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014
2014-08
Christina Jansen, Florian Göbe, and Thomas Noll
Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs
2014-07
Niloofar Safiran, Johannes Lotz, and Uwe Naumann
Algorithmic Differentiation of Numerical Methods: Second-Order Tangent and Adjoint Solvers for Systems of Parametrized Nonlinear Equations
2014-06
Esther Horbert, Germán Martín García, Simone Frintrop, and Bastian Leibe
Sequence Level Salient Object Proposals for Generic Object Detection in Video
2014-05
Thomas Ströder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel, and Peter Schneider-Kamp
Automated Termination Analysis for Programs with Pointer Arithmetic
2014-04
Namit Chaturvedi
Languages of Infinite Traces and Deterministic Asynchronous Automata
2014-03
Uwe Naumann, Klaus Leppkes, and Johannes Lotz
dco/c++ User Guide
2014-02
Daniel Merschen
Integration und Analyse von Artefakten in der modellbasierten Entwicklung eingebetteter Software
2014-01
Fachgruppe Informatik
Annual Report 2014
2013-20
Jacob Palczynski
Time-Continuous Behaviour Comparison Based on Abstract Models
2013-19
Florian Schmidt, David Orlea, and Klaus Wehrle
Support for error tolerance in the Real-Time Transport Protocol
2013-16
Carsten Otto
Java Program Analysis by Symbolic Execution
2013-14
Jörg Brauer
Automatic Abstraction for Bit-Vectors using Decision Procedures
2013-13
Michael Eggert, Roger Häußling, Martin Henze, Lars Hermerschmidt, René Hummen, Daniel Kerpen, Antonio Navarro Pérez, Bernhard Rumpe, Dirk Thißen, and Klaus Wehrle
SensorCloud: Towards the Interdisciplinary Development of a Trustworthy Platform for Globally Interconnected Sensors and Actuators
2013-12
Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, and Jürgen Giesl
Alternating Runtime and Size Complexity Analysis of Integer Programs
2013-10
Joost-Pieter Katoen, Thomas Noll, Thomas Santen, Dirk Seifert, and Hao Wu
Performance Analysis of Computing Servers using Stochastic Petri Nets and Markov Automata
2013-08
Sebastian Junges, Ulrich Loup, Florian Corzilius, and Erika Ábrahám
On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers
2013-07
André Stollenwerk
Ein modellbasiertes Sicherheitskonzept für die extrakorporale Lungenunterstützung
2013-06
Marc Brockschmidt, Byron Cook, and Carsten Fuhs
Better termination proving through cooperation
2013-05
Andreas Rausch and Marc Sihling
Software & Systems Engineering Essentials 2013
2013-04
Max Sagebaum, Nicolas R. Gauger, Uwe Naumann, Johannes Lotz, and Klaus Leppkes
Algorithmic Differentiation of a Complex C++ Code with Underlying Libraries
2013-03
Markus Towara and Uwe Naumann
A Discrete Adjoint Model for OpenFOAM
2013-02
Michael Reke
Modellbasierte Entwicklung automobiler Steuerungssysteme in Klein- und mittelständischen Unternehmen
2013-01
Fachgruppe Informatik
Annual Report 2013
2012-17
Viet Yen Nguyen
Trustworthy Spacecraft Design Using Formal Methods
2012-16
Georg Neugebauer and Ulrike Meyer
SMC-MuSe: A Framework for Secure Multi-Party Computation on MultiSets
2012-15
Uwe Naumann, Johannes Lotz, Klaus Leppkes, and Markus Towara
Algorithmic Differentiation of Numerical Methods: Tangent-Linear and Adjoint Solvers for Systems of Nonlinear Equations
2012-12
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes, and Carsten Fuhs
Symbolic Evaluation Graphs and Term Rewriting --- A General Methodology for Analyzing Logic Programs
2012-10
Uwe Naumann and Johannes Lotz
Algorithmic Differentiation of Numerical Methods: Tangent-Linear and Adjoint Direct Solvers for Systems of Linear Equations
2012-09
Dennis Guck, Tingting Han, Joost-Pieter Katoen, and Martin R. Neuhäußer
Quantitative Timed Analysis of Interactive Markov Chains
2012-08
Hongfei Fu
Computing Game Metrics on Markov Decision Processes
2012-07
André Egners, Björn Marschollek, and Ulrike Meyer
Hackers in Your Pocket: A Survey of Smartphone Security Across Platforms
2012-06
Marc Brockschmidt, Richard Musiol, Carsten Otto, and Jürgen Giesl
Automated Termination Proofs for Java Programs with Cyclic Data
2012-05
Thomas Ströder, Fabian Emmes, Jürgen Giesl, Peter Schneider-Kamp, and Carsten Fuhs
Automated Complexity Analysis for Prolog by Term Rewriting
2012-04
Marcus Gelderie
Strategy Machines and their Complexity
2012-03
Arne Haber, Jan Oliver Ringert, and Bernhard Rumpe
MontiArc - Architectural Modeling of Interactive Distributed and Cyber-Physical Systems
2012-02
Thomas Heer
Controlling Development Processes
2012-01
Fachgruppe Informatik
Annual Report 2012
2011-26
Hongfei Fu
The Complexity of Deciding a Behavioural Pseudometric on Probabilistic Automata
2011-25
Callum Corbett, Michael Maier, Markus Beckers, Uwe Naumann, Amin Ghobeity, and Alexander Mitsos
Compiler-Generated Subgradient Code for McCormick Relaxations
2011-24
Callum Corbett, Uwe Naumann, and Alexander Mitsos
Demonstration of a Branch-and-Bound Algorithm for Global Optimization using McCormick Relaxations
2011-19
Marc Brockschmidt, Thomas Ströder, Carsten Otto, and Jürgen Giesl
Automated Detection of Non-Termination and NullPointerExceptions for Java Bytecode
2011-18
Kamal Barakat
Introducing Timers to pi-Calculus
2011-17
Carsten Fuhs
SAT Encodings: From Constraint-Based Termination Analysis to Circuit Synthesis
2011-16
Niloofar Safiran and Uwe Naumann
Toward Adjoint OpenFOAM
2011-14
Daniel Neider, Roman Rabinovich, and Martin Zimmermann
Solving Muller Games via Safety Games
2011-13
Michael Förster, Uwe Naumann, and Jean Utke
Toward Adjoint OpenMP
2011-12
Ingo Felscher and Wolfgang Thomas
On Compositional Failure Detection in Structured Transition Systems
2011-11
Nils Jansen, Erika Ábrahám, Jens Katelaan, Ralf Wimmer, Joost-Pieter Katoen, and Bernd Becker
Hierarchical Counterexamples for Discrete-Time Markov Chains
2011-10
Markus Beckers, Viktor Mosenkis, Michael Maier, and Uwe Naumann
Adjoint Subgradient Calculation for McCormick Relaxations
2011-09
Markus Beckers, Johannes Lotz, Viktor Mosenkis, and Uwe Naumann (Editors)
Fifth SIAM Workshop on Combinatorial Scientific Computing
2011-08
Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, and Carsten Fuhs
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
2011-07
Shahar Maoz, Jan Oliver Ringert, and Bernhard Rumpe
An Operational Semantics for Activity Diagrams using SMV
2011-06
Johannes Lotz, Klaus Leppkes, and Uwe Naumann
dco/c++ - Derivative Code by Overloading in C++
2011-04
Christina Jansen, Jonathan Heinen, Joost-Pieter Katoen, and Thomas Noll
A Local Greibach Normal Form for Hyperedge Replacement Grammars
2011-03
Lars Noschinski, Fabian Emmes, and Jürgen Giesl
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems
2011-02
Marc Brockschmidt, Carsten Otto, and Jürgen Giesl
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
2011-01
Fachgruppe Informatik
Jahresbericht 2011
2010-20
Wladimir Fridman, Christof Löding, and Martin Zimmermann
Degrees of Lookahead in Context-free Infinite Games
2010-19
Felix Reidl
Experimental Evaluation of an Independent Set Algorithm
2010-18
Ibrahim Armaç
Personalisierte eHomes: Mobilität, Privatsphäre und Sicherheit
2010-17
Hans Grönniger
Systemmodell-basierte Definition objektbasierter Modellierungssprachen mit semantischen Variationspunkten
2010-16
Christian Berger
Automating Acceptance Tests for Sensor- and Actuator-based Systems on the Example of Autonomous Vehicles
2010-15
Marc Brockschmidt, Carsten Otto, Christian von Essen, and Jürgen Giesl
Termination Graphs for Java Bytecode
2010-14
Michael Codish, Carsten Fuhs, Jürgen Giesl, and Peter Schneider-Kamp
Lazy Abstraction for Size-Change Termination
2010-13
Ashraf Armoush
Design Patterns for Safety-Critical Embedded Systems
2010-12
Thomas Ströder, Peter Schneider-Kamp, and Jürgen Giesl
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
2010-11
Martin Zimmermann
Parametric LTL Games
2010-10
Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, and René Thiemann
Automated Termination Analysis for Logic Programs with Cut
2010-09
George B. Mertzios and Shmuel Zaks
The Structure of the Intersection of Tolerance and Cocomparability Graphs
2010-08
Carsten Otto, Marc Brockschmidt, Christian von Essen, and Jürgen Giesl
Automated Termination Analysis of Java Bytecode by Term Rewriting
2010-07
George B. Mertzios
A New Intersection Model for Multitolerance Graphs, Hierarchy, and Efficient Algorithms
2010-06
Taolue Chen, Tingting Han, Joost-Pieter Katoen, and Alexandru Mereacre
Computing maximum reachability probabilities in Markovian timed automata
2010-05
Daniel Retkowitz
Softwareunterstützung für adaptive eHome-Systeme
2010-04
René Wörzberger
Management dynamischer Geschäftsprozesse auf Basis statischer Prozessmanagementsysteme
2010-03
Holger Krahn
MontiCore: Agile Entwicklung von domänenspezifischen Sprachen im Software-Engineering
2010-02
Daniel Neider and Christof Löding
Learning Visibly One-Counter Automata in Polynomial Time
2010-01
Fachgruppe Informatik
Jahresbericht 2010
2009-18
Paul Hänsch, Michaela Slaats, and Wolfgang Thomas
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
2009-17
Carsten Kern
Learning Communicating and Nondeterministic Automata
2009-16
George B. Mertzios and Derek G. Corneil
Vertex Splitting and the Recognition of Trapezoid Graphs
2009-15
Joost-Pieter Katoen, Daniel Klink, and Martin Neuhäußer
Compositional Abstraction for Stochastic Systems
2009-14
Ralf Huuck, Gerwin Klein, and Bastian Schlich (eds.)
Doctoral Symposium on Systems Software Verification (DS SSV'09)
2009-13
Martin Zimmermann
Time-optimal Winning Strategies for Poset Games
2009-12
Martin Neuhäußer and Lijun Zhang
Time-Bounded Reachability in Continuous-Time Markov Decision Processes
2009-11
Kyriaki Ioannidou, George B. Mertzios, and Stavros D. Nikolopoulos
The Longest Path Problem is Polynomial on Interval Graphs
2009-10
Felix Reidl and Fernando Sánchez Villaamil
Automatic Verification of the Correctness of the Upper Bound of a Maximum Independent Set Algorithm
2009-09
Michael Nett
Implementation of an Automated Proof for an Algorithm Solving the Maximum Independent Set Problem
2009-08
Joachim Kneis and Alexander Langer
Satellites and Mirrors for Solving Independent Set on Sparse Graphs
2009-07
Joachim Kneis, Alexander Langer, and Peter Rossmanith
Derandomizing Non-uniform Color-Coding I
2009-06
George B. Mertzios, Ignasi Sau, and Shmuel Zaks
The Recognition of Tolerance and Bounded Tolerance Graphs is NP-complete
2009-05
George B. Mertzios, Ignasi Sau, and Shmuel Zaks
A New Intersection Model and Improved Algorithms for Tolerance Graphs
2009-03
Alexander Nyßen
Model-Based Construction of Embedded & Real-Time Software - A Methodology for Small Devices
2009-02
Taolue Chen, Tingting Han, Joost-Pieter Katoen, and Alexandru Mereacre
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
2009-01
Fachgruppe Informatik
Jahresbericht 2009
2008-19
Dirk Wilking
Empirical Studies for the Application of Agile Methods to Embedded Systems
2008-18
Falk Salewski
Empirical Evaluations of Safety-Critical Embedded Systems
2008-17
Peter Schneider-Kamp
Static Termination Analysis for Prolog using Term Rewriting and SAT Solving
2008-16
Hendrik vom Lehn, Elias Weingärtner, and Klaus Wehrle
Comparing recent network simulators: A performance evaluation study
2008-15
Joachim Kneis, Alexander Langer, and Peter Rossmanith
A New Algorithm for Finding Trees with Many Leaves
2008-14
Bastian Schlich
Model Checking of Software for Microcontrollers
2008-13
Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, and René Thiemann
Improving Context-Sensitive Dependency Pairs
2008-12
Joost-Pieter Katoen, Daniel Klink, Martin Leucker, and Verena Wolf
Abstraction for stochastic systems by Erlang's method of stages
2008-11
George B. Mertzios
Fast Convergence of Routing Games with Splittable Flows
2008-10
George B. Mertzios and Walter Unger
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
2008-09
George B. Mertzios and Walter Unger
An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs
2008-08
George B. Mertzios and Stavros D. Nikolopoulos
The λ-cluster Problem on Parameterized Interval Graphs
This report is no longer available.
2008-07
Alexander Nyßen and Horst Lichter
The MeDUSA Reference Manual, Second Edition
2008-06
Uwe Naumann, Laurent Hascoet, Chris Hill, Paul Hovland, Jan Riehme, and Jean Utke
A Framework for Proving Correctness of Adjoint Message Passing Programs
2008-05
Frank G. Radmacher
An Automata Theoretic Approach to the Theory of Rational Tree Relations
2008-04
Uwe Naumann and Jan Riehme
Sensitivity Analysis in Sisyphe with the AD-Enabled NAGWare Fortran Compiler
2008-03
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, and Harald Zankl
Maximal Termination
2008-02
Henrik Bohnenkamp and Marielle Stoelinga
Quantitative Testing
2008-01
Fachgruppe Informatik
Jahresbericht 2007/2008
2007-22
Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, and Berthold Vöcking
Uncoordinated Two-Sided Markets
2007-21
Tingting Han, Joost-Pieter Katoen, and Alexandru Mereacre
Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
2007-20
Joost-Pieter Katoen, Daniel Klink, Martin Leucker, and Verena Wolf
Three-Valued Abstraction for Probabilistic Systems
2007-19
Jan Riehme, Andrea Walther, Jörg Stiller, and Uwe Naumann
Adjoints for Time-Dependent Optimal Control
2007-18
Uwe Naumann
Call Tree Reversal is NP-Complete
2007-17
René Thiemann
The DP Framework for Proving Termination of Term Rewriting
2007-16
Sadeq Ali Makram, Mesut Güneç, Martin Wenig, and Alexander Zimmermann
Adaptive Channel Assignment to Support QoS and Load Balancing for Wireless Mesh Networks
2007-15
Volker Stolz
Temporal assertions for sequential and concurrent programs
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
2007-13
Uwe Naumann, Michael Maier, Jan Riehme, and Bruce Christianson
Second-Order Adjoints by Source Code Manipulation of Numerical Programs
2007-12
Uwe Naumann
An L-Attributed Grammar for Adjoint Code
2007-11
Klaus Wehrle (editor)
6. Fachgespräch Sensornetzwerke
2007-10
Martin Neuhäußer and Joost-Pieter Katoen
Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
2007-09
Tina Kraußer, Heiko Mantel, and Henning Sudbrock
A Probabilistic Justification of the Combining Calculus under the Uniform Scheduler Assumption
2007-08
Falk Salewski and Stefan Kowalewski
Achieving Highly Reliable Embedded Software: An empirical evaluation of different approaches
2007-07
Alexander Nyßen, and Horst Lichter
MeDUSA - MethoD for UML2-based Design of Embedded Software Applications
2007-06
Joost-Pieter Katoen, Thomas Noll, and Stefan Rieger
Verifying Concurrent List-Manipulating Programs by LTL Model Checking
2007-05
Uwe Naumann
On Optimal DAG Reversal
2007-04
Jan Buchholz, Eric Lee, Jonathan Klein, and Jan Borchers
coJIVE: A System to Support Collaborative Jazz Improvisation
2007-03
Jürgen Giesl, René Thiemann, Stephan Swiderski, and Peter Schneider-Kamp
Proving Termination by Bounded Increase
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
2007-01
Fachgruppe Informatik
Jahresbericht 2006
2006-17
Eric Lee, Henning Kiel, and Jan Borchers
Scrolling Through Time: Improving Interfaces for Searching and Navigating Continuous Audio Timelines
2006-16
Rafael Ballagas and Jan Borchers
Selexels: a Conceptual Framework for Pointing Devices with Low Expressiveness
2006-15
Sebastian Ullrich, Jakob T. Valvoda, and Torsten Kuhlen
Utilizing optical sensors from mice for new input devices
2006-14
Danilo Beuche, Andreas Birk, Heinrich Dreier, Andreas Fleischmann, Heidi Galle, Gerald Heller, Dirk Janzen, Isabel John, Ramin Tavakoli Kolagari, Thomas von der Maßen, and Andreas Wolfram
Report of the GI Work Group "Requirements Management Tools for Product Line Engineering"
2006-13
Wong Karianto and Christof Löding
Unranked Tree Automata with Sibling Equalities and Disequalities
2006-12
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, and Martin Leucker
Replaying Play in and Play out: Synthesis of Design Models from Scenarios by Learning
2006-11
Bastian Schlich, Michael Rohrbach, Michael Weber, and Stefan Kowalewski
Model Checking Software for Microcontrollers
2006-10
Mesut Günes, Alexander Zimmermann, Martin Wenig, Jan Ritzerfeld, and Ulrich Meis
From Simulations to Testbeds - Architecture of the Hybrid MCG-Mesh Testbed
2006-09
Tingting Han and Joost-Pieter Katoen
Counterexamples in Probabilistic Model Checking
2006-08
Uwe Naumann and Yuxiao Hu
Optimal Vertex Elimination in Single-Expression-Use Graphs
2006-07
Thomas Colcombet and Christof Löding
Transforming structures by set interpretations
2006-06
Joachim Kneis, Daniel Mölle, Stefan Richter, and Peter Rossmanith
Divide-and-Color
2006-05
Uwe Naumann, Jean Utke, Patrick Heimbach, Chris Hill, Derya Ozyurt, Carl Wunsch, Mike Fagan, Nathan Tallent, and Michelle Strout
Adjoint Code by Source Transformation with OpenAD/F
2006-04
Ebadollah Varnik, Uwe Naumann, and Andrew Lyons
Toward Low Static Memory Jacobian Accumulation
2006-03
Michael Maier and Uwe Naumann
Intraprocedural Adjoint Code Generated by the Differentiation-Enabled NAGWare Fortran Compiler
2006-02
Michael Weber
Parallel Algorithms for Verification of Large Systems
2006-01
Fachgruppe Informatik
Jahresbericht 2005
2005-24
Alexander Becher, Zinaida Benenson, and Maximillian Dornseif
Tampering with Motes: Real-World Physical Attacks on Wireless Sensor Networks
2005-23
Heiner Ackermann, Alantha Newman, Heiko Röglin, and Berthold Vöcking
Decision Making Based on Approximate and Smoothed Pareto Curves
2005-22
Felix Freiling, Maurice Herlihy, and Lucia Draque Penso
Optimal Randomized Fair Exchange with Secret Shared Coins
2005-21
Thomas Noll and Stefan Rieger
Optimization of Straight-Line Code Revisited
2005-20
Felix C. Freiling and Martin Mink
Bericht über den Workshop zur Ausbildung im Bereich IT-Sicherheit Hochschulausbildung, berufliche Weiterbildung, Zertifizierung von Ausbildungsangeboten am 11. und 12. August 2005 in Köln organisiert von RWTH Aachen in Kooperation mit BITKOM, BSI, DLR und Gesellschaft fuer Informatik (GI) e.V.
2005-19
Uwe Naumann and Andre Vehreschild
Tangent-Linear Code by Augmented LL-Parsers
2005-18
Thomas von der Maßen, Klaus Müller, John MacGregor, Eva Geisberger, Jörg Dörr, Frank Houdek, Harbhajan Singh, Holger Wußmann, Hans-Veit Bacher, and Barbara Paech
Einsatz von Features im Software-Entwicklungsprozess - Abschlußbericht des GI-Arbeitskreises "Features"
2005-17
Uwe Naumann
Syntax-directed Derivative Code (Part II: Intraprocedural Adjoint Code)
2005-16
Uwe Naumann
Syntax-Directed Derivative Code (Part I: Tangent-Linear Code)
2005-15
Uwe Naumann
The Complexity of Derivative Computation
2005-14
Felix C. Freiling and Sukumar Ghosh
Code Stabilization
2005-13
Carole Delporte-Gallet, Hugues Fauconnier, and Felix C. Freiling
Revisiting Failure Detection and Consensus in Omission Failure Environments
2005-12
Neeraj Mittal, Felix Freiling, S. Venkatesan, and Lucia Draque Penso
Efficient Reductions for Wait-Free Termination Detection in Faulty Distributed Systems
2005-11
Simon Fischer and Berthold Vöcking
A Counterexample to the Fully Mixed Nash Equilibrium Conjecture
2005-10
Benedikt Bollig
Automata and Logics for Message Sequence Charts
  • Paper: [pdf] [ps.gz]
2005-09
Klaus Kursawe and Felix C. Freiling
Byzantine Fault Tolerance on General Hybrid Adversary Structures
2005-08
Joachim Kneis and Peter Rossmanith
A New Satisfiability Algorithm With Applications To Max-Cut
2005-07
Felix C. Freiling, Thorsten Holz, and Georg Wicherski
Botnet Tracking: Exploring a Root-Cause Methodology to Prevent Distributed Denial-of-Service Attacks
2005-06
Simon Fischer and Berthold Vöcking
Adaptive Routing with Stale Information
2005-05
Fabien Pouget and Thorsten Holz
A Pointillist Approach for Comparing Honeypots
2005-04
Daniel Mölle, Stefan Richter, and Peter Rossmanith
A Faster Algorithm for the Steiner Tree Problem
2005-03
Jürgen Giesl, René Thiemann, and Peter Schneider-Kamp
Proving and Disproving Termination of Higher-Order Functions
2005-02
Maximillian Dornseif, Felix C. Gärtner, Thorsten Holz, and Martin Mink
An Offensive Approach to Teaching Information Security: "Aachen Summer School Applied IT Security"
2005-01
Fachgruppe Informatik
Jahresbericht 2004
2004-10
Zinaida Benenson, Felix C. Gärtner, and Dogan Kesdogan
Secure Multi-Party Computation with Security Modules
2004-09
Joachim Kneis, Daniel Mölle, Stefan Richter, and Peter Rossmanith
Parameterized Power Domination Complexity
2004-08
Klaus Indermark and Thomas Noll
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
2004-07
Michael Codish and Aart Middeldorp (eds.)
WST 04 -- 7th International Workshop on Termination
2004-06
Sergio Antoy and Yoshihito Toyama (eds.)
WRS 04 -- 4th International Workshop on Reduction Strategies in Rewriting and Programming
2004-05
Herbert Kuchen (ed.)
WFLP 04 -- 13th International Workshop on Functional and (Constraint) Logic Programming
2004-04
Slim Abdennadher and Christophe Ringeissen (eds.)
RULE 04 -- Fifth International Workshop on Rule-Based Programming
2004-03
Delia Kesner, Femke van Raamsdonk, and Joe Wells (eds.)
HOR 2004 -- 2nd International Workshop on Higher-Order Rewriting
2004-02
Benedikt Bollig and Martin Leucker
Message-Passing Automata are expressively equivalent to EMSO logic
2004-01
Fachgruppe Informatik
Jahresbericht 2003
2003-08
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, and Stephan Falke
Mechanizing Dependency Pairs
2003-07
Horst Lichter, Thomas von der Maßen, Alexander Nyßen, and Thomas Weiler
Vergleich von Ansätzen zur Feature Modellierung bei der Softwareproduktlinienentwicklung
2003-06
Franz Josef Och
Statistical Machine Translation: From Single-Word Models to Alignment Templates
2003-05
Christof Löding and Philipp Rohde
Solving the Sabotage Game is PSPACE-hard
2003-04
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, and Stephan Falke
Improving Dependency Pairs
2003-03
Jürgen Giesl and Deepak Kapur
Deciding Inductive Validity of Equations
2003-02
Jürgen Giesl and René Thiemann
Size-Change Termination for Term Rewriting
2003-01
Jahresbericht 2002
2002-11
Jürgen Giesl and Hans Zantema
Liveness in Rewriting
2002-10
Martin Leucker
Logics for Mazurkiewicz traces
2002-09
Markus Mohnen
Interfaces with Default Implementations in Java
2002-08
Markus Mohnen
An Open Framework for Data-Flow Analysis in Java
2002-07
Jörg Dahmen
Invariant Image Object Recognition using Gaussian Mixture Densities
2002-06
Henry N. Adorna
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata
2002-05
Horst Lichter, Thomas von der Maßen, and Thomas Weiler
Modelling Requirements and Architectures for Software Product Lines
2002-04
Jürgen Giesl and Aart Middeldorp
Innermost Termination of Context-Sensitive Rewriting
2002-03
Benedikt Bollig, Martin Leucker, and Thomas Noll
Generalised Regular MSC Languages
2002-02
Jürgen Giesl and Aart Middeldorp
Transformation Techniques for Context-Sensitive Rewrite Systems
2002-01
Jahresbericht 2001
2001-11
Klaus Indermark and Thomas Noll (eds.)
Kolloquium Programmiersprachen und Grundlagen der Programmierung
2001-10
Achim Blumensath
Axiomatising Tree-interpretable Structures
2001-09
Thomas Arts and Jürgen Giesl
A collection of examples for termination of term rewriting using dependency pairs
2001-08
Mareike Schoop and James Taylor (eds.)
Proceedings of the Sixth International Workshop on the Language-Action Perspective on Communication Modelling
2001-07
Martin Grohe and Stefan Wöhrle
An Existential Locality Theorem
2001-06
Achim Blumensath
Prefix-Recognisable Graphs and Monadic Second-Order Logic
2001-05
Benedikt Bollig, Martin Leucker, and Thomas Noll
Regular MSC Languages
2001-04
Benedikt Bollig, Martin Leucker, and Michael Weber
Local Parallel Model Checking for the Alternation Free mu-Calculus
2001-03
Thierry Cachat
The power of one-letter rational languages
2001-02
Benedikt Bollig and Martin Leucker
Deciding LTL over Mazurkiewicz Traces
2001-01
Jahresbericht 2000
2000-08
Thomas Arts and Thomas Noll
Verifying Generic Erlang Client-Server Implementations
  • Paper: [ps.gz]
2000-07
Markus Mohnen and Pieter Koopman (Eds.)
Proceedings of the 12th International Workshop of Functional Languages
2000-06
Mareike Schoop and Christoph Quix (eds.)
Proceedings of the Fifth International Workshop on the Language-Action Perspective on Communication Modelling
2000-05
Mareike Schoop
Cooperative Document Management
2000-04
Andreas Becks, Stefan Sklorz, and Matthias Jarke
Exploring the Semantic Structure of Technical Document Collections: A Cooperative Systems Approach
  • Paper: [ps.gz]
2000-03
D. Jäger, A. Schleicher, and B. Westfechtel
UPGRADE: A Framework for Building Graph-Based Software Engineering Tools
  • Paper: [ps.gz]
2000-02
Jens Vöge and Marcin Jurdzinski
A Discrete Strategy Improvement Algorithm for Solving Parity Games
  • Paper: [ps.gz]
2000-01
Jahresbericht 1999
1999-08
Oliver Matz
Dot-Depth and Monadic Quantifier Alternation over Pictures
1999-07
Thomas Wilke
CTL+ is exponentially more succinct than CTL
1999-06
Kai Jakobs and Klaus-Dieter Kleefeld
Informationssysteme für die angewandte historische Geographie
1999-05
W. Thomas (Ed.)
DLT 99 - Developments in Language Theory Fourth International Conference
1999-04
María Alpuente, Michael Hanus, Salvador Lucas, and Germán Vidal
Specialization of Functional Logic Programs Based on Needed Narrowing
1999-03
R. Gallersdörfer, M. Jarke, and M. Nicola
The ADR Replication Manager
1999-02
F. Huch
Verifcation of Erlang Programs using Abstract Interpretation and Model Checking --- Extended Version
1999-01
Jahresbericht 1998
1998-13
Klaus Indermark
Semantik rekursiver Funktionsdefinitionen mit Striktheitsinformation
1998-12
W. Appelt and M. Jarke
Interoperable Tools for Cooperation Support using the World Wide Web
1998-11
Ansgar Schleicher, Bernhard Westfechtel, and Dirk Jäger
Modeling Dynamic Software Processes in UML
1998-10
M. Nicola and M. Jarke
Performance Modeling of Distributed and Replicated Databases
1998-09
Th. Lehmann
Geometrische Ausrichtung medizinischer Bilder am Beispiel intraoraler Radiographien
1998-07
M. Arnold, M. Erdmann, M. Glinz, P. Haumer, R. Knoll, B. Paech, K. Pohl, J. Ryser, R. Studer, and K. Weidenhaupt
Survey on the Scenario Use in Twelve Selected Industrial Projects
1998-06
Matthias Oliver Berger
DECT in the Factory of the Future
1998-05
Martin Leucker and Stephan Tobies
Truth - A Verification Platform for Distributed Systems
1998-04
O. Kubitz
Mobile Robots in Dynamic Environments
1998-03
Stefan Gruner
Einige Anmerkungen zur graphgrammatischen Spezifikation von Integrationswerkzeugen nach Westfechtel, Janning, Lefering und Schürr
1998-02
Stefan Gruner, Manfred Nagl, and Andy Schürr
Fine-grained and Structure-Oriented Document Integration Tools are Needed for Development Processes
1998-01
Fachgruppe Informatik
Jahresbericht 1997
  • Paper: [ps.gz]
1997-15
George Botorog
High-Level Parallel Programming and the Efficient Implementation of Numerical Algorithms
1997-14
Roland Baumann
Client/Server Distribution in a Structure-Oriented Database Management System
1997-13
Markus Mohnen
Optimising the Memory Management of Higher-Order Functional Programs
1997-11
R. Klamma, P. Peters, and M. Jarke
Workflow Support for Failure Management in Federated Organizations
1997-10
Matthias Nicola and Matthias Jarke
Integrating Replication and Communication in Performance Models of Distributed Databases
1997-09
Carl-Arndt Krapp and Bernhard Westfechtel
Feedback Handling in Dynamic Task Nets
1997-08
Dorothea Blostein and Andy Schürr
Computing with Graphs and Graph Rewriting
1997-07
Petra Hofstedt
Taskparallele Skelette für irregulär strukturierte Probleme in deklarativen Sprachen
1997-06
Matthias Nicola and Matthias Jarke
Design and Evaluation of Wireless Health Care Information Systems in Developing Countries
1997-05
S. Gruner
Schemakorrespondenzaxiome unterstützen die paargrammatische Spezifikation inkrementeller Integrationswerkzeuge
1997-04
Markus Mohnen and Stefan Tobies
Implementing Context Patterns in the Glasgow Haskell Compiler
1997-03
Andreas Winter and Andy Schürr
Modules and Updatable Graph Views for PROgrammed Graph REwriting Systems
1997-02
Johannes Faassen
Using full parallel Boltzmann Machines for Optimization
1997-01
Michael Hanus and Frank Zartmann (eds.)
Jahresbericht 1996
1996-23
M.Gebhardt and S. Jacobs
Conflict Management in Design
1996-22
S. Jacobs, M. Gebhardt, S. Kethers, and W. Rzasa
Filling HTML forms simultaneously: CoWeb architecture and functionality
1996-21
G. de Michelis, E. Dubois, M. Jarke, F. Matthes, J. Mylopoulos, K. Pohl, J. Schmidt, C. Woo, and E. Yu
Cooperative information systems: a manifesto
1996-20
Matthias Jarke, Peter Peters, and Manfred A. Jeusfeld
Model-driven planning and design of cooperative information systems
1996-19
P. Peters and M. Jarke
Simulating the impact of information flows in networked organizations
1996-18
Manfred A. Jeusfeld and Mike Papazoglou
Information Brokering: Design, Search and Transformation
1996-17
Manfred A. Jeusfeld and Tung X. Bui
Decision Support Components on the Internet
1996-16
M. Jarke, M. Gebhardt, S. Jacobs, and H. Nissen
Conflict Analysis Across Heterogeneous Viewpoints: Formalization and Visualization
1996-15
H. Schimpe and M. Staudt
VAREX: An Environment for Validating and Refining Rule Bases
1996-14
R. Gallersdörfer, K. Klabunde, A. Stolz, and M. Eßmajor
INDIA --- Intelligent Networks as a Data Intensive Application, Final Project Report, June 1996
1996-13
K. Pohl, R. Klamma, K. Weidenhaupt, R. Dömges, P. Haumer, and M. Jarke
A Framework for Process-Integrated Tools
1996-12
R. Dömges, K. Pohl, M. Jarke, B. Lohmann, and W. Marquardt
PRO-ART/CE* --- An Environment for Managing the Evolution of Chemical Process Simulation Models
1996-11
C. Weise and D. Lenzkes
A Fast Decision Algorithm for Timed Refinement
1996-10
Reidar Conradi and Bernhard Westfechtel
Version Models for Software Configuration Management
1996-09-5
Alexandre Tessier
Declarative Debugging in Constraint Logic Programming
  • Paper: [ps.gz]
1996-09-4
Sébastien Limet and Pierre Réty
On Decidability of Unifiability Modulo Rewrite Systems
  • Paper: [ps.gz]
1996-09-3
Víctor M. Gulías and José L. Freire
Concurrent Programming in Haskell
  • Paper: [ps.gz]
1996-09-2
Olivier Danvy and Karoline Malmkjær
On the Idempotence of the CPS Transformation
  • Paper: [ps.gz]
1996-09-1
Ilies Alouini
An Implementation of Conditional Concurrent Rewriting on Distributed Memory Machines
  • Paper: [ps.gz]
1996-09-0
Michael Hanus (Ed.)
Proceedings of the Poster Session of ALP 96 - Fifth International Conference on Algebraic and Logic Programming: Introduction and table of contents
1996-09
Michael Hanus (Ed.)
Proceedings of the Poster Session of ALP96 - Fifth International Conference on Algebraic and Logic Programming
1996-08
S. Sripada
On Entropy and the Limitations of the Second Law of Thermodynamics
1996-07
Olaf Chitil
The Sigma-Semantics: A Comprehensive Semantics for Functional Programs
1996-06
M. Jarke and W. Marquardt
Design and Evaluation of Computer-Aided Process Modelling Tools
1996-05
Klaus Pohl
Requirements Engineering: An Overview
1996-04
Klaus Pohl
PRO-ART: Enabling Requirements Pre-Traceability
1996-03
W. Scheufele and G. Moerkotte
Optimal Ordering of Selections and Joins in Acyclic Queries with Expensive Predicates
1996-02
Michael Hanus and Christian Prehofer
Higher-Order Narrowing with Definitional Trees
1996-01
Jahresbericht 1995
1995-16
W. Hans, St. Winkler, and F. Saenz
Distributed Execution in Functional Logic Programming
1995-15
Matthias Jarke and Sudha Ram (Hrsg.)
WITS 95 Proceedings of the 5th Annual Workshop on Information Technologies and Systems
1995-14
P. Peters, P. Szczurko, and M. Jeusfeld
Oriented Information Management: Conceptual Models at Work
1995-13
M. Staudt and M. Jarke
Incremental Maintenance of Externally Materialized Views
1995-12
G. V. Zemanek, H. W. Nissen, H. Hubert, and M. Jarke
Requirements Analysis from Multiple Perspectives: Experiences with Conceptual Modeling Technology
1995-11
M. Staudt and K. von Thadden
Subsumption Checking in Knowledge Bases
1995-10
Rainer Gallersdörfer and Matthias Nicola
Improving Performance in Replicated Databases through Relaxed Coherency
1995-09
Markus Mohnen
Functional Specification of Imperative Programs: An Alternative Point of View of Functional Languages
1995-08
Markus Mohnen
Efficient Compile-Time Garbage Collection for Arbitrary Data Structures
1995-07
Sophie Cluet and Guido Moerkotte
Query Optimization Techniques Exploiting Class Hierarchies
1995-06
Sophie Cluet and Guido Moerkotte
Nested Queries in Object Bases
1995-05
Sophie Cluet and Guido Moerkotte
Efficient Evaluation of Aggregates on Bulk Types
1995-04
Birgitta König-Ries, Sven Helmer, and Guido Moerkotte
An experimental study on the complexity of left-deep join ordering problems for cyclic queries
1995-03
Ludwig Staiger
A Tight Upper Bound on Kolmogorov Complexity by Hausdorff Dimension and Uniformly Optimal Prediction
1995-02
Andy Schürr, Andreas J. Winter, and Albert Zündorf
Graph Grammar Engineering with PROGRES
1995-01
Fachgruppe Informatik
Jahresbericht 1994
1994-28
O. Burkart, D. Caucal, and B. Steffen
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
1994-27
M. Jarke, H. W. Nissen, and K. Pohl
Tool Integration in Evolving Information Systems Environments
1994-26
St. Jacobs and St. Kethers
Improving Communication and Decision Making within Quality Function Deployment
1994-25
M. Jarke, K. Pohl, C. Rolland, and J.-R. Schmitt
Experience-Based Method Evaluation and Improvement: A Process Modeling Approach
1994-24
M. Jarke, K. Pohl, R. Dömges, St. Jacobs, and H. W. Nissen
Requirements Information Management: The NATURE Approach
1994-22
H. Fernau and L. Staiger
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry
1994-21
M. Mohnen
Proving the Correctness of the Static Link Technique Using Evolving Algebras
1994-20
R. Gallersdörfer, M. Jarke, and K. Klabunde
Intelligent Networks as a Data Intensive Application (INDIA)
1994-19
M. Jeusfeld and U. Johnen
An Executable Meta Model for Re-Engineering of Database Schemas
1994-18
G. Hogen and R. Loogen
Parallel Functional Implementations: Graphbased vs. Stackbased Reduction
1994-17
I. Litovsky and L. Staiger
Finite acceptance of infinite words
1994-16
P. Klein
Designing Software with Modula-3
1994-15
Bernhard Westfechtel
A Graph-Based System for Managing Configurations of Engineering Design Documents
1994-14
L. Staiger
Codes, Simplifying Words, and Open Set Condition
1994-13
A. Schürr
Logic Based Programmed Structure Rewriting Systems
1994-12
A. Schürr
Specification of Graph Translators with Triple Graph Grammars
1994-11
A. Schürr
PROGRES, A Visual Language and Environment for PROgramming with Graph REwrite Systems
1994-09
Patrick Horster and Holger Petersen
Signatur- und Authentifikationsverfahren auf der Basis des diskreten Logarithmusproblems
1994-08
Manfred Nagl and Bernhard Westfechtel
A Universal Component for the Administration in Distributed and Integrated Development Environments
1994-07
P. Peters and P. Szczurko
Integrating Models of Quality Management Methods by an Object-Oriented Repository
1994-06
Claudia Popien, Bernd Meyer, and Axel Kuepper
A Formal Approach to Service Import in ODP Trader Federations
1994-05
Rolf Hager, Peter Hermesmann, and Michael Portz
Feasibility of Authentication Procedures within Advanced Transport Telematics
1994-04
Rolf Hager, Rudolf Mathar, and Jürgen Mattfeldt
Intelligent Cruise Control and Reliable Communication of Mobile Stations
1994-03
P. Constantopoulos, M. Jarke, J. Mylopoulos, and Y. Vassiliou
The Software Information Base: A Server for Reuse
1994-02
M. Lefering
Development of Incremental Integration Tools Using Formal Specifications
1994-01
Margit Generet and Sven Martin (eds.), Fachgruppe Informatik
Jahresbericht 1993
1993-21
M. Jarke, M. A. Jeusfeld, and P. Szczurko
Three Aspects of Intelligent Cooperation in the Quality Cycle
1993-20
K. Finke, M. Jarke, P. Szczurko, and R. Soltysiak
Quality Management for Expert Systems in Process Control
1993-19
W. Hans, J. J. Ruz, F. Saenz, and St. Winkler
A VHDL Specification of a Shared Memory Parallel Machine for Babel
1993-18
W. Hans, H. Kuchen, and St. Winkler
Full Indexing for Lazy Narrowing
1993-17
M. Jarke and K. Pohl
Establishing Vision in Context: Towards a Model of Requirements Processes
1993-16
M. Jarke, K. Pohl, and St. Jacobs et al.
Requirements Engineering: An Integrated View of Representation Process and Domain
1993-15
M. Staudt, H. W. Nissen, and M. A. Jeusfeld
Query by Class, Rule and Concept
1993-14
M. Jarke, St. Eherer, R. Gallersdoerfer, M. Jeusfeld, and M. Staudt
ConceptBase - A Deductive Object Base Manager
1993-13
O. Maler and L. Staiger
On Syntactic Congruences for omega-languages
1993-12
Rudolf Mathar and Jürgen Mattfeldt
On the Distribution of Cumulated Interference Power in Rayleigh Fading Channels
1993-11
R. Große-Wienker, O. Hermanns, D. Menzenbach, A. Pollacks, S. Repetzki, J. Schwartz, K. Sonnenschein, and B. Westfechtel
Das SUKITS-Projekt: A-posteriori-Integration heterogener CIM-Anwendungssysteme
1993-10
O. Burkart and B. Steffen
Pushdown Processes: Parallel Composition and Model Checking
1993-09
M. Buchheit, M. Jeusfeld, W. Nutt, and M. Staudt
Subsumption between Queries to Object-Oriented Databases
1993-08
Matthias Berger
k-Coloring Vertices using a Neural Network with Convergence to Valid Solutions
1993-07
Graduiertenkolleg Informatik und Technik (Hrsg.)
Graduiertenkolleg Informatik und Technik
1993-06
A. Kemper and D. Kossmann
Adaptable Pointer Swizzling Strategies in Object Bases: Design, Realization, and Quantitative Analysis
1993-05
A. Zündorf
A Heuristic for the Subgraph Isomorphism Problem in Executing PROGRES
1993-03
G. Hogen and R. Loogen
A New Stack Technique for the Management of Runtime Structures in Distributed Environments
1993-02
Patrick Shicheng Chen
On Inference Rules of Logic-Based Information Retrieval Systems
1993-01
Fachgruppe Informatik
Jahresbericht 1992
1992-44
N. Kiesel, A. Schuerr, and B. Westfechtel
Design and Evaluation of GRAS, a Graph-Oriented Database System for Engineering Applications
1992-43
W. Hans and St.Winkler
Abstract Interpretation of Functional Logic Languages
1992-42
P. S. Chen, R. Hennicker, and M. Jarke
On the Retrieval of Reusable Software Components
1992-41
Gerhard Friedrich and Wolfgang Neidl
Constructive Utility in Model-Based Diagnosis Repair Systems
1992-40
Rudolf Mathar and Jürgen Mattfeldt
Channel Assignment in Cellular Radio Networks
1992-39
P. Koch
Intelligentes Backtracking bei der Auswertung funktional-logischer Programme
1992-38
A. Zuendorf
Implementation of the imperative / rule based language PROGRES
1992-37
K. Pohl and M. Jarke
Quality Information Systems: Repository Support for Evolving Process Models
1992-36
M. Jarke, J. Bubenko, C. Rolland, A. Sutcliffe, and Y. Vassiliou
Theories Underlying Requirements Engineering: An Overview of NATURE at Genesis
1992-35
J. Börstler
Feature-Oriented Classification and Reuse in IPSEN
1992-34
C. Gerlhof, A. Kemper, Ch. Kilger, and G. Moerkotte
Partition-Based Clustering in Object Bases: From Theory to Practice
1992-33
B. Heinrichs, K. Jakobs, K. Lenßen, W. Reinhardt, and A. Spinner
Euro-Bridge: Communication Services for Multimedia Applications
1992-32
Bernd Heinrichs and Kai Jakobs
Timer Handling in High-Performance Transport Systems
1992-30
A. Kemper, G. Moerkotte, and K. Peithner
Object-Orientation Axiomatised by Dynamic Logic
1992-29
B. Schinzel
Warum Frauenforschung in Naturwissenschaft und Technik
1992-28
Gerhard Steinke and Matthias Jarke
Support for Security Modeling in Information Systems Design
1992-27
W. Hans and St. Winkler
Aliasing and Groundness Analysis of Logic Programs through Abstract Interpretation and its Safety
1992-26
Michael von der Beeck
Integration of Structured Analysis and Timed Statecharts for Real-Time and Concurrency Specification
1992-25
R. Stainov
A Dynamic Configuration Facility for Multimedia Communications
1992-24
K. Pohl
The Three Dimensions of Requirements Engineering
1992-23
T. Margaria and B. Steffen
Distinguishing Formulas for Free
1992-22
H. Kuchen, J. J. Moreno Navarro, and M. V. Hermenegildo
Independent AND-Parallel Narrowing
1992-21
H. Kuchen and F. J. Lopez Fraguas
Result Directed Computing in a Functional Logic Language
1992-20
H. Kuchen, F. J. Lopez Fraguas, J. J. Moreno Navarro, and M. Rodriguez Artalejo
Implementing Disequality in a Lazy Functional Logic Language
1992-19-29
G. Ostheimer
Load Bounding for Implicit Parallelism (abstract)
  • Paper: [ps.gz]
1992-19-28
J. van Groningen
Some implementation aspects of Concurrent Clean on distributed memory architectures
  • Paper: [ps.gz]
1992-19-27
H. Doerr
Monitoring with Graph-Grammars as formal operational Models
  • Paper: [ps.gz]
1992-19-26
Th. Peikenkamp
Charakterizing and representing neededness in functional loginc languages (abstract)
  • Paper: [ps.gz]
1992-19-25
M. Kesseler
Communication Issues Regarding Parallel Functional Graph Rewriting
  • Paper: [ps.gz]
1992-19-24
W. Damm, F. Liu, and Th. Peikenkamp
Evaluation and Parallelization of Functions in Functional + Logic Languages (abstract)
  • Paper: [ps.gz]
1992-19-23
S.L. Peyton Jones and P. Wadler
Imperative functional programming (Brief summary)
  • Paper: [ps.gz]
1992-19-22
G. Burn and D. Le Metayer
Cps-Translation and the Correctness of Optimising Compilers
  • Paper: [ps.gz]
1992-19-21
S. Hwang and D. Rushall
The nu-STG machine: a parallelized Spineless Tagless Graph Reduction Machine in a distributed memory architecture (Draft version)
  • Paper: [ps.gz]
1992-19-20
J. C. Glas, R. F. H. Hofman, and W. G. Vree
Parallelization of Branch-and-Bound Algorithms in a Functional Programming Environment
  • Paper: [ps.gz]
1992-19-19
D. Lester
Distributed Garbage Collection of Cyclic Structures (Draft version)
  • Paper: [ps.gz]
1992-19-18
W. S. Martins
Parallel Implementations of Functional Languages
  • Paper: [ps.gz]
1992-19-17
J. Wild, H. Glaser, and P. Hartel
Statistics on storage management in a lazy functional language implementation
  • Paper: [ps.gz]
1992-19-16
D. Rushall
An Attribute Grammar Evaluator in Haskell
  • Paper: [ps.gz]
1992-19-15
S. Mintchev
Using Strictness Information in the STG-machine
1992-19-14
K. Hammond and S. Peyton Jones
Profiling scheduling strategies on the GRIP parallel reducer
  • Paper: [ps.gz]
1992-19-13
K. Langendoen and D. J. Agterkamp
Cache Behaviour of Lazy Functional Programs (Working Paper)
  • Paper: [ps.gz]
1992-19-12
A. Bennett and P. Kelly
Simulation of Multicache Parallel Reduction
  • Paper: [ps.gz]
1992-19-11
M. Joy and T. Axford
A Parallel Graph Reduction Machine
  • Paper: [ps.gz]
1992-19-10
J. Glauert
Parallel Implementation of Functional Languages Using Small Processes
  • Paper: [ps.gz]
1992-19-09
D. Howe and G. Burn
Experiments with strict STG code
  • Paper: [ps.gz]
1992-19-08
D. Gärtner, A. Kimms, and W. Kluge
pi-Red^+ - A Compiling Graph-Reduction System for a Full Fledged Lambda-Calculus
  • Paper: [ps.gz]
1992-19-07
J. Seward
Polymorphic Strictness Analysis using Frontiers (Draft Version)
  • Paper: [ps.gz]
1992-19-06
M. Chakravarty and M. Köhler
Equational Constraints, Residuation, and the Parallel JUMP-Machine
  • Paper: [ps.gz]
1992-19-05
S. Kahrs
Polymorphic Type Checking by Interpretation of Code
  • Paper: [ps.gz]
1992-19-04
T. A. Bratvold
Determining Useful Parallelism in Higher Order Functions
  • Paper: [ps.gz]
1992-19-03
C. Rathsack and S.B. Scholz
LISA - A Lazy Interpreter for a Full-Fledged Lambda-Calculus
  • Paper: [ps.gz]
1992-19-02
H. Kuchen and K. Gladitz
Implementing Bags on a Shared Memory MIMD-Machine
  • Paper: [ps.gz]
1992-19-01
G. Hogen and R. Loogen
PASTEL - A Parallel Stack-Based Implementation of Eager Functional Programs with Lazy Data Structures (Extended Abstract)
  • Paper: [ps.gz]
1992-19-00
H. Kuchen and R. Loogen (eds.)
Proceedings of the 4th Int. Workshop on the Parallel Implementation of Functional Languages
1992-18
Clarence A. Ellis and Matthias Jarke (Eds.)
Distributed Cooperation in Integrated Information Systems - Proceedings of the Third International Workshop on Intelligent and Cooperative Information Systems
1992-17
M. Jarke (ed.)
ConceptBase V3.1 User Manual
1992-16
Graduiertenkolleg Informatik und Technik (Hrsg.)
Forschungsprojekte des Graduiertenkollegs Informatik und Technik
1992-15
A. Schuerr and B. Westfechtel
Graphgrammatiken und Graphersetzungssysteme (written in german)
1992-14
Th. Noll and H. Vogler
Top-down Parsing with Simultaneous Evaluation on Noncircular Attribute Grammars
1992-13
Matthias Jarke and Thomas Rose
Specification Management with CAD
1992-12
W. Hans, R. Loogen, and St. Winkler
On the Interaction of Lazy Evaluation and Backtracking
1992-11
Werner Hans
A Complete Indexing Scheme for WAM-based Abstract Machines
1992-10
Matthias Jarke, Manfred Jeusfeld, Andreas Miethsam, and Michael Gocek
Towards a logic-based reconstruction of software configuration management
1992-09
Alfons Kemper and Guido Moerkotte
Grundlagen objektorientierter Datenbanksysteme
1992-08
Rudolf Mathar and Jürgen Mattfeldt
Analyzing Routing Strategy NFP in Multihop Packet Radio Networks on a Line
1992-07
Matthias Jarke and Klaus Pohl
Information Systems Quality and Quality Information Systems
1992-06
O. Burkart and B. Steffen
Model Checking for Context-Free Processes
1992-05
Matthias Jarke, Carlos Maltzahn, and Thomas Rose
Sharing Processes: Team Coordination in Design Repositories
1992-04
S. A. Smolka and B. Steffen
Priority as Extremal Probability
1992-02
Bernhard Westfechtel
Basismechanismen zur Datenverwaltung in strukturbezogenen Hypertextsystemen
1992-01
Stefan Eherer (ed.), Fachgruppe Informatik
Jahresbericht 1991
1991-31
B. Steffen
Generating Data Flow Analysis Algorithms from Modal Specifications
1991-30
T. Margaria
First-Order theories for the verification of complex FSMs
1991-28
J. Knoop and B. Steffen
Unifying Strength Reduction and Semantic Code Motion
1991-27
J. Knoop and B. Steffen
The Interprocedural Coincidence Theorem
1991-26
M. Jeusfeld and M. Staudt
Query Optimization in Deductive Object Bases
1991-25
Rudolf Mathar and Jürgen Mattfeldt
Optimal Transmission Ranges for Mobile Communication in Linear Multihop Packet Radio Networks
1991-24
R. Cleaveland, J. Parrow, and B. Steffen
The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems
1991-23
S. Graf and B. Steffen
Compositional Minimization of Finite State Systems
1991-22
H. Kuchen, F. Lücking, and H. Stoltze
The Topology Description Language TDL
1991-21
Prof. Dr. rer. nat. Otto Spaniol
ODP (Open Distributed Processing): Yet another Viewpoint
1991-20
G. Hogen, A. Kindler, and R. Loogen
Automatic Parallelization of Lazy Functional Programs
1991-19
M. Jeusfeld and M. Jarke
From Relational to Object-Oriented Integrity Simplification
1991-18
Matthias Jarke, John Mylopoulos, Joachim W. Schmidt, and Yannis Vassiliou
DAIDA: An Environment for Evolving Information Systems
1991-17
A. Zündorf and A. Schürr
Nondeterministic Control Structures for Graph Rewriting Systems
1991-16
J. Börstler and Th. Janning
Bridging the gap between Requirements Analysis and Design
1991-15
J. Börstler and A. Zündorf
Revisiting extensions to Modula-2 to support reusability
1991-14
Andreas Fasbender and Wolfgang Kremer
A New Approximation Algorithm for Tandem Networks with Priority Nodes
1991-13
Rolf Hager and Wolfgang Kremer
The Adaptive Priority Scheduler: A More Fair Priority Service Discipline
1991-12
K. Indermark and M. Rodriguez Artalejo (Eds.)
Granada Workshop on the Integration of Functional and Logic Programming
1991-11
R. Loogen and St. Winkler
Dynamic Detection of Determinism in Functional Logic Languages
1991-10
K. Gladitz, H. Fassbender, and H. Vogler
Compiler-based Implementation of Syntax-Directed Functional Programming
1991-09
Eila Kuikka
A Proposal for a Syntax-Directed Text Processing System
1991-07
Ludwig Staiger
Syntactic Congruences for w-languages
1991-06
Ludwig Staiger
Kolmogorov Complexity and Hausdorff Dimension
1991-05
H. Kuchen and G. Geiler
Distributed Applicative Arrays
1991-04
M. Portz
A new class of cryptosystems based on interconnection networks
1991-03
B. Steffen and A. Ingolfsdottir
Characteristic Formulae for Processes with Divergence
1991-01
Guenther Geiler (ed.), Fachgruppe Informatik
Jahresbericht 1990
1990-22
H. Fassbender and H. Vogler
A Call-by-need Implementation of Syntax Directed Functional Programming
1990-21
Manfred Nagl
Modelling of Software Architectures: Importance, Notions, Experiences
1990-20
Y. Ortega Mallen and D. de Frutos Escrig
A Complete Proof System for Timed Observations
1990-18
Eric Kowalewski
Entwurf und Interpretation einer Sprache zur Beschreibung von Konsultationsphasen in Expertensystemen
1990-17
Marita Möller
Ein Ebenenmodell wissensbasierter Konsultationen - Unterstützung für Wissensakquisition und Erklärungsfähigkeit
1990-16
A. Schürr
PROGRESS: A VHL-Language Based on Graph Grammars
1990-15
Manfred Nagl and Andreas Schürr
A Specification Environment for Graph Grammars
1990-14
A. Maassen
Compilerentwicklung in Miranda - ein Praktikum in funktionaler Programmierung (written in german)
1990-13
Rudolf Mathar, Andreas Mann
Analyzing a Distributed Slot Assignment Protocol by Markov Chains
1990-12
Kai Jakobs, Josef Kaltwasser, Frank Reichert, and Otto Spaniol
Der Computer fährt mit
1990-11
H. Kuchen, R. Loogen, J.J. Moreno Navarro, and M. Rodriguez Artalejo
Lazy Narrowing in a Graph Machine
1990-09
Ulrich Quernheim and Dieter Kreuer
Das CCITT - Signalisierungssystem Nr. 7 auf Satellitenstrecken; Simulation der Zeichengabestrecke
1990-08
Kai Jakobs
Directory Names and Schema - An Evaluation
1990-07
Kai Jakobs
What's Beyond the Interface - OSI Networks to Support Cooperative Work
1990-06
Kai Jakobs and Frank Reichert
Directory Services for Mobile Communication
1990-05
H. Kuchen and A. Wagener
Comparison of Dynamic Load Balancing Strategies
1990-04
R. Loogen
Stack-based Implementation of Narrowing
1990-03
Jerzy Skurczynski
On Three Hierarchies of Weak SkS Formulas
1990-02
Vera Jansen, Andreas Potthoff, Wolfgang Thomas, and Udo Wermuth
A Short Guide to the AMORE System (Computing Automata, MOnoids and Regular Expressions)
1990-01
Fachgruppe Informatik
Jahresbericht 1989
1989-20
H. Kuchen, R. Loogen, J. J. Moreno Navarro, and M. Rodriguez Artalejo
Graph-based Implementation of a Functional Logic Language
1989-19
Mario Rodriguez-Artalejo and Heiko Vogler
A Narrowing Machine for Syntax Directed BABEL
1989-18
A. Maassen
Programming with Higher Order Functions
1989-17
J. Derissen, P. Hruschka, M. v.d. Beeck, Th. Janning, and M. Nagl
Integrating Structured Analysis and Information Modelling
1989-16
G. Vossen and K.-U. Witt
SUXESS: Towards a Sound Unification of Extensions of the Relational Data Model
1989-15
M. Schümmer, Th. Welzel, and P. Martini
Integration of Field Bus and MAP Networks - Hierarchical Communication Systems in Production Environments
1989-14
Martine Schümmer
Local Area Networks for Manufactoring Environments with hard Real-Time Requirements
1989-13
Martine Schümmer
CNC/DNC Communication with MAP
1989-12
Peter Martini
The DQDB Protocol - Is it Playing the Game?
1989-11
Manfred Nagl (Ed.)
Abstracts of Talks presented at the WG '89 15th International Workshop on Graphtheoretic Concepts in Computer Science
1989-10
P. Davids and Th. Welzel
Performance Analysis of DQDB Based on Simulation
1989-09
Peter Martini
High Speed Local Area Networks - A Tutorial
1989-08
Bernhard Westfechtel
Extension of a Graph Storage for Software Documents with Primitives for Undo/Redo and Revision Control
1989-07
Kai Jakobs
ISO's Directory Proposal - Evolution, Current Status and Future Problems
1989-06
Kai Jakobs
OSI - An Appropriate Basis for Group Communication?
1989-05
J. Börstler
Reuse and Software Development - Problems, Solutions, and Bibliography (in German)
1989-04
Andy Schürr
Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language
1989-03
Heiko Vogler
Bottom-Up Computation of Primitive Recursive Tree Functions
1989-02
G. Esser, J. Rückert, and F. Wagner (Hrsg.)
Gesellschaftliche Aspekte der Informatik
1989-01
Fachgruppe Informatik
Jahresbericht 1988
1988-24
Uschi Heuter
Generalized Definite Tree Languages
1988-23
Wolfgang Thomas
Automata and Quantifier Hierarchies
1988-22
Joost Engelfriet and Heiko Vogler
Modular Tree Transducers
1988-21
Th. Janning and C. Lewerentz
Integrated Project Team Management in a Software Development Environment
1988-20
Thomas Welzel
Einsatz des Simulationswerkzeuges QNAP2 zur Leistungsbewertung von Kommunikationsprotokollen
1988-19
Heiko Vogler
Functional Distribution of the Contextual Analysis in Block-Structured Programming Languages: A Case Study of Tree Transducers
1988-18
Michael Sonnenschein
On Petri Nets and Data Flow Graphs
1988-17
Wolfgang Thomas
Automata on Infinite Objects
1988-16
Fachgruppe Informatik
Jahresbericht 1987
1988-15
Peter Martini, Otto Spaniol, and Thomas Welzel
File Transfer in High Speed Token Ring Networks: Performance Evaluation by Approximate Analysis and Simulation
1988-14
U. Quernheim
Satellite Communication Protocols - A Performance Comparison Considering On-Board Processing
1988-13
Martine Schümmer
RS-511, a Protocol for the Plant Floor
1988-12
Kai Jakobs
Directory Services in Distributed Systems - A Survey
1988-11
Kai Jakobs
The Directory - Evolution of a Standard
1988-10
Kai Jakobs
Towards User-Friendly Networking
1988-09
W. Kremer, F. Reichert, J. Rückert, and A. Mann
Entwurf einer Netzwerktopologie für ein Mobilfunknetz zur Unterstützung des öffentlichen Straßenverkehrs
1988-08
Andreas Mann and Johannes Rückert
Concurrent Slot Assignment Protocol for Packet Radio Networks
1988-07
Andreas Mann and Johannes Rückert
Packet Radio Networks for Data Exchange
1988-06
Andreas Mann, Johannes Rückert, and Otto Spaniol
Datenfunknetze
1988-05
Peter Martini
Performance Analysis of Multiple Token Rings
1988-04
Peter Martini
Performance Comparison for HSLAN Media Access Protocols
1988-03
Thomas Welzel
Simulation of a Multiple Token Ring Backbone
1988-02
Peter Martini and Otto Spaniol
Token-Passing in High-Speed Backbone Networks for Campus-Wide Environments
1988-01
Gabriele Esser, Johannes Rückert, and Frank Wagner
Gesellschaftliche Aspekte der Informatik
1987-12
J. Börstler, U. Möncke, and R. Wilhelm
Table compression for tree automata
1987-11
Rita Loogen
Design of a Parallel Programmable Graph Reduction Machine with Distributed Memory
1987-10
Herbert Klaeren and Klaus Indermark
A New Implementation Technique for Recursive Function Definitions
1987-09
Claus Lewerentz and Andreas Schürr
Experiences with a Database System for Software Documents
1987-08
Manfred Nagl
Set Theoretic Approaches to Graph Grammars
1987-07
Gregor Engels, Claus Lewerentz, and Wilhelm Schäfer
Graph Grammar Engineering: A Software Specification Method
1987-06
Werner Damm and Gert Döhmen
Specifying Distributed Computer Architectures in AADL*
1987-05
Reinhard Rinn
Über Eingabeanomalien bei verschiedenen Inferenzmodellen
1987-04
Claus Lewerentz, Manfred Nagl, and Bernhard Westfechtel
On Integration Mechanisms within a Graph-Based Software Development Environment
1987-03
Manfred Nagl
A Software Development Environment based on Graph Technology
1987-02
David de Frutos Escrig and Klaus Indermark
Equivalence Relations of Non-Deterministic Ianov-Schemes
1987-01
Fachgruppe Informatik
Jahresbericht 1986

Computer Science Technical Reports World Wide

The Collection of Computer Science Bibliographies
Collection of bibliographies of scientific literature in computer science from various sources, covering most aspects of computer science.
Disclaimer