|
Javier Esparza, Antonín Kučera, and Stefan Schwoon. Model-checking LTL with regular valuations for pushdown systems. Information and Computation, 186(2):355–376, November 2003. |
|
Tero Harju and Dirk Nowotka. The equation  in a free semigroup. TUCS Tech. Rep. 561, Turku Centre of Computer Science, Finland, October 2003. |
|
|
Alin Stefanescu, Javier Esparza, and Anca Muscholl. Synthesis of distributed algorithms using asynchronous automata. In R. Amadio and D. Lugiez, editors, Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761, pages 27–41. Springer, September 2003. |
|
|
Tero Harju and Dirk Nowotka. About Duval extensions. In T. Harju and J. Karhumäki, editors, WORDS 2003 (Turku), volume 27 of TUCS General Publications, pages 392–397, Finland, August 2003. Turku Centre of Computer Science. |
|
|
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. |
|
|
Tero Harju and Dirk Nowotka. Border correlation of binary words. TUCS Tech. Rep. 546, Turku Centre of Computer Science, Finland, August 2003. |
|
|
Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. In Ofer Strichman and Armin Biere, editors, Electronic Notes in Theoretical Computer Science, volume 89. Elsevier, July 2003. |
|
|
Stefan Kiefer. Die Menge der virtuellen Verbindungen im Spiel Hex ist PSPACE-vollständig. Studienarbeit Nr. 1887, Universität Stuttgart, Juli 2003. In German. |
|
|
J. Esparza. A polynomial-time algorithm for checking consistency of free-choice signal transition graphs. In Balarin J. Lilius, F and R.J. Machado, editors, Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), pages 61–70, Guimaraes, Portugal, June 2003. IEEE Computer Society. ISBN 0-7695-1887-7. |
|
|
Tuomo Pyhälä and Keijo Heljanko. Specification coverage aided test selection. In Johan Lilius, Felice Balarin, and Ricardo J. Machado, editors, Proceeding of the 3rd International Conference on Application of Concurrency to System Design (ACSD'2003), pages 187–195, Guimaraes, Portugal, June 2003. IEEE Computer Society. |
|
|
Thomas Reps, Stefan Schwoon, and Somesh Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. In Radhia Cousot, editor, Proceedings of the 10th International Static Analysis Symposium, volume 2694 of Lecture Notes in Computer Science, pages 189–213. Springer, June 2003. |
|
|
Stefan Schwoon, Somesh Jha, Thomas Reps, and Stuart Stubblebine. On generalized authorization problems. In Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW), pages 202–218. IEEE Computer Society, June 2003. |
|
|
Claus Schröter, Stefan Schwoon, and Javier Esparza. The Model-Checking Kit. In Wil van der Aalst and Eike Best, editors, Applications and Theory of Petri Nets 2003, volume 2679 of Lecture Notes in Computer Science, pages 463–472. Springer, June 2003. |
|
|
Tero Harju and Dirk Nowotka. Periodicity and unbordered words. TUCS Tech. Rep. 523, Turku Centre of Computer Science, Finland, April 2003. Submitted. |
|
|
Tero Harju and Dirk Nowotka. Minimal Duval extensions. TUCS Tech. Rep. 520, Turku Centre of Computer Science, Finland, April 2003. |
|
|
Wilfried Brauer, Markus Holzer, Barbara König, and Stefan Schwoon. The theory of finite-state adventures. EATCS Bulletin, 79:230–237, February 2003. |
|
|
Tero Harjuand Dirk Nowotka. About Duval's conjecture. TUCS Tech. Rep. 514, Turku Centre of Computer Science, Finland, February 2003. |
|
|
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. |
|
|
A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In Proc. of the 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '03, 2003. |
|
|
A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. International Journal on Foundations of Computer Science, 14(4):551–582, 2003. |
|
|
J. Esparza and M. Maidl. Simple representative instantiations for multicast protocols. In H. Garavel and J. Hatcliff, editors, Proc. of TACAS'03, number 2619 in Lecture Notes in Computer Science, pages 128–143. Springer-Verlag, 2003. |
|
|
A. Kučera and J. Esparza. A logical viewpoint on process-algebraic quotients. Journal of Logic and Computation, 13(6):863–880, 2003. |
|
Tobias Heindel. Cyclic  -graph reduction, call-by-need, and their process semantics. Master's thesis, Eberhard Karls Universität Tübingen, 2003. |
|
|
Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming (TPLP), 3(4&5):519–550, 2003. Also available as (CoRR: arXiv:cs.LO/0305040). |
|
|
Paolo Baldan, Andrea Corradini, and Barbara König. Unfolding-based verification for graph transformation systems. In Proc. of UniGra '03: Uniform Approaches to Graphical Specification Techniques (Warsaw), 2003. |
|
|
Paolo Baldan, Barbara König, and Bernhard König. A logic for analyzing abstractions of graph transformation systems. In Proc. of SAS '03 (International Static Analysis Symposium), pages 255–272. Springer-Verlag, 2003. LNCS 2694. |
|
|
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size, continued. In Proc. of DLT '03 (Developments in Language Theory), pages 349–360. Springer-Verlag, 2003. LNCS 2710. |
|
|
Tero Harju and Dirk Nowotka. On the independence of equations in three variables. Theoret. Comput. Sci., 307(1):139–172, 2003. |
|
|
Tero Harju and Dirk Nowotka. Periodicity and unbordered segments of words. Bull. EATCS, 80:162–167, 2003. |
|
|
Tero Harju and Dirk Nowotka. About Duval's conjecture. In Z. Esik and Z. Fülöp, editors, DLT 2003 (Szeged), volume 2710 of Lecture Notes in Comput. Sci., pages 316–324, Berlin, 2003. Springer-Verlag. |
|
|
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. |
|
bibdb) |
© University of Stuttgart |
legal notice