Bild mit Unilogo
homeicon university sucheicon search siteicon sitemap kontakticon contact impressicon legal notice
unilogo University of Stuttgart 
Institute of Formal Methods in Computer Science

SZS - Publications in 2004

 

Barbara König. Analysis and verification of systems with dynamically evolving structures. Habilitation thesis, Universität Stuttgart, December 2004.
GZipped PostScript (998 kB)
PDF (1 MB)
Info
Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. In Alan Hu and Andy Martin, editors, Proceedings of the 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD'04), volume 3312 of Lecture Notes in Computer Science, pages 186–200. Springer, November 2004.
Info
See www.tcs.hut.fi ...
Tech report version
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
Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. In José Júlio Alferes and João Alexandre Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04), volume 3229 of Lecture Notes in Computer Science, pages 307–319, Lisbon, Portugal, September 2004. Springer.
Info
See www.tcs.hut.fi ...
Tech report 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 ...
Markus Holzer and Barbara König. Regular languages, sizes of syntactic monoids, graph colouring, state complexity results, and how these topics are related to each other. EATCS Bulletin, 83:139–155, June 2004. Appeared in The Formal Language Theory Column.
GZipped PostScript (74 kB)
PDF (140 kB)
Info
Markus Holzer and Stefan Schwoon. Reflections on Reflexion – computational complexity considerations on a puzzle game. In Paolo Ferragina and Roberto Grossi, editors, Proceedings of the Third International Conference on FUN with Algorithms, pages 90–105. Università di Pisa, May 2004.
GZipped PostScript (76 kB)
Info
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 ...
Markus Holzer and Stefan Schwoon. Assembling molecules in Atomix is hard. Theoretical Computer Science, 303(3):447–462, February 2004.
Info
Tech report version
Javier Esparza and Kousha Etessami. Verifying probabilistic procedural programs. In Proceedings of FSTTCS 2004, volume 3328 of LNCS, Lecture Notes in Computer Science, pages 16–31, 2004.
GZipped PostScript (92 kB)
PDF (243 kB)
Info
Ahmed Bouajjani, Javier Esparza, and Tayssir Touili. Reachability analysis of synchronized PA-systems. In Proceedings of Infinity 2004, 2004.
GZipped PostScript (71 kB)
PDF (174 kB)
Info
Journal version
Javier Esparza, Antonín Kučera, and Richard Mayr. Model checking probabilistic pushdown automata. In LICS 2004. IEEE Computer Society, 2004.
GZipped PostScript (86 kB)
PDF (204 kB)
Info
Tech report version, Journal version
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
J. Esparza. A polynomial-time algorithm for checking consistency of free-choice signal transition graphs. Fundamenta Informaticae, 62(2):197–220, 2004.
GZipped PostScript (129 kB)
PDF (182 kB)
Info
Conference version
Tobias Heindel. Encoding the -calculus into the calculus of explicit fusions, 2004. Dagstuhl Seminar: Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems.
Info
See www.dagstuhl.de ...
Paolo Baldan, Andrea Corradini, Barbara König, and Bernhard König. Verifying a behavioural logic for graph transformation systems. In Proc. of COMETA '03, volume 104 of ENTCS, pages 5–24. Elsevier, 2004.
GZipped PostScript (183 kB)
PDF (301 kB)
Info
Hartmut Ehrig and Barbara König. Deriving bisimulation congruences in the DPO approach to graph rewriting. In Proc. of FOSSACS '04, pages 151–166. Springer, 2004. LNCS 2987.
GZipped PostScript (130 kB)
PDF (311 kB)
Info
Tech report version
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size. Theoretical Computer Science, 327:319–347, 2004.
Info
Conference 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. Verifying finite-state graph grammars: an unfolding-based approach. In Proc. of CONCUR '04, pages 83–98. Springer-Verlag, 2004. LNCS 3170.
GZipped PostScript (139 kB)
PDF (231 kB)
Info
Tech report version
Paolo Baldan, Barbara König, and Ingo Stürmer. Generating test cases for code generators by unfolding graph transformation systems. In Proc. of ICGT '04 (International Conference on Graph Transformation), pages 194–209. Springer-Verlag, 2004. LNCS 3256.
GZipped PostScript (233 kB)
PDF (225 kB)
Info
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 ...
Herrman Gruber, Markus Holzer, Astrid Kiehn, and Barbara König. On timed automata with discrete time—structural and language theoretical characterization. In 14. Theorietag der GI-Fachgruppe 0.1.5 ``Automaten und Formale Sprachen''. Universität Potsdam, 2004.
Info
Matthias Hopf, Michael Luttenberger, and Thomas Ertl. Hierarchical splatting of scattered 4d data. IEEE Computer Graphics and Applications, 24(04):64–72, 2004.
Info
Michael Luttenberger. Effiziente Berechnung optimaler Strategien für Paritätsspiele. Master's thesis, Universität Stuttgart, 2004. In German.
Info
Tero Harju and Dirk Nowotka. Periodicity and unbordered words. In STACS 2004 (Montpellier), volume 2996 of Lecture Notes in Comput. Sci., pages 294–304, Berlin, 2004. Springer-Verlag.
GZipped PostScript (67 kB)
PDF (119 kB)
Info
Tech report version
Tero Harju and Dirk Nowotka. The equation in a free semigroup. Semigroup Forum, 68(3):488–490, 2004.
GZipped PostScript (40 kB)
PDF (70 kB)
Info
Tech report version
Tero Harju and Dirk Nowotka. Minimal Duval extensions. Internat. J.,Found. Comput. Sci., 15(2):349–354, 2004.
GZipped PostScript (53 kB)
PDF (94 kB)
Info
Tech report version
Tero Harju and Dirk Nowotka. Border correlation of binary words. J. Combin. Theory, Ser A, 108(2):331–341, 2004.
GZipped PostScript (150 kB)
PDF (140 kB)
Info
Tech report version
Dirk Nowotka. Periodicity and unbordered factors of words. PhD thesis, University of Turku, 2004.
GZipped PostScript (414 kB)
PDF (545 kB)
Info
C. Schröter and V. Khomenko. Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings. In R. Alur and D. A. Peled, editors, Proceedings of the 16th International Conference on Computer Aided Verification (CAV'04), volume 3114 of Lecture Notes in Computer Science, pages 109–121. Springer-Verlag, 2004.
GZipped PostScript (190 kB)
Info
Keijo Heljanko and Alin Stefanescu. Complexity results for checking distributed implementability. Technical Report 05/2004, Universität Stuttgart, 2004.
PDF (324 kB)
Info
Slides 
Dejvuth Suwimonteerabuth. Verifying Java bytecode with the Moped model checker. Master's thesis, Universität Stuttgart, 2004.
GZipped PostScript (227 kB)
Info
See www.fmi.uni-stuttgart.de ...