EDBT 2026 Demo / reviewers in the wild / expert
Thomas Gawlitza
dblp:17/3701 · also Thomas Martin Gawlitza
· DBLP profile ↗
13ranked-venue papers
10as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 10 · 8 first-authorTheory of computation · 5 · 4 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
4 papers |
Algorithmic game theory and mechanism design · 49% Logic in computer science · 35% Approximation and online algorithms · 16% | |
| Software engineering, system software, and programming languages
2 papers |
Program analysis · 100% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis › static analysis
abstract interpretation |
0.2 | 2 | 2011 | Solving systems of rational equations through strategy iteration · ACM Trans. Program. Lang. Syst. 2011 Precise Interval Analysis vs. Parity Games · FM 2008 |
Program analysis › static analysis › abstract interpretation
fixpoint computation |
0.1 | 1 | 2011 | Solving systems of rational equations through strategy iteration · ACM Trans. Program. Lang. Syst. 2011 |
Logic in computer science
fixpoint logic |
0.1 | 1 | 2009 | Games through Nested Fixpoints · CAV 2009 |
Program analysis › static analysis › abstract interpretation
interval analysis |
0.1 | 1 | 2008 | Precise Interval Analysis vs. Parity Games · FM 2008 |
Approximation and online algorithms
approximation algorithms |
0.1 | 1 | 2008 | Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations · ICALP (1) 2008 |
Algorithmic game theory and mechanism design › zero-sum game
parity games |
0.1 | 1 | 2008 | Precise Interval Analysis vs. Parity Games · FM 2008 |
Algorithmic game theory and mechanism design
stochastic games |
0.0 | 1 | 2011 | Solving systems of rational equations through strategy iteration · ACM Trans. Program. Lang. Syst. 2011 |
Algorithmic game theory and mechanism design
strategy improvement |
0.0 | 1 | 2011 | Solving systems of rational equations through strategy iteration · ACM Trans. Program. Lang. Syst. 2011 |
Methods — techniques the papers use, named apart from their topics
strategy iteration · 0.2rational equation systems · 0.2parity games · 0.2interval analysis · 0.2nested fixpoints · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Numerical invariants through convex relaxation and max-strategy iteration
Thomas Gawlitza, Helmut Seidl |
Formal Methods Syst. Des. | 1 |
| 2012 | Abstract interpretation meets convex optimization
Thomas Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert, Eric Goubault |
J. Symb. Comput. | 1 |
| 2011 | Template-Based Unbounded Time Verification of Affine Hybrid Automata
Thao Dang 0001, Thomas Gawlitza |
APLAS | 2 |
| 2011 | Discretizing Affine Hybrid Automata with Uncertainty
Thao Dang 0001, Thomas Gawlitza |
ATVA | 2 |
| 2011 | Improving Strategies via SMT Solving
Thomas Gawlitza, David Monniaux |
ESOP | 1 |
| 2011 | Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
Thomas Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner |
VMCAI | 1 |
| 2011 | Solving systems of rational equations through strategy iterationabstractWe present practical algorithms for computing exact least solutions of equation systems over the reals with addition, multiplication by positive constants, minimum and maximum. The algorithms are based on strategy iteration. Our algorithms can, for instance, be used for the analysis of recursive stochastic games. In the present article we apply our techniques for computing abstract least fixpoint semantics of affine programs over the relational template polyhedra domain. In particular, we thus obtain practical algorithms for computing abstract least fixpoint semantics over the abstract domains of intervals, zones, and octagons. Thomas Gawlitza, Helmut Seidl |
ACM Trans. Program. Lang. Syst. | 1 |
| 2010 | Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely
Thomas Gawlitza, Helmut Seidl |
SAS | 1 |
| 2009 | Games through Nested Fixpoints
Thomas Gawlitza, Helmut Seidl |
CAV | 1 |
| 2008 | Precise Interval Analysis vs. Parity Games
Thomas Gawlitza, Helmut Seidl |
FM | 1 |
| 2008 | Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl |
ICALP (1) | 2 |
| 2007 | Computing Game Values for Crash Games
Thomas Gawlitza, Helmut Seidl |
ATVA | 1 |
| 2007 | Precise Fixpoint Computation Through Strategy Iteration
Thomas Gawlitza, Helmut Seidl |
ESOP | 1 |