Thomas Gawlitza

Affiliations:
  • Technical University Munich, Germany


According to our database1, Thomas Gawlitza authored at least 21 papers between 2007 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Numerical invariants through convex relaxation and max-strategy iteration.
Formal Methods Syst. Des., 2014

Parametric Strategy Iteration.
Proceedings of the 6th International Symposium on Symbolic Computation in Software Science, 2014

2012
Precise Program Analysis through Strategy Iteration and Optimization.
Proceedings of the Software Safety and Security - Tools for Analysis and Verification, 2012

Abstract interpretation meets convex optimization.
J. Symb. Comput., 2012

Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs
Log. Methods Comput. Sci., 2012

2011
Solving systems of rational equations through strategy iteration.
ACM Trans. Program. Lang. Syst., 2011

Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

Improving Strategies via SMT Solving.
Proceedings of the Programming Languages and Systems, 2011

Discretizing Affine Hybrid Automata with Uncertainty.
Proceedings of the Automated Technology for Verification and Analysis, 2011

Template-Based Unbounded Time Verification of Affine Hybrid Automata.
Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010
Normalization of Linear Horn Clauses.
Proceedings of the Formal Methods: Foundations and Applications, 2010

Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.
Proceedings of the Static Analysis - 17th International Symposium, 2010

Abstract Interpretation over Zones without Widening.
Proceedings of the Second International Workshop on Invariant Generation, 2010

2009
Strategieverbesserungsalgorithmen für exakte Programmanalysen.
PhD thesis, 2009

Games through Nested Fixpoints.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

Polynomial Precise Interval Analysis Revisited.
Proceedings of the Efficient Algorithms, 2009

2008
Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Precise Interval Analysis vs. Parity Games.
Proceedings of the FM 2008: Formal Methods, 2008

2007
Precise Fixpoint Computation Through Strategy Iteration.
Proceedings of the Programming Languages and Systems, 2007

Precise Relational Invariants Through Strategy Iteration.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Computing Game Values for Crash Games.
Proceedings of the Automated Technology for Verification and Analysis, 2007


  Loading...