Andreas Pavlogiannis
Home
Research
Teaching
Publications

Andreas Pavlogiannis

Andreas Pavlogiannis 

Andreas Pavlogiannis
PhD, IST Austria

Assistant Professor
Programming Languages group
Department of Computer Science
Aarhus University

DIGIT Automated Verification and Synthesis

CV, DBLP, Google Scholar

 Contact:
lastname@cs.au.dk
Turing-223
IT-parken, Aabogade 34
DK-8200 Aarhus N, Denmark

Research Interests


formal methods, algorithmic verification, automata theory, foundations of model checking, concurrency, static & dynamic program analysis
population dynamics, evolutionary graph theory, evolutionary game theory

Umang and I are giving a tutorial on new theory and practice for Dynamic Race Prediction.
Tune in on ASPLOS 2021.

I have positions for motivated PhD students in algorithmic verification. Interested applicants are encouraged to contact me with a CV and a short description of interests.
Refer to our PhD program for applications.

I have openings for internships (flexible). Drop me an email if interested.

Teaching

Talent Track Course (Spring 2020, Fall 2020, Spring 2021)

Algorithmic Model Checking (from Spring 2022, with Jaco van de Pol)

Advanced Topics in Programming Language Theory (from Fall 2022, with Bas Spitters and Amin Timany)

Publications

  • 2021

    • Tight Bounds for Reachability Problems on One-Counter and Pushdown Systems
      J. C. Hansen, A. H. Kjelstrom and A. Pavlogiannis
      IPL (pdf)

    • Stateless Model Checking under a Reads-Value-From Equivalence
      P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis and V. Toman
      CAV 2021 (pdf)

    • Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
      K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis
      FMSD 2021 (pdf)

    • Optimal Prediction of Synchronization-Preserving Races
      U. Mathur, A. Pavlogiannis and M. Viswanathan
      POPL 2021 (pdf) (slides)

    • The Fine-Grained and Parallel Complexity of Andersen's Pointer Analysis
      A. A. Mathiasen, A. Pavlogiannis
      POPL 2021 (pdf) (slides)

  • 2020

    • Precedence-aware Automated Competitive Analysis of Real-time Scheduling
      A. Pavlogiannis, N. Schaumberger, U. Schmid and K. Chatterjee
      EMSOFT 2020 (pdf) (slides)

    • Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth
      A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi and A. Pavlogiannis
      ATVA 2020 (pdf, video)

    • The Complexity of Dynamic Data Race Prediction
      U. Mathur, A. Pavlogiannis and M. Viswanathan
      LICS 2020 (pdf) (slides)

    • Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis
      K. Chatterjee, A. Kafshdar Goharshady, R. Ibsen-Jensen and A. Pavlogiannis
      ESOP 2020 (pdf)

    • Fast, Sound, and Effectively Complete Dynamic Race Prediction
      A. Pavlogiannis
      POPL 2020 (pdf)(slides)

    • Limits on Amplifiers of Natural Selection under death-Birth Updating
      J. Tkadlec*, A. Pavlogiannis*, K. Chatterjee, M. A. Nowak
      PLoS Comput Biol (pdf) (suppl)

  • 2019

    • Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
      K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis
      TOPLAS (pdf)

    • Value-Centric Dynamic Partial Order Reduction
      K. Chatterjee, A. Pavlogiannis, V. Toman
      OOPSLA 2019 (pdf)(slides)

    • Efficient Parameterized Algorithms for Data Packing
      K. Chatterjee, A. K. Goharshady, N. Okati, A. Pavlogiannis
      POPL 2019 (pdf)

    • Population structure determines the tradeoff between fixation probability and fixation time
      J. Tkadlec*, A. Pavlogiannis*, K. Chatterjee, Martin A. Nowak
      Comms Bio (pdf) (suppl)

  • 2018

    • Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory
      A. Pavlogiannis*, J. Tkadlec*, K. Chatterjee, Martin A. Nowak
      Comms Bio (pdf) (suppl) (suppl-long) (Quanta) (Wired) (Com Bio Highlights)

    • Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
      K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis
      TOPLAS (pdf)

    • Data-centric Dynamic Partial Order Reduction
      M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya
      POPL 2018 (pdf) (slides)

    • Optimal Dyck Reachability for Data-dependence and Alias Analysis
      K. Chatterjee, B. Choudhary, A. Pavlogiannis
      POPL 2018 (pdf) (slides)

    • Automated Competitive Analysis of Real-time Scheduling with Graphs and Games
      K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid
      RTS (pdf)

  • 2017

    • JTDec: A Tool for Tree Decompositions in Soot
      K. Chatterjee, A. K. Goharshady, A. Pavlogiannis
      ATVA 2017 (pdf)

    • Amplification on Undirected Population Structures: Comets Beat Stars
      A. Pavlogiannis*, J. Tkadlec*, K. Chatterjee, Martin A. Nowak
      Sci Rep (pdf) (suppl)

    • Faster Algorithms for Weighted Recursive State Machines
      K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis
      ESOP 2017 (pdf)

  • 2016

    • Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
      K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis
      ESA 2016 (pdf) (slides)

    • Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
      K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis
      POPL 2016 (pdf) (slides)

  • 2015

    • Cellular Cooperation with Shift Updating and Repulsion
      A. Pavlogiannis*, K. Chatterjee, B. Adlam, M. A. Nowak
      Sci Rep (pdf) (suppl)

    • Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
      K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis
      CAV 2015 (pdf) (slides)

    • Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
      K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal
      POPL 2015 (pdf) (slides)

    • Quantitative Interprocedural Analysis
      K. Chatterjee, A. Pavlogiannis, Y. Velner
      POPL 2015 (pdf)

  • 2014

    • A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks
      K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid
      RTSS 2014 (pdf) (slides)

    • The Time Scale of Evolutionary Innovation
      K. Chatterjee*, A. Pavlogiannis, B. Adlam, M. A. Nowak
      PLoS Comput Biol (pdf) (suppl) (slides)

  • 2013

    • Distributed synthesis for LTL fragments
      K. Chatterjee, T. A. Henzinger, J. Otop, A. Pavlogiannis
      FMCAD 2013 (pdf) (slides)

    • A flood-based information flow analysis and network minimization method for gene regulatory networks
      A. Pavlogiannis*, V. Mozhayskiy, I. Tagkopoulos
      BMC Bioinformatics (pdf)

  • 2011

    • Passively Mobile Communicating Machines that Use Restricted Space
      I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P. G. Spirakis
      Theor. Comput. Sci. 2011 (pdf)

    • Passively mobile communicating machines that use restricted space
      I.Chatzigiannakis, O.Michail, S. Nikolaou, A. Pavlogiannis, P. G. Spirakis
      FOMC 2011 (pdf) (slides)

  • 2010

    • All Symmetric Predicates in NSPACE(n^2) Are Stably Computable by the Mediated Population Protocol Model
      I.Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P. G. Spirakis
      MFCS 2010 (pdf)

    • Computational Models for Wireless Sensor Networks: A Survey
      A. Filipas, I.Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P. G. Spirakis
      Eureka! 2010 (pdf)