| How to Decide Functionality of Compositions of Top-Down Tree Transducers. | 0 | 0.34 | 2022 |
| Theoretical Aspects of Computing - ICTAC 2022 - 19th International Colloquium, Tbilisi, Georgia, September 27-29, 2022, Proceedings | 0 | 0.34 | 2022 |
| Improving Thread-Modular Abstract Interpretation | 0 | 0.34 | 2021 |
| Definability Results for Top-Down Tree Transducers. | 0 | 0.34 | 2021 |
| On The Balancedness Of Tree-To-Word Transducers | 0 | 0.34 | 2021 |
| Incremental Abstract Interpretation. | 1 | 0.35 | 2020 |
| Equivalence of Linear Tree Transducers with Output in the Free Group | 0 | 0.34 | 2020 |
| Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis. | 0 | 0.34 | 2020 |
| On the Balancedness of Tree-to-word Transducers | 0 | 0.34 | 2020 |
| When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? | 0 | 0.34 | 2020 |
| Stratified Guarded First-Order Transition Systems. | 0 | 0.34 | 2020 |
| Balancedness of MSO transductions in polynomial time. | 0 | 0.34 | 2018 |
| Paths, tree homomorphisms and disequalities for -clauses. | 0 | 0.34 | 2018 |
| Proving Absence of Starvation by Means of Abstract Interpretation and Model Checking. | 0 | 0.34 | 2017 |
| Formal Methods of Transformations (Dagstuhl Seminar 17142). | 0 | 0.34 | 2017 |
| Verifying Security Policies in Multi-agent Workflows with Loops. | 4 | 0.41 | 2017 |
| Reachability For Dynamic Parametric Processes | 0 | 0.34 | 2017 |
| Look-ahead removal for total deterministic top-down tree transducers | 0 | 0.34 | 2016 |
| Enhancing Top-Down Solving with Widening and Narrowing. | 1 | 0.35 | 2016 |
| Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents. | 3 | 0.41 | 2016 |
| Enforcing Termination of Interprocedural Analysis. | 2 | 0.36 | 2016 |
| Parametric Strategy Iteration. | 3 | 0.40 | 2014 |
| Parametric Strategy Iteration. | 0 | 0.34 | 2014 |
| Numerical Invariants through Convex Relaxation and Max-Strategy Iteration | 1 | 0.36 | 2014 |
| Precise Analysis Of Value-Dependent Synchronization In Priority Scheduled Programs | 6 | 0.60 | 2014 |
| Relational abstract interpretation for the verification of 2-hypersafety properties | 10 | 0.47 | 2013 |
| Look-Ahead Removal for Top-Down Tree Transducers. | 3 | 0.38 | 2013 |
| Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). | 1 | 0.35 | 2013 |
| Abstract interpretation meets convex optimization | 8 | 0.44 | 2012 |
| 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 | 29 | 1.28 | 2012 |
| Model checking information flow in reactive systems | 25 | 0.87 | 2012 |
| Crossing the syntactic barrier: hom-disequalities for H1-clauses | 0 | 0.34 | 2012 |
| Extending ${\cal H}_1$ -Clauses with Path Disequalities. | 0 | 0.34 | 2012 |
| Earliest Normal Form And Minimization For Bottom-Up Tree Transducers | 2 | 0.36 | 2011 |
| Side-effect analysis of assembly code | 5 | 0.46 | 2011 |
| Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation | 16 | 0.84 | 2011 |
| What is a pure functional? | 5 | 0.43 | 2010 |
| Bottom-up tree automata with term constraints | 2 | 0.44 | 2010 |
| Verifying a local generic solver in coq | 8 | 0.50 | 2010 |
| Computing relaxed abstract semantics w.r.t. quadratic zones precisely | 14 | 0.64 | 2010 |
| Normalization of linear horn clauses | 0 | 0.34 | 2010 |
| Praktische Programmverifikation durch statische Analyse | 0 | 0.34 | 2010 |
| Region Analysis for Race Detection | 12 | 0.60 | 2009 |
| Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case | 2 | 0.41 | 2009 |
| Program Analysis through Finite Tree Automata | 0 | 0.34 | 2009 |
| Games through Nested Fixpoints | 4 | 0.41 | 2009 |
| Upper adjoints for fast inter-procedural variable equalities | 6 | 0.45 | 2008 |
| A Distribution Law for CCS and a New Congruence Result for the pi-Calculus | 4 | 0.91 | 2008 |
| Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations | 10 | 0.71 | 2008 |
| Analysing All Polynomial Equations in | 0 | 0.34 | 2008 |
