Helmut Seidl

Inf. Process. Lett., February, 2024

Functionality of compositions of top-down tree transducers is decidable.

[BibT_eX]

[DOI]

Martin Vu

Inf. Comput., January, 2024

Prenex universal first-order safety properties.

[BibT_eX]

[DOI]

Besik Dundua

Ioane Kapanadze

Inf. Process. Lett., 2024

Partial Correctness of the Top-Down Solver.

[BibT_eX]

[DOI]

Yannick Stade

Sarah Tilscher

Johanna Franziska Schinabeck

Arch. Formal Proofs, 2024

Correctness Witness Validation by Abstract Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Goblint: Abstract Interpretation for Memory Safety and Termination - (Competition Contribution).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Goblint Validator: Correctness Witness Validation by Abstract Interpretation - (Competition Contribution).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

When to Stop Going Down the Rabbit Hole: Taming Context-Sensitivity on the Fly.

[BibT_eX]

[DOI]

Julian Erhard

Michael Schwarz

Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, 2024

The Top-Down Solver Verified: Building Confidence in Static Analyzers.

[BibT_eX]

[DOI]

Yannick Stade

Sarah Tilscher

Proceedings of the Computer Aided Verification - 36th International Conference, 2024

2-Pointer Logic.

[BibT_eX]

[DOI]

Proceedings of the Taming the Infinities of Concurrency, 2024

2023

Goblint at SV-COMP 2024.

[BibT_eX]

[DOI]

Dataset, November, 2023

Goblint at SV-COMP 2024.

[BibT_eX]

[DOI]

Dataset, November, 2023

Goblint at SV-COMP 2024.

[BibT_eX]

[DOI]

Dataset, November, 2023

Goblint at SV-COMP 2024.

[BibT_eX]

[DOI]

Dataset, November, 2023

Goblint at SV-COMP 2024.

[BibT_eX]

[DOI]

Dataset, November, 2023

Goblint at SV-COMP 2024.

[BibT_eX]

[DOI]

Dataset, November, 2023

Correctness Witness Validation by Abstract Interpretation.

[BibT_eX]

[DOI]

Dataset, August, 2023

Deciding origin equivalence of weakly self-nesting macro tree transducers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

Definability Results for Top-Down Tree Transducers.

[BibT_eX]

[DOI]

Martin Vu

Int. J. Found. Comput. Sci., 2023

Goblint: Autotuning Thread-Modular Abstract Interpretation - (Competition Contribution).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Octagons Revisited - Elegant Proofs and Simplified Algorithms.

[BibT_eX]

[DOI]

Michael Schwarz

Proceedings of the Static Analysis - 30th International Symposium, 2023

When Long Jumps Fall Short: Control-Flow Tracking and Misuse Detection for Non-local Jumps in C.

[BibT_eX]

[DOI]

Proceedings of the 12th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, 2023

Clustered Relational Thread-Modular Abstract Interpretation with Local Traces.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2023

2022

Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap.

[BibT_eX]

[DOI]

CoRR, 2022

How to Decide Functionality of Compositions of Top-Down Tree Transducers.

[BibT_eX]

[DOI]

Martin Vu

Proceedings of the Algebraic Informatics - 9th International Conference, 2022

2021

Three improvements to the top-down solver.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2021

On the Balancedness of Tree-to-Word Transducers.

[BibT_eX]

[DOI]

Raphaela Löbel

Michael Luttenberger

Int. J. Found. Comput. Sci., 2021

Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints - (Competition Contribution).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

Improving Thread-Modular Abstract Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 28th International Symposium, 2021

2020

How to Win First-Order Safety Games.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Stratified Guarded First-Order Transition Systems.

[BibT_eX]

[DOI]

Christan Müller

Proceedings of the Static Analysis - 27th International Symposium, 2020

Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis.

[BibT_eX]

[DOI]

Anastasiia Izycheva

Eva Darulova

Proceedings of the Static Analysis - 27th International Symposium, 2020

When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Equivalence of Linear Tree Transducers with Output in the Free Group.

[BibT_eX]

[DOI]

Raphaela Löbel

Michael Luttenberger

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

Incremental Abstract Interpretation.

[BibT_eX]

[DOI]

Julian Erhard

Proceedings of the From Lambda Calculus to Cybersecurity Through Program Analysis, 2020

2019

How to Win First Order Safety Games - Software Artifact.

[BibT_eX]

[DOI]

Dataset, October, 2019

How to Win First Order Safety Games - Software Artifact.

[BibT_eX]

[DOI]

Dataset, October, 2019

Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time.

[BibT_eX]

[DOI]

Raphaela Palenta

Proceedings of the Foundations of Software Science and Computation Structures, 2019

Synthesizing Efficient Low-Precision Kernels.

[BibT_eX]

[DOI]

