Person: Helmut Seidl

DBLP: Seidl:Helmut

Facilitated 3 volumes:

Ed

Ed

Ed

Contributed to:

2015

2014

2014

2014

2013

2013

2012

2012

2012

2011

2011

2011

2010

2011

2010

2010

2010

2009

2009

2009

2009

2009

2008

2008

2008

2008

2007

2007

2005

2005

2005

2005

2005

2004

2004

2004

2003

2002

2002

2002

2001

2001

2001

2001

2000

1999

1998

1997

1997

1996

1996

1996

1994

2016

1993

2018

Wrote 61 papers:

ESOP-2015-FrielinghausPS #interprocedural

Inter-procedural Two-Variable Herbrand Equalities (SSF, MP, HS), pp. 457–482.

DLT-2014-EngelfrietMS #how #top-down #transducer

How to Remove the Look-Ahead of Top-Down Tree Transducers (JE, SM, HS), pp. 103–115.

LATA-2014-SeidlK #analysis #data flow #interprocedural #xml

Interprocedural Information Flow Analysis of XML Processors (HS, MK), pp. 34–61.

VMCAI-2014-SchwarzSVA #analysis #precise #source code

Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs (MDS, HS, VV, KA), pp. 21–38.

PLDI-2013-ApinisSV #equation #how

How to combine widening and narrowing for non-monotonic systems of equations (KA, HS, VV), pp. 377–386.

SAS-2013-LammichMSW #automaton #network

Contextual Locking for Dynamic Pushdown Networks (PL, MMO, HS, AW), pp. 477–498.

CIAA-2012-ReussS

Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses (AR, HS), pp. 301–312.

FoSSaCS-2012-SeidlR

Extending H₁-Clauses with Path Disequalities (HS, AR), pp. 165–179.

VMCAI-2012-DimitrovaFKRS #data flow #model checking

Model Checking Information Flow in Reactive Systems (RD, BF, MK, MNR, HS), pp. 169–185.

POPL-2011-SchwarzSVLM #protocol #source code #static analysis

Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol (MDS, HS, VV, PL, MMO), pp. 93–104.

SAS-2011-FlexederPS #analysis #assembly

Side-Effect Analysis of Assembly Code (AF, MP, HS), pp. 77–94.

VMCAI-2011-GawlitzaLMSW #analysis #concurrent #process #reachability #source code

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.

DLT-2010-FrieseSM #bottom-up #transducer

Minimization of Deterministic Bottom-Up Tree Transducers (SF, HS, SM), pp. 185–196.

DLT-J-2010-FrieseSM11 #bottom-up #normalisation #transducer

Earliest Normal Form and Minimization for Bottom-up Tree Transducers (SF, HS, SM), pp. 1607–1623.

ICALP-v2-2010-HofmannKS #functional #question #what

What Is a Pure Functional? (MH, AK, HS), pp. 199–210.

SAS-2010-GawlitzaS #polynomial #semantics

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely (TMG, HS), pp. 271–286.

SAS-2010-HofmannKS #coq #verification

Verifying a Local Generic Solver in Coq (MH, AK, HS), pp. 340–355.

VMCAI-2010-KreikerSV #analysis #c #low level

Shape Analysis of Low-Level C with Overlapping Structures (JK, HS, VV), pp. 214–230.

CAV-2009-GawlitzaS #fixpoint #game studies

Games through Nested Fixpoints (TG, HS), pp. 291–305.

CIAA-2009-Seidl #automaton #finite #program analysis

Program Analysis through Finite Tree Automata (HS), p. 3.

FM-2009-SeidlVV #alias #analysis #linear #polynomial

A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis (HS, VV, VV), pp. 644–659.

RTA-2009-SeidlV #protocol

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (HS, KNV), pp. 118–132.

SAS-2009-SeidlV #analysis #concurrent #detection

Region Analysis for Race Detection (HS, VV), pp. 171–187.

ESOP-2008-Muller-OlmS #interprocedural #performance

Upper Adjoints for Fast Inter-procedural Variable Equalities (MMO, HS), pp. 178–192.

FM-2008-GawlitzaS #analysis #game studies #precise

Precise Interval Analysis vs. Parity Games (TG, HS), pp. 342–357.

ICALP-A-2008-EsparzaGKS #approximate #equation

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (JE, TG, SK, HS), pp. 698–710.

SAS-2008-SeidlFP #equation #polynomial

Analysing All Polynomial Equations in ℤ₂ᵂ (HS, AF, MP), pp. 299–314.

CSL-2007-GawlitzaS #invariant #precise #relational

Precise Relational Invariants Through Strategy Iteration (TG, HS), pp. 23–40.

ESOP-2007-GawlitzaS #fixpoint #precise

