Andreas Pavlogiannis

Orcid: 0000-0002-8943-0722

According to our database1, Andreas Pavlogiannis authored at least 66 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On-the-Fly Static Analysis via Dynamic Bidirected Dyck Reachability.
Proc. ACM Program. Lang., January, 2024

How Hard Is Weak-Memory Testing?
Proc. ACM Program. Lang., January, 2024

Fast Symbolic Computation of Bottom SCCs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

A Better Approximation for Interleaved Dyck Reachability.
Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, 2024

Robust Reward Placement under Uncertainty.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Seed Selection in the Heterogeneous Moran Process.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Optimistic Prediction of Synchronization-Reversal Data Races.
Proceedings of the 46th IEEE/ACM International Conference on Software Engineering, 2024

CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis.
Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2024

Reachability-Aware Fair Influence Maximization.
Proceedings of the Web and Big Data - 8th International Joint Conference, 2024

2023
Sound Dynamic Deadlock Prediction in Linear Time.
Dataset, March, 2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models.
Dataset, March, 2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models.
Dataset, March, 2023

Optimal Reads-From Consistency Checking for C11-Style Memory Models.
Proc. ACM Program. Lang., 2023

Sound Dynamic Deadlock Prediction in Linear Time.
Proc. ACM Program. Lang., 2023

A Truly Symbolic Linear-Time Algorithm for SCC Decomposition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Maximizing the Probability of Fixation in the Positional Voter Model.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
CFL/Dyck Reachability: An Algorithmic Perspective.
ACM SIGLOG News, October, 2022

The decidability and complexity of interleaved bidirected Dyck reachability.
Proc. ACM Program. Lang., 2022

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

Dynamic data race prediction: fundamentals, theory, and practice (tutorial).
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.
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.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Reachability in Bidirected Pushdown VASS.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

A tree clock data structure for causal orderings in concurrent executions.
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.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
The fine-grained and parallel complexity of andersen's pointer analysis.
Proc. ACM Program. Lang., 2021

The reads-from equivalence for the TSO and PSO memory models.
Proc. ACM Program. Lang., 2021

Optimal prediction of synchronization-preserving races.
Proc. ACM Program. Lang., 2021

Tight bounds for reachability problems on one-counter and pushdown systems.
Inf. Process. Lett., 2021

Faster algorithms for quantitative verification in bounded treewidth graphs.
Formal Methods Syst. Des., 2021

Quantitative Verification on Product Graphs of Small Treewidth.
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.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Stateless Model Checking Under a Reads-Value-From Equivalence.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Limits on amplifiers of natural selection under death-Birth updating.
PLoS Comput. Biol., 2020

Fast, sound, and effectively complete dynamic race prediction.
Proc. ACM Program. Lang., 2020

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

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

The Complexity of Dynamic Data Race Prediction.
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.
Proceedings of the Programming Languages and Systems, 2020

Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.
ACM Trans. Program. Lang. Syst., 2019

Value-centric dynamic partial order reduction.
Proc. ACM Program. Lang., 2019

Efficient parameterized algorithms for data packing.
Proc. ACM Program. Lang., 2019

Fast, Sound and Effectively Complete Dynamic Race Detection.
CoRR, 2019

2018
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
ACM Trans. Program. Lang. Syst., 2018

Automated competitive analysis of real-time scheduling with graph games.
Real Time Syst., 2018

Optimal Dyck reachability for data-dependence and alias analysis.
Proc. ACM Program. Lang., 2018

Data-centric dynamic partial order reduction.
Proc. ACM Program. Lang., 2018

Fixation probability and fixation time in structured populations.
CoRR, 2018

Strong Amplifiers of Natural Selection: Proofs.
CoRR, 2018

2017
Faster Algorithms for Weighted Recursive State Machines.
Proceedings of the Programming Languages and Systems, 2017

JTDec: A Tool for Tree Decompositions in Soot.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2016
Data-centric Dynamic Partial Order Reduction.
CoRR, 2016

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Quantitative Interprocedural Analysis.
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.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
The Time Scale of Evolutionary Innovation.
PLoS Comput. Biol., 2014

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

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks.
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.
BMC Bioinform., 2013

Distributed synthesis for LTL fragments.
Proceedings of the Formal Methods in Computer-Aided Design, 2013

2011
Passively mobile communicating machines that use restricted space.
Theor. Comput. Sci., 2011

2010
Passively Mobile Communicating Logarithmic Space Machines
CoRR, 2010

All Symmetric Predicates in <i>NSPACE</i>(<i>n</i><sup>2</sup>) Are Stably Computable by the Mediated Population Protocol Model.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010


  Loading...