---
res:
  bibo_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.\r\nWe 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.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Amir Kafshdar
      foaf_name: Goharshady, Amir Kafshdar
      foaf_surname: Goharshady
      foaf_workInfoHomepage: http://www.librecat.org/personId=391365CE-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0003-1702-6584
  bibo_doi: 10.15479/AT:ISTA:8934
  dct_date: 2021^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2663-337X
  dct_language: eng
  dct_publisher: Institute of Science and Technology Austria@
  dct_title: Parameterized and algebro-geometric advances in static program analysis@
...