Anastasiia Izycheva

Eva Darulova

Proceedings of the Automated Technology for Verification and Analysis, 2019

2018

Paths, tree homomorphisms and disequalities for -clauses.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable.

[BibT_eX]

[DOI]

Gregor Kemper

J. ACM, 2018

Balancedness of MSO transductions in polynomial time.

[BibT_eX]

[DOI]

Stefan Schulze Frielinghaus

Inf. Process. Lett., 2018

Enforcing termination of interprocedural analysis.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2018

Computing the Longest Common Prefix of a Context-free Language in Polynomial Time.

[BibT_eX]

[DOI]

Michael Luttenberger

Raphaela Palenta

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Inductive Invariants for Noninterference in Multi-agent Workflows.

[BibT_eX]

[DOI]

Stefan Schulze Frielinghaus

Eugen Zalinescu

Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017

Inter-procedural Two-Variable Herbrand Equalities.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2017

Formal Methods of Transformations (Dagstuhl Seminar 17142).

[BibT_eX]

[DOI]

Emmanuel Filiot

Dagstuhl Reports, 2017

Reachability for Dynamic Parametric Processes.

[BibT_eX]

[DOI]

Anca Muscholl

Igor Walukiewicz

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Verifying Security Policies in Multi-agent Workflows with Loops.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Equivalence - Combinatorics, Algebra, Proofs.

[BibT_eX]

[DOI]

Proceedings of the Dependable Software Systems Engineering, 2016

Look-ahead removal for total deterministic top-down tree transducers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Efficiently intertwining widening and narrowing.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2016

Static race detection for device drivers: the Goblint approach.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, 2016

Enhancing Top-Down Solving with Widening and Narrowing.

[BibT_eX]

[DOI]

Proceedings of the Semantics, Logics, and Calculi, 2016

Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2016

2015

Transforming XML Streams with References.

[BibT_eX]

[DOI]

Alberto Ordóñez Pereira

Proceedings of the String Processing and Information Retrieval, 2015

An Analysis of Universal Information Flow Based on Self-Composition.

[BibT_eX]

[DOI]

Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

2014

Frameworks for Interprocedural Analysis of Concurrent Programs.

[BibT_eX]

[DOI]

Proceedings of the Software Systems Safety, 2014

Numerical invariants through convex relaxation and max-strategy iteration.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2014

Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

Parametric Strategy Iteration.

[BibT_eX]

[DOI]

Martin D. Schwarz

Proceedings of the 6th International Symposium on Symbolic Computation in Software Science, 2014

Interprocedural Information Flow Analysis of XML Processors.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

How to Remove the Look-Ahead of Top-Down Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2013

Look-Ahead Removal for Top-Down Tree Transducers.

[BibT_eX]

[DOI]

CoRR, 2013

Contextual Locking for Dynamic Pushdown Networks.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 20th International Symposium, 2013

How to combine widening and narrowing for non-monotonic systems of equations.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Relational abstract interpretation for the verification of 2-hypersafety properties.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Compiler Design - Syntactic and Semantic Analysis.

[BibT_eX]

[DOI]

Sebastian Hack

Springer, ISBN: 978-3-642-17539-8, 2013

2012

Precise Program Analysis through Strategy Iteration and Optimization.

[BibT_eX]

[DOI]

Proceedings of the Software Safety and Security - Tools for Analysis and Verification, 2012

Abstract interpretation meets convex optimization.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

Model Checking Information Flow in Reactive Systems.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Extending ${\cal H}_1$ -Clauses with Path Disequalities.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Runtime Enforcement of Information Flow Security in Tree Manipulating Processes.

[BibT_eX]

[DOI]

Proceedings of the Engineering Secure Software and Systems - 4th International Symposium, 2012

Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

Type Checking of Tree Walking Transducers.

[BibT_eX]

[DOI]

Sylvia Friese

Proceedings of the Modern Applications of Automata Theory., 2012

Compiler Design - Analysis and Transformation.

[BibT_eX]

[DOI]

Sebastian Hack

Springer, ISBN: 978-3-642-17547-3, 2012

2011

Solving systems of rational equations through strategy iteration.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2011

Fast interprocedural linear two-variable equalities.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2011

Extending H1-clauses with disequalities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Earliest Normal Form and Minimization for Bottom-up Tree Transducers.

[BibT_eX]

[DOI]

Sylvia Friese

Int. J. Found. Comput. Sci., 2011

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

Side-Effect Analysis of Assembly Code.

[BibT_eX]

[DOI]

Andrea Flexeder

Proceedings of the Static Analysis - 18th International Symposium, 2011

Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

2010

Praktische Programmverifikation durch statische Analyse.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Shape Analysis of Low-Level C with Overlapping Structures.

[BibT_eX]

[DOI]

Jörg Kreiker

