The following pages link to Helmut Seidl (Q435967):
Displayed 50 items.
- Abstract interpretation meets convex optimization (Q435969) (← links)
- The Fork95 programming language: Design, implementation, application. (Q676263) (← links)
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- Definability results for top-down tree transducers (Q832950) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Macro forest transducers (Q1029068) (← links)
- Parameter-reduction of higher level grammars (Q1099634) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- Finite tree automata with cost functions (Q1325851) (← links)
- Haskell overloading is DEXPTIME-complete (Q1336737) (← links)
- Tree automata for code selection (Q1342507) (← links)
- Fast and simple nested fixpoints (Q1350911) (← links)
- (Q1705699) (redirect page) (← links)
- Balancedness of MSO transductions in polynomial time (Q1705700) (← links)
- A faster solver for general systems of equations (Q1818073) (← links)
- On the finite degree of ambiguity of finite tree automata (Q1825038) (← links)
- Extending \(H_1\)-clauses with disequalities (Q1944188) (← links)
- Improving thread-modular abstract interpretation (Q2145342) (← links)
- Stratified guarded first-order transition systems (Q2233528) (← links)
- Counterexample- and simulation-guided floating-point loop invariant synthesis (Q2233532) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- Deciding equivalence of separated non-nested attribute systems in polynomial time (Q2289099) (← links)
- Computing polynomial program invariants (Q2390319) (← links)
- Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
- (Q2712587) (← links)
- (Q2763677) (← links)
- (Q2771057) (← links)
- (Q2778878) (← links)
- Enhancing Top-Down Solving with Widening and Narrowing (Q2796229) (← links)
- Inter-procedural Two-Variable Herbrand Equalities (Q2802449) (← links)
- Cryptographic Analysis in Cubic Time (Q2841271) (← links)
- Model Checking Information Flow in Reactive Systems (Q2891409) (← links)
- Extending ${\cal H}_1$ -Clauses with Path Disequalities (Q2892769) (← links)
- EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS (Q2909099) (← links)
- Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses (Q2914718) (← links)
- How to Remove the Look-Ahead of Top-Down Tree Transducers (Q2921978) (← links)
- Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs (Q2938059) (← links)
- Reachability for Dynamic Parametric Processes (Q2961580) (← links)
- Normalization of Linear Horn Clauses (Q2999324) (← links)
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (Q3075482) (← links)
- (Q3086934) (← links)
- (Q3092707) (← links)
- Transforming XML Documents using fxt (Q3150023) (← links)
- Incremental Abstract Interpretation (Q3297840) (← links)
- (Q3304147) (← links)
- Region Analysis for Race Detection (Q3392925) (← links)
- Precise interprocedural analysis through linear algebra (Q3452271) (← links)
- Deciding Equivalence of Finite Tree Automata (Q3477969) (← links)