Univ.-Prof. Dr. phil. nat. Helmut Seidl - Publikationen

Seidl, Helmut; Fecht, Christian
Interprocedural analyses: a comparison
The journal of logic programming. Bd. 43. H. 2. New York, NY: North-Holland 2000 S. 123 - 156

Seidl, Helmut; Steffen, Bernhard
Regular Papers - Constraint-Based Inter-Procedural Analysis of Parallel Programs
Lecture notes in computer science. Bd. 1782. Berlin: Springer 2000 S. 351 - 365

Fecht, C.; Seidl, H.
A faster solver for general systems of equations
Science of computer programming. Bd. 35. H. 2. Amsterdam [u.a.]: Elsevier 1999 S. 137 - 162

Seidl, H.; Neumann, A.
Contributed Papers - Linear Logic, Mu Calculus, Concurrency - On Guarding Nested Fixpoints
Lecture notes in computer science. Bd. 1683. Berlin: Springer 1999 S. 484 - 498

Seidl, H.; Niwinski, D.
On distributive fixed-point expressions
Theoretical informatics and applications. Bd. 33. H. 4. Cambridge, Mass.: EDP Sciences 1999 S. 427 - 446

Seidl, H.; Sørensen, M.H.
Constraints to stop deforestation
Science of computer programming. Bd. 32. H. 1. Amsterdam [u.a.]: Elsevier 1998 S. 73 - 108

Keßler, Christoph W.; Seidl, Helmut
ForkLight: a control-synchronous parallel programming language
Trier: Univ., Mathematik/Informatik 1998 18 S. (Trierer Forschungsberichte ; Nr. 98,13)

Neumann, Andreas; Seidl, Helmut
Locating matches of tree patterns in forests
Trier: Univ., Mathematik/Informatik 1998 18 S. (Trierer Forschungsberichte ; 98-08)

Seidl, H.; Fecht, C.
Disjunctive Completion Is Not "Optimal"
International Logic Programming Symposium (ILPS). 1997 S. 408

Seidl, Helmut; Fecht, Christian
Interprocedural analysis based on PDAs
Trier: Univ., Mathematik, Informatik 1997 0 S. (Trierer Forschungsberichte ; 97-06)

Seidl, Helmut; Fecht, Christian
Propagating differences : an efficient new fixpoint algorithm for distributive constraint systems
Trier: Univ., Fachbereich Mathematik, Informatik 1997 15 S. (Forschungsbericht ; 97-13)

Kessler, Christoph W.; Seidl, Helmut
The Fork95 Parallel Programming Language: Design, Implementation, Application
International journal of parallel programming. Bd. 25. H. 1. New York, N.Y.: Springer 1997

Fecht, Christian; Seidl, Helmut
An even faster solver for general systems of equations
Trier: Fachbereich IV, Mathematik, Informatik, Univ. 1996 15 S. (Trierer Forschungsberichte ; 96-11)

Seidl, H.
Fast and simple nested fixpoints
Information processing letters. devoted to the rapid publication of short contributions to information processing. Bd. 59. H. 6. Amsterdam [u.a.]: Elsevier 1996 S. 303 - 308

Seidl, H.
Integer Constraints to Stop Deforestation
Lecture notes in computer science. Bd. 1058. Berlin: Springer 1996 S. 326 - 340

Seidl, Helmut
A modal m-calculus  for durational transition systems
Trier: Univ., Mathematik/Informatik 1995 16 S. (Forschungsbericht ; 95-08)

Keßler, Christoph W.; Seidl, Helmut
Integrating synchronous and asynchronous paradigms : the Fork95 parallel programming language
Trier: Fachbereich IV, Mathematik/Informatik, Univ. 1995 11 S. (Trierer Forschungsberichte ; 95,5)

Keßler, Christoph W.; Seidl, Helmut
Language support for synchronous parallel critical sections
Trier: Univ., Mathematik/Informatik 1995 12 S. (Forschungsbericht ; 95-23)

Seidl, H.
Equivalence of Finite-Valued Tree Transducers Is Decidable
Mathematical systems theory. Bd. 27. H. 4. New York, NY: Springer 1994 S. 285 - 346

Seidl, H.
Finite tree automata with cost functions
Theoretical computer science. the journal of the EATCS. Bd. 126. H. 1. Amsterdam [u.a.]: Elsevier 1994

Seidl, H.
Haskell overloading is DEXPTIME-complete
Information processing letters. devoted to the rapid publication of short contributions to information processing. Bd. 52. H. 2. Amsterdam [u.a.]: Elsevier 1994 S. 57 - 60

Ferdinand, C.; Seidl, H.; Wilhelm, R.
Tree automata for code selection
Acta informatica. Bd. 31. H. 8. Berlin: Springer 1994 S. 741 - 760

Seidl, Helmut
Least solutions of equations over N
Saarbrücken: Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelität 1993 15 S. (Preprint ; 1993,8)