Institute of Formal Methods in Computer Science | Publications : Technical Reports

Institute of Formal Methods in Computer Science : Publications

No. 05: Becker, Steffen; Hasselbring, Wilhelm; van Hoorn, Andre; Kounev, Samuel; Reussner, Ralf: Proceedings of the 2014 Symposium on Software Performance (SOSP '14): Joint Descartes/Kieker/Palladio Days, Technical Report No. 2014/05.
No. 100: Haas, Stephan: Autonome Selbstlokalisierung und Tracking basierend auf Mobilfunkbasisstationen, Technical Report No. 2014/100.
No. 3528: Hartmann, Frederik: Routenplanung mit Nebenbedingungen, Technical Report No. 2014/3528.

No. 07: Kufleitner, Manfred; Lauser, Alexander: Nesting Negations in FO^2 over Finite Words, Technical Report No. 2013/07.
No. 80: Sanwald, Tim: Verkehrsabhängiges Routing basierend auf TMC Nachrichten, Technical Report No. 2013/80.

No. 03: Kufleitner, Manfred; Lauser, Alexander: Lattices of Logical Fragments over Words, Technical Report No. 2012/03.

No. 02: Kufleitner, Manfred; Lauser, Alexander: Cantor Topologies for Finite Words, Technical Report No. 2011/02.
No. 03: Kufleitner, Manfred; Lauser, Alexander: Around Dot-depth One, Technical Report No. 2011/03.

No. 01: Dartois, Luc; Kufleitner, Manfred; Lauser, Alexander: Rankers over Infinite Words, Technical Report No. 2010/01.
No. 02: Kopecki, Steffen: On the Iterated Hairpin Completion, Technical Report No. 2010/02.
No. 03: Kufleitner, Manfred; Lauser, Alexander: Partially Ordered Two-way Büchi Automata, Technical Report No. 2010/03.
No. 04: Diekert, Volker; Kopecki, Steffen: Complexity Results and the Growths of Hairpin Completions of Regular Languages, Technical Report No. 2010/04.
No. 05: Lewandowski, Stefan: Shortest Paths and Negative Cycle Detection in Graphs with Negative Weights - I: The Bellman-Ford-Moore Algorithm Revisited, Technical Report No. 2010/05.
No. 06: Hoffmann, Benjamin: Comparison of Standard and Zipf-Based Document Retrieval Heuristics, Technical Report No. 2010/06.
No. 08: Kallas, Jakub; Kufleitner, Manfred; Lauser, Alexander: First-order Fragments with Successor over Infinite Words, Technical Report No. 2010/08.

No. 02: Fouz, Mahmoud; Kufleitner, Manfred; Manthey, Bodo; Zeini Jahromi, Nima: On Smoothed Analysis of Quicksort and Hoare's Find, Technical Report No. 2009/02.
No. 04: Diekert, Volker; Kufleitner, Manfred: Fragments of first-order logic over infinite words, Technical Report No. 2009/04.

No. 05: Kufleitner, Manfred: A Proof of the Factorization Forest Theorem, Technical Report No. 2007/05.

No. 01: König, Barbara; Kozioura, Vitali: Counterexample-guided Abstraction Refinement for the Analysis of Graph Transformation Systems, Technical Report No. 2006/01.
No. 02: Esparza, Javier; Kiefer, Stefan; Schwoon, Stefan: Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems, Technical Report No. 2006/02.
No. 03: Kufleitner, Manfred: Polynomials, Fragments of Temporal Logic and the Variety DA over Traces, Technical Report No. 2006/03.
No. 04: Göller, Stefan; Lohrey, Markus: Infinite State Model-Checking of Propositional Dynamic Logics, Technical Report No. 2006/04.
No. 06: Horsch, Martin; Kufleitner, Manfred: The Expressive Power of Simple Logical Fragments over Traces, Technical Report No. 2006/06.
No. 09: Suwimonteerabuth, Dejvuth; Schwoon, Stefan; Esparza, Javier: Efficient Algorithms for Alternating Pushdown Systems: Application to Certificate Chain Discovery with Threshold Subjects, Technical Report No. 2006/09.

No. 01: Lohrey, Markus: Model-Checking Hierarchical Structures, Technical Report No. 2005/01.
No. 02: Lohrey, Markus; Ondrusch, Nicole: Inverse monoids: decidability and complexity of algebraic questions, Technical Report No. 2005/02.
No. 04: Göller, Stefan; Lohrey, Markus: Fixpoint logics on hierarchical structures, Technical Report No. 2005/04.
No. 06: Bouajjani, Ahmed; Esparza, Javier; Schwoon, Stefan; Strejcek, Jan: Reachability analysis of multithreaded software with asynchronous communication, Technical Report No. 2005/06.
No. 07: Lohrey, Markus; Kuske, Dietrich: First-order and counting theories of omega-automatic structures, Technical Report No. 2005/07.

No. 01: Ehrig, Hartmut; König, Barbara: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting (Long Version), Technical Report No. 2004/01.
No. 05: Heljanko, Keijo; Stefanescu, Alin: Complexity results for checking distributed implementability, Technical Report No. 2004/05.
No. 06: Schwoon, Stefan; Esparza, Javier: A Note on On-The-Fly Verification Algorithms, Technical Report No. 2004/06.
No. 08: Dotti, Fernando Luis; König, Barbara; Marchi do Santos, Osmar; Ribeiro, Leila: A Case Study: Verifying a Mutual Exclusion Protocol with Process Creation using Graph Transformation Systems, Technical Report No. 2004/08.