default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Gawlitza
Person information
- affiliation: Technical University Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j4]Thomas Martin Gawlitza, Helmut Seidl:
Numerical invariants through convex relaxation and max-strategy iteration. Formal Methods Syst. Des. 44(2): 101-148 (2014)- [c15]Helmut Seidl, Thomas Martin Gawlitza, Martin D. Schwarz:
Parametric Strategy Iteration. SCSS 2014: 62-76 - [i3]Thomas Martin Gawlitza, Martin D. Schwarz, Helmut Seidl:
Parametric Strategy Iteration. CoRR abs/1406.5457 (2014) - 2012
- [j3]Thomas Martin Gawlitza, David Monniaux:
Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs. Log. Methods Comput. Sci. 8(3) (2012) - [j2]Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stéphane Gaubert, Eric Goubault:
Abstract interpretation meets convex optimization. J. Symb. Comput. 47(12): 1416-1446 (2012) - [p1]Thomas Martin Gawlitza, Helmut Seidl:
Precise Program Analysis through Strategy Iteration and Optimization. Software Safety and Security 2012: 348-384 - [i2]Thomas Martin Gawlitza, Helmut Seidl:
Numerical Invariants through Convex Relaxation and Max-Strategy Iteration. CoRR abs/1204.1147 (2012) - 2011
- [j1]Thomas Martin Gawlitza, Helmut Seidl:
Solving systems of rational equations through strategy iteration. ACM Trans. Program. Lang. Syst. 33(3): 11:1-11:48 (2011) - [c14]Thao Dang, Thomas Martin Gawlitza:
Template-Based Unbounded Time Verification of Affine Hybrid Automata. APLAS 2011: 34-49 - [c13]Thao Dang, Thomas Martin Gawlitza:
Discretizing Affine Hybrid Automata with Uncertainty. ATVA 2011: 473-481 - [c12]Thomas Martin Gawlitza, David Monniaux
:
Improving Strategies via SMT Solving. ESOP 2011: 236-255 - [c11]Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. VMCAI 2011: 199-213 - [i1]Thomas Martin Gawlitza, David Monniaux:
Improving Strategies via SMT Solving. CoRR abs/1101.2812 (2011) - 2010
- [c10]Thomas Martin Gawlitza, Helmut Seidl:
Abstract Interpretation over Zones without Widening. WING@ETAPS/IJCAR 2010: 12-43 - [c9]Thomas Martin Gawlitza, Helmut Seidl:
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. SAS 2010: 271-286 - [c8]Thomas Martin Gawlitza, Helmut Seidl, Kumar Neeraj Verma:
Normalization of Linear Horn Clauses. SBMF 2010: 242-257
2000 – 2009
- 2009
- [b1]Thomas Martin Gawlitza:
Strategieverbesserungsalgorithmen für exakte Programmanalysen. Technical University Munich, Verlag Dr. Hut 2009, ISBN 978-3-86853-243-2, pp. 1-293 - [c7]Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm:
Polynomial Precise Interval Analysis Revisited. Efficient Algorithms 2009: 422-437 - [c6]Thomas Gawlitza, Helmut Seidl:
Games through Nested Fixpoints. CAV 2009: 291-305 - 2008
- [c5]Thomas Gawlitza, Helmut Seidl:
Precise Interval Analysis vs. Parity Games. FM 2008: 342-357 - [c4]Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl:
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) 2008: 698-710 - 2007
- [c3]Thomas Gawlitza, Helmut Seidl:
Computing Game Values for Crash Games. ATVA 2007: 177-191 - [c2]Thomas Gawlitza, Helmut Seidl:
Precise Relational Invariants Through Strategy Iteration. CSL 2007: 23-40 - [c1]Thomas Gawlitza, Helmut Seidl:
Precise Fixpoint Computation Through Strategy Iteration. ESOP 2007: 300-315
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
