2007
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. An extension of Newton's method to -continuous semirings. Technical report, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, March 2007.	GZipped PostScript (196 kB) PDF (193 kB) Info Conference version
Javier Esparza, Dirk Nowotka, and Jiri Srba. Deterministic context-free model checking. Technical report, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Germany, January 2007.	GZipped PostScript (198 kB) PDF (249 kB) Info
2006
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. On fixed point equations over commutative semirings. Technical report, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, December 2006.	GZipped PostScript (217 kB) PDF (214 kB) Info Conference version
J. Esparza, P. Jančar, and A. Miller. On the complexity of consistency and complete state coding. Technical report, University of Stuttgart, July 2006.	GZipped PostScript (126 kB) PDF (184 kB) Info Conference version
Volker Diekert, Tero Harju, and Dirk Nowotka. Weinbaum factorizations of primitive words. TUCS Tech. Rep. 780, Turku Centre of Computer Science, Finland, July 2006.	PDF (203 kB) Info Journal version
G. Delzanno, J. Esparza, and J. Srba. Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols. Technical report, BRICS, 2006.	GZipped PostScript (227 kB) PDF (304 kB) Info Conference version
Javier Esparza, Stefan Kiefer, and Stefan Schwoon. Abstraction refinement with Craig interpolation and symbolic pushdown systems. Technical Report 2006/02, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, January 2006.	GZipped PostScript (219 kB) PDF (219 kB) Info Conference version
Paolo Baldan, Stefan Haar, and Barbara König. Distributed unfolding of Petri nets. Technical Report CS-2006-1, Dipartimento di Informatica, Università Ca' Foscari di Venezia, 2006.	PDF (302 kB) Info
Barbara König and Vitali Kozioura. Counterexample-guided abstraction refinement for the analysis of graph transformation systems. Technical Report 01/2006, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, 2006.	PDF (282 kB) Info
Tero Harju and Dirk Nowotka. Periods in word extensions. TUCS Tech. Rep. 736, Turku Centre of Computer Science, Finland, January 2006.	GZipped PostScript (595 kB) PDF (125 kB) Info Journal version
Tero Harju and Dirk Nowotka. Binary words with few squares. TUCS Tech. Rep. 737, Turku Centre of Computer Science, Finland, January 2006.	GZipped PostScript (582 kB) PDF (93 kB) Info Journal version
Dejvuth Suwimonteerabuth, Stefan Schwoon, and Javier Esparza. Efficient algorithms for alternating pushdown systems: Application to certificate chain discovery with threshold subjects. Technical Report 2006/09, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, 2006.	GZipped PostScript (216 kB) Info Conference version
2005
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, and Jan Strejček. Reachability analysis of multithreaded software with asynchronous communication. Technical Report 2005/06, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, November 2005.	GZipped PostScript (65 kB) PDF (183 kB) Info Conference version
Tero Harju and Dirk Nowotka. On unique factorizations of primitive words. TUCS Tech. Rep. 714, Turku Centre of Computer Science, Finland, October 2005.	GZipped PostScript (582 kB) PDF (115 kB) Info Journal version
Stefan Schwoon, Hao Wang, Somesh Jha, and Thomas Reps. Distributed certificate-chain discovery in SPKI/SDSI. Technical Report TR-1526, Computer Sciences Department, University of Wisconsin, August 2005.	GZipped PostScript (160 kB) Info Conference version
Hao Wang, Somesh Jha, Thomas Reps, Stefan Schwoon, and Stuart Stubblebine. Reducing the dependence of trust-management systems on PKI. Technical Report TR-1527, Computer Sciences Department, University of Wisconsin, August 2005.	GZipped PostScript (126 kB) Info Conference version
Javier Esparza, Antonín Kučera, and Richard Mayr. Quantitative analysis of probabilistic pushdown automata: Expectations and variances. Technical Report FIMU-RS-2005-07, Masaryk University, 2005.	PDF (253 kB) Info Conference version
2004
Tero Harju and Dirk Nowotka. Counting bordered and primitive words with a fixed weight. TUCS Tech. Rep. 630, Turku Centre of Computer Science, Finland, November 2004.	GZipped PostScript (668 kB) PDF (142 kB) Info Journal version
Stefan Schwoon and Javier Esparza. A note on on-the-fly verification algorithms. Technical Report 2004/06, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, November 2004.	GZipped PostScript (93 kB) PDF (179 kB) Info See www.fmi.uni-stuttgart.de ... Conference version
Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. Research Report A92, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, July 2004.	Info See www.tcs.hut.fi ...
Tero Harju and Dirk Nowotka. On the equation in a free semigroup. TUCS Tech. Rep. 602, Turku Centre of Computer Science, Finland, April 2004.	GZipped PostScript (150 kB) PDF (130 kB) Info Journal version
Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. Technical Report 198, Institute of Computer Science, University of Freiburg, Freiburg, Germany, February 2004.	Info See www.tcs.hut.fi ...
Javier Esparza, Antonín Kučera, and Richard Mayr. Model checking probabilistic pushdown automata. Technical report, Faculty of Informatics, Masaryk University, Brno, 2004.	GZipped PostScript (206 kB) PDF (738 kB) Info Conference version, Journal version
Hartmut Ehrig and Barbara König. Deriving bisimulation congruences in the DPO approach to graph rewriting. Technical Report 01/2004, Universität Stuttgart, 2004.	GZipped PostScript (554 kB) PDF (1017 kB) Info See inf4.informatik.uni-stuttgart.de ... Conference version
Paolo Baldan, Andrea Corradini, and Barbara König. An unfolding-based approach for the verification of finite-state graph grammars. Technical Report CS-2004-10, Dipartimento di Informatica, Università Ca' Foscari di Venezia, 2004.	GZipped PostScript (225 kB) PDF (343 kB) Info See www.dsi.unive.it ... Conference version
Fernando Luís Dotti, Barbara König, Osmar Marchi dos Santos, and Leila Ribeiro. A case study: Verifying a mutual exclusion protocol with process creation using graph transformation systems. Technical Report 08/2004, Universität Stuttgart, 2004.	GZipped PostScript (324 kB) PDF (532 kB) Info See inf4.informatik.uni-stuttgart.de ...
Keijo Heljanko and Alin Stefanescu. Complexity results for checking distributed implementability. Technical Report 05/2004, Universität Stuttgart, 2004.	PDF (324 kB) Info Slides
2003
Tero Harju and Dirk Nowotka. The equation in a free semigroup. TUCS Tech. Rep. 561, Turku Centre of Computer Science, Finland, October 2003.	GZipped PostScript (91 kB) PDF (97 kB) Info Journal version
Tero Harju, Arto Lepistö, and Dirk Nowotka. A characterization of periodicity of bi-infinite words. TUCS Tech. Rep. 545, Turku Centre of Computer Science, Finland, August 2003.	GZipped PostScript (88 kB) PDF (91 kB) Info Journal version
Tero Harju and Dirk Nowotka. Border correlation of binary words. TUCS Tech. Rep. 546, Turku Centre of Computer Science, Finland, August 2003.	GZipped PostScript (124 kB) PDF (150 kB) Info Journal version
Tero Harju and Dirk Nowotka. Periodicity and unbordered words. TUCS Tech. Rep. 523, Turku Centre of Computer Science, Finland, April 2003. Submitted.	GZipped PostScript (120 kB) PDF (179 kB) Info Conference version
Tero Harju and Dirk Nowotka. Minimal Duval extensions. TUCS Tech. Rep. 520, Turku Centre of Computer Science, Finland, April 2003.	GZipped PostScript (80 kB) PDF (116 kB) Info Journal version
Tero Harjuand Dirk Nowotka. About Duval's conjecture. TUCS Tech. Rep. 514, Turku Centre of Computer Science, Finland, February 2003.	GZipped PostScript (94 kB) PDF (138 kB) Info Conference version
Thomas Reps, Stefan Schwoon, and Somesh Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. Technical Report TR-1470, Computer Sciences Department, University of Wisconsin, February 2003.	GZipped PostScript (261 kB) Info See www.fmi.uni-stuttgart.de ... Conference version, Journal version
Stefan Schwoon, Somesh Jha, Thomas Reps, and Stuart Stubblebine. On generalized authorization problems. Technical Report TR-1469, Computer Sciences Department, University of Wisconsin, January 2003.	GZipped PostScript (168 kB) Info See www.fmi.uni-stuttgart.de ... Conference version
2002
Tero Harju and Dirk Nowotka. Duval's conjecture and Lyndon words. TUCS Tech. Rep. 479, Turku Centre of Computer Science, Finland, 2002. Submitted.	GZipped PostScript (91 kB) PDF (139 kB) Info
2001
Tero Harju and Dirk Nowotka. Density of critical factorizations. TUCS Tech. Rep. 435, Turku Centre of Computer Science, Finland, December 2001.	GZipped PostScript (99 kB) PDF (149 kB) Info Journal version
Tero Harju and Dirk Nowotka. On the independence of equations in three variables. TUCS Tech. Rep. 432, Turku Centre of Computer Science, Finland, November 2001.	GZipped PostScript (148 kB) PDF (236 kB) Info Journal version
Javier Esparza, Antonín Kučera, and Stefan Schwoon. Model-checking LTL with regular valuations for pushdown systems. Informatics Research Report EDI-INF-RR-0044, University of Edinburgh, School of Informatics, August 2001.	PDF (224 kB) Info Conference version, Journal version
Markus Holzer and Stefan Schwoon. Assembling molecules in Atomix is hard. Technical Report TUM-I0101, Technische Universität München, May 2001.	GZipped PostScript (75 kB) Info Journal version
J. Esparza and K. Heljanko. Implementing LTL model checking with net unfoldings. Research Report A68, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2001.	GZipped PostScript (271 kB) PDF (281 kB) Info Conference version
2000
Javier Esparza, David Hansel, Peter Rossmanith, and Stefan Schwoon. Efficient algorithms for model checking pushdown systems. Technical Report TUM-I0002, SFB-Bericht 342/1/00 A, Technische Universität München, Institut für Informatik, February 2000.	GZipped PostScript (166 kB) Info Conference version
1998
C. Schröter, T. Engel, and C. Meinel. Internetbasiertes Arztbriefsystem. Technical Report Preprint 98-07, Institut für Telematik, Trier, Juli 1998.	Info
S. Hludov, C. Schröter, and C. Meinel. Adaptive Komprimierung von DICOM-Bildern. Technical Report Preprint 98-03, Institut für Telematik, Trier, März 1998.	Info
1995
P. Jancar and J. Esparza. Deciding finiteness of Petri nets up to bisimulation. SFB-Bericht Nr. 342/23/95A, TU München, 1995.	GZipped PostScript (356 kB) PDF (826 kB) Info Conference version, Journal version