Precise Fixpoint Computation Through Strategy Iteration (TG, HS), pp. 300–315.

ESOP-2007-SeidlFP #difference #linear

Interprocedurally Analysing Linear Inequality Relations (HS, AF, MP), pp. 284–299.

CADE-2005-VermaSS #complexity #equation #horn clause #on the

On the Complexity of Equational Horn Clauses (KNV, HS, TS), pp. 337–352.

ESOP-2005-Muller-OlmS #analysis #composition

Analysis of Modular Arithmetic (MMO, HS), pp. 46–60.

ESOP-2005-Muller-OlmSS #interprocedural

Interprocedural Herbrand Equalities (MMO, HS, BS), pp. 31–45.

PODS-2005-ManethBPS #metaprogramming #transducer #type checking #xml

XML type checking with macro tree transducers (SM, AB, TP, HS), pp. 283–294.

SAS-2005-Muller-OlmS #analysis #framework #interprocedural

A Generic Framework for Interprocedural Analysis of Numerical Properties (MMO, HS), pp. 235–250.

VMCAI-2005-Muller-OlmRS

Checking Herbrand Equalities and Beyond (MMO, OR, HS), pp. 79–96.

ICALP-2004-Muller-OlmS #algorithm

A Note on Karr’s Algorithm (MMO, HS), pp. 1016–1028.

ICALP-2004-SeidlSMH #for free

Counting in Trees for Free (HS, TS, AM, PH), pp. 1136–1149.

POPL-2004-Muller-OlmS #algebra #analysis #interprocedural #linear #precise

Precise interprocedural analysis through linear algebra (MMO, HS), pp. 330–341.

TACAS-2004-NielsonNSBHPS

The Succinct Solver Suite (FN, HRN, HS, MB, RRH, HP, HS), pp. 251–265.

PODS-2003-SeidlSM #documentation #query

Numerical document queries (HS, TS, AM), pp. 155–166.

ESOP-2002-NielsonNS #analysis #automation #complexity

Automatic Complexity Analysis (FN, HRN, HS), pp. 243–261.

ICALP-2002-GenestMSZ #infinity #model checking

Infinite-State High-Level MSCs: Model-Checking and Realizability (BG, AM, HS, MZ), pp. 657–668.

SAS-2002-Muller-OlmS #decidability #polynomial

Polynomial Constants Are Decidable (MMO, HS), pp. 4–19.

SAS-2002-NielsonNS #horn clause #normalisation

Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi (FN, HRN, HS), pp. 20–35.

ESOP-2001-NielsonS #analysis #control flow #polynomial

Control-Flow Analysis in Cubic Time (FN, HS), pp. 252–268.

FoSSaCS-2001-GourantonRS

Synchronized Tree Languages Revisited and New Applications (VG, PR, HS), pp. 214–229.

RTA-2001-LimetRS

Weakly Regular Relations and Applications (SL, PR, HS), pp. 185–200.

STOC-2001-Muller-OlmS #on the #parallel #slicing #source code

On optimal slicing of parallel programs (MMO, HS), pp. 647–656.

ESOP-2000-SeidlS #analysis #constraints #interprocedural #parallel #source code

Constraint-Based Inter-Procedural Analysis of Parallel Programs (HS, BS), pp. 351–365.

CSL-1999-SeidlN #fixpoint #on the

On Guarding Nested Fixpoints (HS, AN), pp. 484–498.

ESOP-1998-FechtS #algorithm #constraints #difference #fixpoint #performance

Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems (CF, HS), pp. 90–104.

ILPS-1997-SeidlF

Disjuntive Completion Is Not “Optimal” (HS, CF), p. 408.

POPL-1997-SeidlS #constraints #deforestation #higher-order

Constraints to Stop Higher-Order Deforestation (HS, MHS), pp. 400–413.

ESOP-1996-Seidl #constraints #deforestation #integer

Integer Constraints to Stop Deforestation (HS), pp. 326–340.

LICS-1996-Seidl #calculus #μ-calculus

A Modal μ-Calculus for Durational Transition Systems (HS), pp. 128–137.

SAS-1996-FechtS #equation #performance

An Even Faster Solver for General Systems of Equations (CF, HS), pp. 189–204.

ICALP-1994-Seidl #equation

Least Solutions of Equations over N (HS), pp. 400–411.

ASE-2016-VojdaniARSVV #approach #concurrent #detection

Static race detection for device drivers: the Goblint approach (VV, KA, VR, HS, VV, RV), pp. 391–402.

TAPSOFT-1993-Seidl #functional #question

When Is a Functional Tree Transduction Deterministic? (HS), pp. 251–265.

PPDP-2018-SeidlV #top-down

Three Improvements to the Top-Down Solver (HS, RV), p. 14.