Andreas Pavlogiannis

According to our database, Andreas Pavlogiannis authored at least 59 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability.

Shankaranarayanan Krishna, Aniket Lal, Andreas Pavlogiannis, Omkar Tuppe

Proc. ACM Program. Lang., January, 2024

How Hard Is Weak-Memory Testing?

Soham Chakraborty, Shankara Narayanan Krishna, Umang Mathur, Andreas Pavlogiannis

Proc. ACM Program. Lang., January, 2024

CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis.

Hünkar Can Tunç, Ameya Prashant Deshmukh, Berk Çirisci, Constantin Enea, Andreas Pavlogiannis

CoRR, 2024

Optimistic Prediction of Synchronization-Reversal Data Races.

Zheng Shi, Umang Mathur, Andreas Pavlogiannis

CoRR, 2024

Fast Symbolic Computation of Bottom SCCs.

Anna Blume Jakobsen, Rasmus Skibdahl Melanchton Jørgensen, Jaco van de Pol, Andreas Pavlogiannis

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models.

Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis

Proc. ACM Program. Lang., 2023

Sound Dynamic Deadlock Prediction in Linear Time.

Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan

Proc. ACM Program. Lang., 2023

A Truly Symbolic Linear-Time Algorithm for SCC Decomposition.

Casper Abild Larsen, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol, Andreas Pavlogiannis

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Maximizing the Probability of Fixation in the Positional Voter Model.

Petros Petsinis, Andreas Pavlogiannis, Panagiotis Karras

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

CFL/Dyck Reachability: An Algorithmic Perspective.

Andreas Pavlogiannis

ACM SIGLOG News, October, 2022

The decidability and complexity of interleaved bidirected Dyck reachability.

Adam Husted Kjelstrøm, Andreas Pavlogiannis

Proc. ACM Program. Lang., 2022

Social Balance on Networks: Local Minima and Best Edge Dynamics.

Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec

CoRR, 2022

Dynamic data race prediction: fundamentals, theory, and practice (tutorial).

Umang Mathur, Andreas Pavlogiannis

Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2022

Efficient approximations for cache-conscious data placement.

Ali Ahmadi, Majid Daliri, Amir Kafshdar Goharshady, Andreas Pavlogiannis

Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Invasion Dynamics in the Biased Voter Process.

Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Reachability in Bidirected Pushdown VASS.

Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

A tree clock data structure for causal orderings in concurrent executions.

Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan

Proceedings of the ASPLOS '22: 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Lausanne, Switzerland, 28 February 2022, 2022

Fixation Maximization in the Positional Moran Process.

Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis, Asger Ullersted Rasmussen, Josef Tkadlec

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

The fine-grained and parallel complexity of andersen's pointer analysis.

Anders Alnor Mathiasen, Andreas Pavlogiannis

Proc. ACM Program. Lang., 2021

The reads-from equivalence for the TSO and PSO memory models.

Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman

Proc. ACM Program. Lang., 2021

Optimal prediction of synchronization-preserving races.

Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan

Proc. ACM Program. Lang., 2021

Tight bounds for reachability problems on one-counter and pushdown systems.

Jakob Cetti Hansen, Adam Husted Kjelstrøm, Andreas Pavlogiannis

Inf. Process. Lett., 2021

Faster algorithms for quantitative verification in bounded treewidth graphs.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

Formal Methods Syst. Des., 2021

Quantitative Verification on Product Graphs of Small Treewidth.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Dynamic Data-Race Detection Through the Fine-Grained Lens.

Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Stateless Model Checking Under a Reads-Value-From Equivalence.

Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.

Andreas Pavlogiannis, Nico Schaumberger, Ulrich Schmid, Krishnendu Chatterjee

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Limits on amplifiers of natural selection under death-Birth updating.

Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak

PLoS Comput. Biol., 2020

Fast, sound, and effectively complete dynamic race prediction.

Andreas Pavlogiannis

Proc. ACM Program. Lang., 2020

The Fine-Grained Complexity of Andersen's Pointer Analysis.

Andreas Pavlogiannis

CoRR, 2020

Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth.

Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis

CoRR, 2020

The Complexity of Dynamic Data Race Prediction.

Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

Proceedings of the Programming Languages and Systems, 2020

Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.

Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis

Proceedings of the Automated Technology for Verification and Analysis, 2020

2019

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

ACM Trans. Program. Lang. Syst., 2019

Value-centric dynamic partial order reduction.

Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman

Proc. ACM Program. Lang., 2019

Efficient parameterized algorithms for data packing.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Nastaran Okati, Andreas Pavlogiannis

Proc. ACM Program. Lang., 2019

Fast, Sound and Effectively Complete Dynamic Race Detection.

Andreas Pavlogiannis

CoRR, 2019

2018

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis

ACM Trans. Program. Lang. Syst., 2018

Automated competitive analysis of real-time scheduling with graph games.

Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid

Real Time Syst., 2018

Optimal Dyck reachability for data-dependence and alias analysis.

Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis

Proc. ACM Program. Lang., 2018

Data-centric dynamic partial order reduction.

Marek Chalupa, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya

Proc. ACM Program. Lang., 2018

Fixation probability and fixation time in structured populations.

Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak

CoRR, 2018

Strong Amplifiers of Natural Selection: Proofs.

Andreas Pavlogiannis, Josef Tkadlec, Krishnendu Chatterjee, Martin A. Nowak

CoRR, 2018

2017

Faster Algorithms for Weighted Recursive State Machines.

Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis

Proceedings of the Programming Languages and Systems, 2017

JTDec: A Tool for Tree Decompositions in Soot.

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Andreas Pavlogiannis

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Data-centric Dynamic Partial Order Reduction.

Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya

CoRR, 2016

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Quantitative Interprocedural Analysis.

Krishnendu Chatterjee, Andreas Pavlogiannis, Yaron Velner

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal

Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014

The Time Scale of Evolutionary Innovation.

Krishnendu Chatterjee, Andreas Pavlogiannis, Ben Adlam, Martin A. Nowak

PLoS Comput. Biol., 2014

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal

CoRR, 2014

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks.

Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid

Proceedings of the IEEE 35th IEEE Real-Time Systems Symposium, 2014

2013

A flood-based information flow analysis and network minimization method for gene regulatory networks.

Andreas Pavlogiannis, Vadim Mozhayskiy, Ilias Tagkopoulos

BMC Bioinform., 2013

Distributed synthesis for LTL fragments.

Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Andreas Pavlogiannis

Proceedings of the Formal Methods in Computer-Aided Design, 2013

2011

Passively mobile communicating machines that use restricted space.

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis

Theor. Comput. Sci., 2011

2010

Passively Mobile Communicating Logarithmic Space Machines

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis

CoRR, 2010

All Symmetric Predicates in <i>NSPACE</i>(<i>n</i>²) Are Stably Computable by the Mediated Population Protocol Model.

Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010