Proceedings of the Verification, 2010

Normalization of Linear Horn Clauses.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods: Foundations and Applications, 2010

Verifying a Local Generic Solver in Coq.

[BibT_eX]

[DOI]

Martin Hofmann

Aleksandr Karbyshev

Proceedings of the Static Analysis - 17th International Symposium, 2010

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 17th International Symposium, 2010

Bottom-Up Tree Automata with Term Constraints.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

What Is a Pure Functional?

[BibT_eX]

[DOI]

Martin Hofmann

Aleksandr Karbyshev

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Minimization of Deterministic Bottom-Up Tree Transducers.

[BibT_eX]

[DOI]

Sylvia Friese

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Abstract Interpretation over Zones without Widening.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Invariant Generation, 2010

Interprocedural Control Flow Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

Compiler Design - Virtual Machines.

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-642-14908-5, 2010

2009

Deciding equivalence of top-down XML transformations in polynomial time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Program Analysis through Finite Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2009

Region Analysis for Race Detection.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 16th International Symposium, 2009

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis.

[BibT_eX]

[DOI]

Varmo Vene

Proceedings of the FM 2009: Formal Methods, 2009

Games through Nested Fixpoints.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 21st International Conference, 2009

Polynomial Precise Interval Analysis Revisited.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

2008

Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2008

Analysing All Polynomial Equations in .

[BibT_eX]

[DOI]

Andrea Flexeder

Proceedings of the Static Analysis, 15th International Symposium, 2008

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Lightweight Verification 2008.

[BibT_eX]

[DOI]

Martin Leucker

Proceedings of the 38. Jahrestagung der Gesellschaft für Informatik, Beherrschbare Systeme, 2008

Precise Interval Analysis vs. Parity Games.

[BibT_eX]

[DOI]

Proceedings of the FM 2008: Formal Methods, 2008

Upper Adjoints for Fast Inter-procedural Variable Equalities.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2008

Counting in trees.

[BibT_eX]

Thomas Schwentick

Anca Muscholl

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Analysis of modular arithmetic.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2007

Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the PLAN-X 2007, 2007

Interprocedurally Analysing Linear Inequality Relations.

[BibT_eX]

[DOI]

Andrea Flexeder

Proceedings of the Programming Languages and Systems, 2007

Precise Fixpoint Computation Through Strategy Iteration.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2007

Precise Relational Invariants Through Strategy Iteration.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Computing Game Values for Crash Games.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2007

2006

Exact XML Type Checking in Polynomial Time.

[BibT_eX]

Thomas Perst

Universität Trier, Mathematik/Informatik, Forschungsbericht, 2006

Infinite-state high-level MSCs: Model-checking and realizability.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Interprocedurally Analyzing Polynomial Identities.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.

[BibT_eX]

[DOI]

Proceedings of the Program Analysis and Compilation, 2006

2005

Checking Herbrand Equalities and Beyond.

[BibT_eX]

[DOI]

Oliver Rüthing

Proceedings of the Verification, 2005

A Generic Framework for Interprocedural Analysis of Numerical Properties.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 12th International Symposium, 2005

XML type checking with macro tree transducers.

[BibT_eX]

[DOI]

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Interprocedural Herbrand Equalities.

[BibT_eX]

[DOI]

Bernhard Steffen

Proceedings of the Programming Languages and Systems, 2005

On the Complexity of Equational Horn Clauses.

[BibT_eX]

[DOI]

Thomas Schwentick

Proceedings of the Automated Deduction, 2005

2004

Binary Queries for Document Trees.

[BibT_eX]

Alexandru Berlea

Nord. J. Comput., 2004

Macro forest transducers.

[BibT_eX]

[DOI]

Thomas Perst

Inf. Process. Lett., 2004

Computing polynomial program invariants.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

The Succinct Solver Suite.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Precise interprocedural analysis through linear algebra.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

A Generic Framework for Interprocedural Analyses of Numerical Properties.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2004

Counting in Trees for Free.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

A Note on Karr's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Annotiertes Lecture Recording.

[BibT_eX]

[DOI]

Peter Ziewer

Proceedings of the DeLFI 2004: Die e-Learning Fachtagung Informatik, 2004

2003

(Linear) Algebra for Program Analysis Dynamische Programmanalyse.

[BibT_eX]

[DOI]

Softwaretechnik-Trends, 2003

Numerical document queries.

[BibT_eX]

[DOI]

Thomas Schwentick

Anca Muscholl

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

2002

On the Expressiveness of Tree Set Operators

[BibT_eX]

Aditya V. Nori

Universität Trier, Mathematik/Informatik, Forschungsbericht, 2002

Interprocedural Invariants

[BibT_eX]

Varmo Vene

Universität Trier, Mathematik/Informatik, Forschungsbericht, 2002

