Tue, 01 Apr 2025 01:00:00 +0200
Stratified guarded first-order transition systems.
Wed, 01 Jan 2025 00:00:00 +0100
Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts.
Sat, 01 Mar 2025 00:00:00 +0100
When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
Tue, 01 Apr 2025 01:00:00 +0200
Taking out the Toxic Trash: Recovering Precision in Mixed Flow-Sensitive Static Analyses.
Tue, 01 Apr 2025 01:00:00 +0200
Dead Gate Elimination.
Mon, 01 Jan 2024 00:00:00 +0100
Partial Correctness of the Top-Down Solver.
Mon, 01 Jan 2024 00:00:00 +0100
Functionality of compositions of top-down tree transducers is decidable.
Thu, 01 Feb 2024 00:00:00 +0100
Checking in polynomial time whether or not a regular tree language is deterministic top-down.
Mon, 01 Jan 2024 00:00:00 +0100
Prenex universal first-order safety properties.
Thu, 01 Aug 2024 01:00:00 +0200
Non-numerical weakly relational domains.
Tue, 01 Oct 2024 01:00:00 +0200
When long jumps fall short: control-flow tracking and misuse detection for nonlocal jumps in C.
Sun, 01 Dec 2024 00:00:00 +0100
Interactive abstract interpretation: reanalyzing multithreaded C programs for cheap.
Mon, 01 Jan 2024 00:00:00 +0100
2-Pointer Logic.
Mon, 01 Jan 2024 00:00:00 +0100
The Top-Down Solver Verified: Building Confidence in Static Analyzers.
Mon, 01 Jan 2024 00:00:00 +0100
C-2PO: A Weakly Relational Pointer Domain: "These Are Not the Memory Cells You Are Looking For".
Mon, 01 Jan 2024 00:00:00 +0100
When to Stop Going Down the Rabbit Hole: Taming Context-Sensitivity on the Fly.
Mon, 01 Jan 2024 00:00:00 +0100
Goblint Validator: Correctness Witness Validation by Abstract Interpretation - (Competition Contribution).
Mon, 01 Jan 2024 00:00:00 +0100
Goblint: Abstract Interpretation for Memory Safety and Termination - (Competition Contribution).
Mon, 01 Jan 2024 00:00:00 +0100
Correctness Witness Validation by Abstract Interpretation.
Thu, 01 Aug 2024 01:00:00 +0200
C-2PO: A Weakly Relational Pointer Domain.
Mon, 01 Jan 2024 00:00:00 +0100
Non-Numerical Weakly Relational Domains.
Mon, 01 Jan 2024 00:00:00 +0100
Correctness Witnesses for Concurrent Programs: Bridging the Semantic Divide with Ghosts (Extended Version).
Wed, 01 Feb 2023 00:00:00 +0100
Definability Results for Top-Down Tree Transducers.
Sun, 01 Jan 2023 00:00:00 +0100
Deciding origin equivalence of weakly self-nesting macro tree transducers.
Sun, 01 Jan 2023 00:00:00 +0100
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces.
Sun, 01 Jan 2023 00:00:00 +0100
When Long Jumps Fall Short: Control-Flow Tracking and Misuse Detection for Non-local Jumps in C.
Sun, 01 Jan 2023 00:00:00 +0100
Octagons Revisited - Elegant Proofs and Simplified Algorithms.
Sun, 01 Jan 2023 00:00:00 +0100
Goblint: Autotuning Thread-Modular Abstract Interpretation - (Competition Contribution).
Wed, 01 Nov 2023 00:00:00 +0100
Goblint at SV-COMP 2024.
Wed, 01 Nov 2023 00:00:00 +0100
Goblint at SV-COMP 2024.
Wed, 01 Nov 2023 00:00:00 +0100
Goblint at SV-COMP 2024.
Wed, 01 Nov 2023 00:00:00 +0100
Goblint at SV-COMP 2024.
Tue, 01 Aug 2023 01:00:00 +0200
Correctness Witness Validation by Abstract Interpretation.
Wed, 01 Nov 2023 00:00:00 +0100
Goblint at SV-COMP 2024.
Wed, 01 Nov 2023 00:00:00 +0100
Goblint at SV-COMP 2024.
Sun, 01 Jan 2023 00:00:00 +0100
Clustered Relational Thread-Modular Abstract Interpretation with Local Traces.
Sun, 01 Jan 2023 00:00:00 +0100
Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down.
Sun, 01 Jan 2023 00:00:00 +0100
Correctness Witness Validation by Abstract Interpretation.
Sat, 01 Jan 2022 00:00:00 +0100
How to Decide Functionality of Compositions of Top-Down Tree Transducers.
Sat, 01 Jan 2022 00:00:00 +0100
Theoretical Aspects of Computing - ICTAC 2022 - 19th International Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings.
Sat, 01 Jan 2022 00:00:00 +0100
How to decide Functionality of Compositions of Top-Down Tree Transducers.
Sat, 01 Jan 2022 00:00:00 +0100
Interactive Abstract Interpretation: Reanalyzing Whole Programs for Cheap.
Fri, 01 Jan 2021 00:00:00 +0100
On the Balancedness of Tree-to-Word Transducers.
Fri, 01 Jan 2021 00:00:00 +0100
Three improvements to the top-down solver.
Fri, 01 Jan 2021 00:00:00 +0100
Definability Results for Top-Down Tree Transducers.
Fri, 01 Jan 2021 00:00:00 +0100
Improving Thread-Modular Abstract Interpretation.
Fri, 01 Jan 2021 00:00:00 +0100
Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints - (Competition Contribution).
Fri, 01 Jan 2021 00:00:00 +0100
Definability Results for Top-Down Tree Transducers.
Fri, 01 Jan 2021 00:00:00 +0100
Improving Thread-Modular Abstract Interpretation.
Wed, 01 Jan 2020 00:00:00 +0100
Incremental Abstract Interpretation.
Wed, 01 Jan 2020 00:00:00 +0100
Equivalence of Linear Tree Transducers with Output in the Free Group.
Wed, 01 Jan 2020 00:00:00 +0100
On the Balancedness of Tree-to-Word Transducers.
Wed, 01 Jan 2020 00:00:00 +0100
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
Wed, 01 Jan 2020 00:00:00 +0100
Stratified Guarded First-Order Transition Systems.
Wed, 01 Jan 2020 00:00:00 +0100
Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis.
Wed, 01 Jan 2020 00:00:00 +0100
How to Win First-Order Safety Games.
Wed, 01 Jan 2020 00:00:00 +0100
Equivalence of Linear Tree Transducers with Output in the Free Group.
Tue, 01 Jan 2019 00:00:00 +0100
Synthesizing Efficient Low-Precision Kernels.
Tue, 01 Jan 2019 00:00:00 +0100
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time.
Tue, 01 Oct 2019 01:00:00 +0200
How to Win First Order Safety Games - Software Artifact.
Tue, 01 Oct 2019 01:00:00 +0200
How to Win First Order Safety Games - Software Artifact.
Tue, 01 Jan 2019 00:00:00 +0100
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time.
Tue, 01 Jan 2019 00:00:00 +0100
How to Win First-Order Safety Games.
Tue, 01 Jan 2019 00:00:00 +0100
On the Balancedness of Tree-to-word Transducers.
Mon, 01 Jan 2018 00:00:00 +0100
Enforcing termination of interprocedural analysis.
Mon, 01 Jan 2018 00:00:00 +0100
Balancedness of MSO transductions in polynomial time.
Mon, 01 Jan 2018 00:00:00 +0100
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable.
Mon, 01 Jan 2018 00:00:00 +0100
Paths, tree homomorphisms and disequalities for -clauses.
Mon, 01 Jan 2018 00:00:00 +0100
Inductive Invariants for Noninterference in Multi-agent Workflows.
Mon, 01 Jan 2018 00:00:00 +0100
Three Improvements to the Top-Down Solver.
Mon, 01 Jan 2018 00:00:00 +0100
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time.
Sun, 01 Jan 2017 00:00:00 +0100
Inter-procedural Two-Variable Herbrand Equalities.
Sun, 01 Jan 2017 00:00:00 +0100
Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking.
Sun, 01 Jan 2017 00:00:00 +0100
Verifying Security Policies in Multi-agent Workflows with Loops.
Sun, 01 Jan 2017 00:00:00 +0100
Reachability for Dynamic Parametric Processes.
Sun, 01 Jan 2017 00:00:00 +0100
Computing the longest common prefix of a context-free language in polynomial time.
Sun, 01 Jan 2017 00:00:00 +0100
Verifying Security Policies in Multi-agent Workflows with Loops.
Sun, 01 Jan 2017 00:00:00 +0100
Formal Methods of Transformations (Dagstuhl Seminar 17142).
Fri, 01 Jan 2016 00:00:00 +0100
Efficiently intertwining widening and narrowing.
Fri, 01 Jan 2016 00:00:00 +0100
Look-ahead removal for total deterministic top-down tree transducers.
Fri, 01 Jan 2016 00:00:00 +0100
Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents.
Fri, 01 Jan 2016 00:00:00 +0100
Enhancing Top-Down Solving with Widening and Narrowing.
Fri, 01 Jan 2016 00:00:00 +0100
Static race detection for device drivers: the Goblint approach.
Fri, 01 Jan 2016 00:00:00 +0100
Enforcing Termination of Interprocedural Analysis.
Fri, 01 Jan 2016 00:00:00 +0100
Equivalence - Combinatorics, Algebra, Proofs.
Fri, 01 Jan 2016 00:00:00 +0100
Enforcing Termination of Interprocedural Analysis.
Fri, 01 Jan 2016 00:00:00 +0100
Reachability for dynamic parametric processes.
Thu, 01 Jan 2015 00:00:00 +0100
An Analysis of Universal Information Flow Based on Self-Composition.
Thu, 01 Jan 2015 00:00:00 +0100
Inter-procedural Two-Variable Herbrand Equalities.
Thu, 01 Jan 2015 00:00:00 +0100
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
Thu, 01 Jan 2015 00:00:00 +0100
Transforming XML Streams with References.
Thu, 01 Jan 2015 00:00:00 +0100
Efficiently intertwining widening and narrowing.
Thu, 01 Jan 2015 00:00:00 +0100
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable.
Wed, 01 Jan 2014 00:00:00 +0100
Numerical invariants through convex relaxation and max-strategy iteration.
Wed, 01 Jan 2014 00:00:00 +0100
How to Remove the Look-Ahead of Top-Down Tree Transducers.
Wed, 01 Jan 2014 00:00:00 +0100
Interprocedural Information Flow Analysis of XML Processors.
Wed, 01 Jan 2014 00:00:00 +0100
Parametric Strategy Iteration.
Wed, 01 Jan 2014 00:00:00 +0100
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs.
Wed, 01 Jan 2014 00:00:00 +0100
Frameworks for Interprocedural Analysis of Concurrent Programs.
Wed, 01 Jan 2014 00:00:00 +0100
Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings.
Wed, 01 Jan 2014 00:00:00 +0100
Software Systems Safety.
Wed, 01 Jan 2014 00:00:00 +0100
Parametric Strategy Iteration.
Wed, 01 Jan 2014 00:00:00 +0100
Inter-procedural Two-Variable Herbrand Equalities.
Tue, 01 Jan 2013 00:00:00 +0100
Compiler Design - Syntactic and Semantic Analysis.
Tue, 01 Jan 2013 00:00:00 +0100
Relational abstract interpretation for the verification of 2-hypersafety properties.
Tue, 01 Jan 2013 00:00:00 +0100
How to combine widening and narrowing for non-monotonic systems of equations.
Tue, 01 Jan 2013 00:00:00 +0100
Contextual Locking for Dynamic Pushdown Networks.
Tue, 01 Jan 2013 00:00:00 +0100
Look-Ahead Removal for Top-Down Tree Transducers.
Tue, 01 Jan 2013 00:00:00 +0100
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192).
Sun, 01 Jan 2012 00:00:00 +0100
Compiler Design - Analysis and Transformation.
Sun, 01 Jan 2012 00:00:00 +0100
Abstract interpretation meets convex optimization.
Sun, 01 Jan 2012 00:00:00 +0100
Side-Effecting Constraint Systems: A Swiss Army Knife for Program Analysis.
Sun, 01 Jan 2012 00:00:00 +0100
Runtime Enforcement of Information Flow Security in Tree Manipulating Processes.
Sun, 01 Jan 2012 00:00:00 +0100
Extending ${\cal H}_1$ -Clauses with Path Disequalities.
Sun, 01 Jan 2012 00:00:00 +0100
Model Checking Information Flow in Reactive Systems.
Sun, 01 Jan 2012 00:00:00 +0100
Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses.
Sun, 01 Jan 2012 00:00:00 +0100
Type Checking of Tree Walking Transducers.
Sun, 01 Jan 2012 00:00:00 +0100
Precise Program Analysis through Strategy Iteration and Optimization.
Sun, 01 Jan 2012 00:00:00 +0100
Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings.
Sun, 01 Jan 2012 00:00:00 +0100
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration.
Sat, 01 Jan 2011 00:00:00 +0100
Earliest Normal Form and Minimization for Bottom-up Tree Transducers.
Sat, 01 Jan 2011 00:00:00 +0100
Extending H1-clauses with disequalities.
Sat, 01 Jan 2011 00:00:00 +0100
Solving systems of rational equations through strategy iteration.
Sat, 01 Jan 2011 00:00:00 +0100
Fast interprocedural linear two-variable equalities.
Sat, 01 Jan 2011 00:00:00 +0100
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol.
Sat, 01 Jan 2011 00:00:00 +0100
Side-Effect Analysis of Assembly Code.
Sat, 01 Jan 2011 00:00:00 +0100
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation.
Fri, 01 Jan 2010 00:00:00 +0100
Compiler Design - Virtual Machines.
Fri, 01 Jan 2010 00:00:00 +0100
Praktische Programmverifikation durch statische Analyse.
Fri, 01 Jan 2010 00:00:00 +0100
Interprocedural Control Flow Reconstruction.
Fri, 01 Jan 2010 00:00:00 +0100
Abstract Interpretation over Zones without Widening.
Fri, 01 Jan 2010 00:00:00 +0100
Minimization of Deterministic Bottom-Up Tree Transducers.
Fri, 01 Jan 2010 00:00:00 +0100
What Is a Pure Functional?
Fri, 01 Jan 2010 00:00:00 +0100
Bottom-Up Tree Automata with Term Constraints.
Fri, 01 Jan 2010 00:00:00 +0100
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.
Fri, 01 Jan 2010 00:00:00 +0100
Verifying a Local Generic Solver in Coq.
Fri, 01 Jan 2010 00:00:00 +0100
Normalization of Linear Horn Clauses.
Fri, 01 Jan 2010 00:00:00 +0100
Shape Analysis of Low-Level C with Overlapping Structures.
Thu, 01 Jan 2009 00:00:00 +0100
Deciding equivalence of top-down XML transformations in polynomial time.
Thu, 01 Jan 2009 00:00:00 +0100
Polynomial Precise Interval Analysis Revisited.
Thu, 01 Jan 2009 00:00:00 +0100
Games through Nested Fixpoints.
Thu, 01 Jan 2009 00:00:00 +0100
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis.
Thu, 01 Jan 2009 00:00:00 +0100
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case.
Thu, 01 Jan 2009 00:00:00 +0100
Region Analysis for Race Detection.
Thu, 01 Jan 2009 00:00:00 +0100
Program Analysis through Finite Tree Automata.
Tue, 01 Jan 2008 00:00:00 +0100
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.
Tue, 01 Jan 2008 00:00:00 +0100
Counting in trees.
Tue, 01 Jan 2008 00:00:00 +0100
Upper Adjoints for Fast Inter-procedural Variable Equalities.
Tue, 01 Jan 2008 00:00:00 +0100
Precise Interval Analysis vs. Parity Games.
Tue, 01 Jan 2008 00:00:00 +0100
Lightweight Verification 2008.
Tue, 01 Jan 2008 00:00:00 +0100
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
Tue, 01 Jan 2008 00:00:00 +0100
Analysing All Polynomial Equations in .
Mon, 01 Jan 2007 00:00:00 +0100
Analysis of modular arithmetic.
Mon, 01 Jan 2007 00:00:00 +0100
Computing Game Values for Crash Games.
Mon, 01 Jan 2007 00:00:00 +0100
Precise Relational Invariants Through Strategy Iteration.
Mon, 01 Jan 2007 00:00:00 +0100
Interprocedurally Analysing Linear Inequality Relations.
Mon, 01 Jan 2007 00:00:00 +0100
Precise Fixpoint Computation Through Strategy Iteration.
Mon, 01 Jan 2007 00:00:00 +0100
Exact XML Type Checking in Polynomial Time.
Mon, 01 Jan 2007 00:00:00 +0100
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time.
Mon, 01 Jan 2007 00:00:00 +0100
Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings.
Sun, 01 Jan 2006 00:00:00 +0100
Infinite-state high-level MSCs: Model-checking and realizability.
Sun, 01 Jan 2006 00:00:00 +0100
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses.
Sun, 01 Jan 2006 00:00:00 +0100
Interprocedurally Analyzing Polynomial Identities.
Sun, 01 Jan 2006 00:00:00 +0100
Exact XML Type Checking in Polynomial Time.
Sat, 01 Jan 2005 00:00:00 +0100
On the Complexity of Equational Horn Clauses.
Sat, 01 Jan 2005 00:00:00 +0100
Interprocedural Herbrand Equalities.
Sat, 01 Jan 2005 00:00:00 +0100
Analysis of Modular Arithmetic.
Sat, 01 Jan 2005 00:00:00 +0100
XML type checking with macro tree transducers.
Sat, 01 Jan 2005 00:00:00 +0100
A Generic Framework for Interprocedural Analysis of Numerical Properties.
Sat, 01 Jan 2005 00:00:00 +0100
Checking Herbrand Equalities and Beyond.
Sat, 01 Jan 2005 00:00:00 +0100
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
Thu, 01 Jan 2004 00:00:00 +0100
Macro forest transducers.
Thu, 01 Jan 2004 00:00:00 +0100
Computing polynomial program invariants.
Thu, 01 Jan 2004 00:00:00 +0100
Binary Queries for Document Trees.
Thu, 01 Jan 2004 00:00:00 +0100
Annotiertes Lecture Recording.
Thu, 01 Jan 2004 00:00:00 +0100
A Note on Karr's Algorithm.
Thu, 01 Jan 2004 00:00:00 +0100
Counting in Trees for Free.
Thu, 01 Jan 2004 00:00:00 +0100
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.
Thu, 01 Jan 2004 00:00:00 +0100
A Generic Framework for Interprocedural Analyses of Numerical Properties.
Thu, 01 Jan 2004 00:00:00 +0100
Precise interprocedural analysis through linear algebra.
Thu, 01 Jan 2004 00:00:00 +0100
The Succinct Solver Suite.
Wed, 01 Jan 2003 00:00:00 +0100
(Linear) Algebra for Program Analysis Dynamische Programmanalyse.
Wed, 01 Jan 2003 00:00:00 +0100
Numerical document queries.
Tue, 01 Jan 2002 00:00:00 +0100
A Succinct Solver for ALFP.
Tue, 01 Jan 2002 00:00:00 +0100
Transparent teleteaching.
Tue, 01 Jan 2002 00:00:00 +0100
Automatic Complexity Analysis.
Tue, 01 Jan 2002 00:00:00 +0100
Binary Queries.
Tue, 01 Jan 2002 00:00:00 +0100
A Type-safe Macro System for XML.
Tue, 01 Jan 2002 00:00:00 +0100
Infinite-State High-Level MSCs: Model-Checking and Realizability.
Tue, 01 Jan 2002 00:00:00 +0100
Polynomial Constants Are Decidable.
Tue, 01 Jan 2002 00:00:00 +0100
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.
Tue, 01 Jan 2002 00:00:00 +0100
Polynomial Constants are Decidable.
Tue, 01 Jan 2002 00:00:00 +0100
Interprocedural Invariants.
Tue, 01 Jan 2002 00:00:00 +0100
On the Expressiveness of Tree Set Operators.
Mon, 01 Jan 2001 00:00:00 +0100
Control-Flow Analysis in Cubic Time.
Mon, 01 Jan 2001 00:00:00 +0100
Synchronized Tree Languages Revisited and New Applications.
Mon, 01 Jan 2001 00:00:00 +0100
Weakly Regular Relations and Applications.
Mon, 01 Jan 2001 00:00:00 +0100
On optimal slicing of parallel programs.
Mon, 01 Jan 2001 00:00:00 +0100
Cryptographic Analysis in Cubic Time.
Mon, 01 Jan 2001 00:00:00 +0100
Succinct Solvers.
Sat, 01 Jan 2000 00:00:00 +0100
Interprocedural Analyses: A Comparison.
Sat, 01 Jan 2000 00:00:00 +0100
Constraint-Based Inter-Procedural Analysis of Parallel Programs.
Sat, 01 Jan 2000 00:00:00 +0100
Constraint-Based Inter-Procedural Analysis of Parallel Programs.
Fri, 01 Jan 1999 00:00:00 +0100
On distributive fixed-point expressions.
Fri, 01 Jan 1999 00:00:00 +0100
A Faster Solver for General Systems of Equations.
Fri, 01 Jan 1999 00:00:00 +0100
On Guarding Nested Fixpoints.
Fri, 01 Jan 1999 00:00:00 +0100
ForkLight: A Control-Synchronous Parallel Programming Language.
Fri, 01 Jan 1999 00:00:00 +0100
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations.
Thu, 01 Jan 1998 00:00:00 +0100
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Thu, 01 Jan 1998 00:00:00 +0100
Constraints to Stop Deforestation.
Thu, 01 Jan 1998 00:00:00 +0100
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Thu, 01 Jan 1998 00:00:00 +0100
Locating Matches of Tree Patterns in Forests.
Thu, 01 Jan 1998 00:00:00 +0100
Locating Matches of Tree Patterns in Forests.
Thu, 01 Jan 1998 00:00:00 +0100
ForkLight: A Control-Synchronous Parallel Programming Language.
Wed, 01 Jan 1997 00:00:00 +0100
The Fork95 parallel programming language: Design, implementation, application.
Wed, 01 Jan 1997 00:00:00 +0100
Language Support for Synchronous Parallel Critical Sections.
Wed, 01 Jan 1997 00:00:00 +0100
Constraints to Stop Higher-Order Deforestation.
Wed, 01 Jan 1997 00:00:00 +0100
Disjuntive Completion Is Not "Optimal".
Wed, 01 Jan 1997 00:00:00 +0100
Interprocedural Analysis Based on PDAs.
Wed, 01 Jan 1997 00:00:00 +0100
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems.
Wed, 01 Jan 1997 00:00:00 +0100
Model-Checking for L2.
Mon, 01 Jan 1996 00:00:00 +0100
Fast and Simple Nested Fixpoints.
Mon, 01 Jan 1996 00:00:00 +0100
Least and Greatest Solutions of Equations over N.
Mon, 01 Jan 1996 00:00:00 +0100
Integer Constraints to Stop Deforestation.
Mon, 01 Jan 1996 00:00:00 +0100
A Modal Mu-Calculus for Durational Transition Systems.
Mon, 01 Jan 1996 00:00:00 +0100
An Even Faster Solver for General Systems of Equations.
Mon, 01 Jan 1996 00:00:00 +0100
Fast and Simple Nested Fixpoints.
Mon, 01 Jan 1996 00:00:00 +0100
An Even Faster Solver for General Systems of Equations.
Sun, 01 Jan 1995 00:00:00 +0100
Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language.
Sun, 01 Jan 1995 00:00:00 +0100
A Modal µ-Calculus for Durational Transition Systems.
Sun, 01 Jan 1995 00:00:00 +0100
Language Support for Synchronous Parallel Critical Sections.
Sat, 01 Jan 1994 00:00:00 +0100
Tree Automata for Code Selection.
Sat, 01 Jan 1994 00:00:00 +0100
Haskell Overloading is DEXPTIME-Complete.
Sat, 01 Jan 1994 00:00:00 +0100
Equivalence of Finite-Valued Tree Transducers Is Decidable.
Sat, 01 Jan 1994 00:00:00 +0100
Finite Tree Automata with Cost Functions.
Sat, 01 Jan 1994 00:00:00 +0100
Least Solutions of Equations over N.
Fri, 01 Jan 1993 00:00:00 +0100
When Is a Functional Tree Transduction Deterministic?
Wed, 01 Jan 1992 00:00:00 +0100
FORK: A high-level language for PRAMs.
Wed, 01 Jan 1992 00:00:00 +0100
Single-Valuedness of Tree Transducers is Decidable in Polynomial Time.
Wed, 01 Jan 1992 00:00:00 +0100
Finite Tree Automata with Cost Functions.
Wed, 01 Jan 1992 00:00:00 +0100
Ambiguity and valuedness.
Wed, 01 Jan 1992 00:00:00 +0100
Baumautomaten zur Codeselektion.
Tue, 01 Jan 1991 00:00:00 +0100
On finitely generated monoids of matrices with entries in N.
Tue, 01 Jan 1991 00:00:00 +0100
On the Degree of Ambiguity of Finite Automata.
Tue, 01 Jan 1991 00:00:00 +0100
Tree Automata for Code Selection.
Tue, 01 Jan 1991 00:00:00 +0100
FORK: A High-Level Language for PRAMs.
Mon, 01 Jan 1990 00:00:00 +0100
Deciding Equivalence of Finite Tree Automata.
Mon, 01 Jan 1990 00:00:00 +0100
Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.
Mon, 01 Jan 1990 00:00:00 +0100
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.
Sun, 01 Jan 1989 00:00:00 +0100
On the Finite Degree of Ambiguity of Finite Tree Automata.
Sun, 01 Jan 1989 00:00:00 +0100
On the Finite Degree of Ambiguity of Finite Tree Automata.
Sun, 01 Jan 1989 00:00:00 +0100
Deciding Equivalence of Finite Tree Automata.
Fri, 01 Jan 1988 00:00:00 +0100
Parameter-Reduction of Higher Level Grammars (Extended Abstract).
Thu, 01 Jan 1987 00:00:00 +0100
Parameter Reduction of Higher Level Grammars.
Wed, 01 Jan 1986 00:00:00 +0100
On the Degree of Ambiguity of Finite Automata.
Tue, 01 Jan 1985 00:00:00 +0100