@phdthesis{8934,
  abstract     = {In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.
We use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades.},
  author       = {Goharshady, Amir Kafshdar},
  issn         = {2663-337X},
  pages        = {278},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Parameterized and algebro-geometric advances in static program analysis}},
  doi          = {10.15479/AT:ISTA:8934},
  year         = {2021},
}