Polynomial Constants are Decidable

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 2002

A Succinct Solver for ALFP.

[BibT_eX]

Nord. J. Comput., 2002

Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 9th International Symposium, 2002

A Type-safe Macro System for XML.

[BibT_eX]

[DOI]

Thomas Perst

Proceedings of the Extreme Markup Languages® 2002 Conference, 2002

Binary Queries.

[BibT_eX]

[DOI]

Alexandru Berlea

Proceedings of the Extreme Markup Languages® 2002 Conference, 2002

Automatic Complexity Analysis.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2002

Transparent teleteaching.

[BibT_eX]

Peter Ziewer

Proceedings of the Winds of Changing in the Sea of Learning, 2002

2001

Succinct Solvers

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 2001

Cryptographic Analysis in Cubic Time.

[BibT_eX]

[DOI]

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

On optimal slicing of parallel programs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Weakly Regular Relations and Applications.

[BibT_eX]

[DOI]

Sébastien Limet

Pierre Réty

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Synchronized Tree Languages Revisited and New Applications.

[BibT_eX]

[DOI]

Valérie Gouranton

Pierre Réty

Proceedings of the Foundations of Software Science and Computation Structures, 2001

Control-Flow Analysis in Cubic Time.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2001

2000

Constraint-Based Inter-Procedural Analysis of Parallel Programs.

[BibT_eX]

Bernhard Steffen

Nord. J. Comput., 2000

Interprocedural Analyses: A Comparison.

[BibT_eX]

[DOI]

J. Log. Program., 2000

1999

The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations

[BibT_eX]

Craig Smith

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

A Faster Solver for General Systems of Equations.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1999

On distributive fixed-point expressions.

[BibT_eX]

[DOI]

Damian Niwinski

RAIRO Theor. Informatics Appl., 1999

On Guarding Nested Fixpoints.

[BibT_eX]

[DOI]

Andreas Neumann

Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998

ForkLight: A Control-Synchronous Parallel Programming Language

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Locating Matches of Tree Patterns in Forests

[BibT_eX]

Andreas Neumann

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Constraints to Stop Deforestation.

[BibT_eX]

[DOI]

Morten Heine Sørensen

Sci. Comput. Program., 1998

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.

[BibT_eX]

Nord. J. Comput., 1998

1997

Model-Checking for L2

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Interprocedural Analysis Based on PDAs

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

The Fork95 parallel programming language: Design, implementation, application.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1997

Disjuntive Completion Is Not "Optimal".

[BibT_eX]

Proceedings of the Logic Programming, 1997

Constraints to Stop Higher-Order Deforestation.

[BibT_eX]

[DOI]

Morten Heine Sørensen

Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

1996

An Even Faster Solver for General Systems of Equations

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Least and Greatest Solutions of Equations over N.

[BibT_eX]

Nord. J. Comput., 1996

Fast and Simple Nested Fixpoints.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

A Modal Mu-Calculus for Durational Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1996

Integer Constraints to Stop Deforestation.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 1996

1995

Language Support for Synchronous Parallel Critical Sections

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

A Modal µ-Calculus for Durational Transition Systems

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

1994

Finite Tree Automata with Cost Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Equivalence of Finite-Valued Tree Transducers Is Decidable.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1994

Haskell Overloading is DEXPTIME-Complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Tree Automata for Code Selection.

[BibT_eX]

[DOI]

Christian Ferdinand

Acta Informatica, 1994

Least Solutions of Equations over N.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

When Is a Functional Tree Transduction Deterministic?

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1992

Single-Valuedness of Tree Transducers is Decidable in Polynomial Time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

FORK: A high-level language for PRAMs.

[BibT_eX]

[DOI]

Torben Hagerup

Arno Schmitt

Future Gener. Comput. Syst., 1992

Baumautomaten zur Codeselektion.

[BibT_eX]

[DOI]

Christian Ferdinand

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

Ambiguity and valuedness.

[BibT_eX]

Proceedings of the Tree Automata and Languages., 1992

1991

On the Degree of Ambiguity of Finite Automata.

[BibT_eX]

[DOI]

Andreas Weber

Theor. Comput. Sci., 1991

On finitely generated monoids of matrices with entries in N.

[BibT_eX]

[DOI]

Andreas Weber

RAIRO Theor. Informatics Appl., 1991

1990

Deciding Equivalence of Finite Tree Automata.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.

[BibT_eX]

[DOI]

Andreas Goerdt

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the CAAP '90, 1990

1989

On the Finite Degree of Ambiguity of Finite Tree Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1989

1988

Parameter-Reduction of Higher Level Grammars (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the CAAP '88, 1988

1987

Parameter Reduction of Higher Level Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

1985

A quadratic regularity test for non-deleting macro S grammars.

[BibT_eX]

[DOI]