Ranko Lazic

According to our database, Ranko Lazic authored at least 67 papers between 1999 and 2023.

Collaborative distances:

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

2023

Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs.

Dmitry Chistikov, Matthias Englert, Ranko Lazic

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Adversarial Reprogramming Revisited.

Matthias Englert, Ranko Lazic

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

When are emptiness and containment decidable for probabilistic automata?

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell

J. Comput. Syst. Sci., 2021

The Reachability Problem for Petri Nets Is Not Elementary.

Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki

J. ACM, 2021

The Reachability Problem for Two-Dimensional Vector Addition Systems with States.

Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke

J. ACM, 2021

A lower bound for the coverability problem in acyclic pushdown VAS.

Matthias Englert, Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Juliusz Straszynski

Inf. Process. Lett., 2021

The ideal view on Rackoff's coverability technique.

Ranko Lazic, Sylvain Schmitz

Inf. Comput., 2021

Verifying higher-order concurrency with data automata.

Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Leafy automata for higher-order concurrency.

Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz

Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020

KReach: A Tool for Reachability in Petri Nets.

Alex Dixon, Ranko Lazic

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

Reachability in Fixed Dimension Vector Addition Systems with States.

Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki

ACM Trans. Comput. Log., 2019

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.

Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk).

Ranko Lazic

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Verification column.

Ranko Lazic

ACM SIGLOG News, 2018

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract).

Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki

CoRR, 2018

A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games.

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic

CoRR, 2018

A pseudo-quasi-polynomial algorithm for mean-payoff parity games.

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

When is Containment Decidable for Probabilistic Automata?.

Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Succinct progress measures for solving parity games.

Marcin Jurdzinski, Ranko Lazic

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Perfect half space games.

Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Timed pushdown automata and branching vector addition systems.

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.

Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

What Makes Petri Nets Harder to Verify: Stack or Data?

Ranko Lazic, Patrick Totzke

Proceedings of the Concurrency, Security, and Puzzles, 2017

2016

Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete.

Ranko Lazic, Joël Ouaknine, James Worrell

ACM Trans. Comput. Log., 2016

The Complexity of Coverability in ν-Petri Nets.

Ranko Lazic, Sylvain Schmitz

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.

Matthias Englert, Ranko Lazic, Patrick Totzke

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.

Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Contextual Approximation and Higher-Order Procedures.

Ranko Lazic, Andrzej S. Murawski

Proceedings of the Foundations of Software Science and Computation Structures, 2016

Coverability Trees for Petri Nets with Unordered Data.

Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Nonelementary Complexities for Branching VASS, MELL, and Extensions.

Ranko Lazic, Sylvain Schmitz

ACM Trans. Comput. Log., 2015

Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.

Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Non-elementary complexities for branching VASS, MELL, and extensions.

Ranko Lazic, Sylvain Schmitz

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

The covering and boundedness problems for branching vector addition systems.

Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic

J. Comput. Syst. Sci., 2013

The reachability problem for vector addition systems with a stack is not elementary.

Ranko Lazic

CoRR, 2013

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian.

Ranko Lazic, Joël Ouaknine, James Worrell

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2011

Safety alternating automata on data words.

Ranko Lazic

ACM Trans. Comput. Log., 2011

Alternating automata on data trees and XPath satisfiability.

Marcin Jurdzinski, Ranko Lazic

ACM Trans. Comput. Log., 2011

Average-price-per-reward games on hybrid automata with strong resets.

Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski

Int. J. Softw. Tools Technol. Transf., 2011

2010

Model checking memoryful linear-time logics over one-counter automata.

Stéphane Demri, Ranko Lazic, Arnaud Sangnier

Theor. Comput. Sci., 2010

Data-abstraction refinement: a game semantic approach.

Adam Bakewell, Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic

Int. J. Softw. Tools Technol. Transf., 2010

The reachability problem for branching vector addition systems requires doubly-exponential space.

Ranko Lazic

Inf. Process. Lett., 2010

2009

LTL with the freeze quantifier and register automata.

Stéphane Demri, Ranko Lazic

ACM Trans. Comput. Log., 2009

2008

Nets with Tokens which Carry Data.

Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell

Fundam. Informaticae, 2008

Model Checking Freeze LTL over One-Counter Automata.

Stéphane Demri, Ranko Lazic, Arnaud Sangnier

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.

Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007

Compositional software verification based on game semantics and process algebra.

Aleksandar S. Dimovski, Ranko Lazic

Int. J. Softw. Tools Technol. Transf., 2007

On the freeze quantifier in Constraint LTL: Decidability and complexity.

Stéphane Demri, Ranko Lazic, David Nowak

Inf. Comput., 2007

Guest Editorial.

Ranko Lazic, Rajagopal Nagarajan

Formal Aspects Comput., 2007

Alternation-free modal mu-calculus for data trees.

Marcin Jurdzinski, Ranko Lazic

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006

A Counterexample-Guided Refinement Tool for Open Procedural Programs.

Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic

Proceedings of the Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30, 2006

Assume-Guarantee Software Verification Based on Game Semantics.

Aleksandar S. Dimovski, Ranko Lazic

Proceedings of the Formal Methods and Software Engineering, 2006

Safely Freezing LTL.

Ranko Lazic

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Preface.

Ranko Lazic, Rajagopal Nagarajan

Proceedings of the 5th International Workshop on Automated Verification of Critical Systems, 2005

Data-Abstraction Refinement: A Game Semantic Approach.

Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic

Proceedings of the Static Analysis, 12th International Symposium, 2005

Abstraction-refinement for game-based model checking.

Aleksandar S. Dimovski, Dan R. Ghica, Ranko Lazic

Proceedings of the 1st Workshop on Games for Logic and Programming Languages, 2005

2004

On model checking data-independent systems with arrays without reset.

Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe

Theory Pract. Log. Program., 2004

Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting.

Ranko Lazic, Thomas Christopher Newcomb, Bill Roscoe

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification.

Ranko Lazic

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Software Model Checking Based on Game Semantics and CSP.

Aleksandar S. Dimovski, Ranko Lazic

Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption.

Xu Wang, A. W. Roscoe, Ranko Lazic

Proceedings of the Integrated Formal Methods, 4th International Conference, 2004

CSP Representation of Game Semantics for Second-Order Idealized Algol.

Aleksandar S. Dimovski, Ranko Lazic

Proceedings of the Formal Methods and Software Engineering, 2004

On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations.

Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe

Proceedings of the Communicating Sequential Processes: The First 25 Years, 2004

2003

On a Semantic Definition of Data Independence .

Ranko Lazic, David Nowak

Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

2000

A Unifying Approach to Data-Independence.

Ranko Lazic, David Nowak

Proceedings of the CONCUR 2000, 2000

1999

A semantic study of data independence with applications to model checking.

Ranko S. Lazic

PhD thesis, 1999

Data Independence with Generalised Predicate Symbols.

Ranko Lazic, Bill Roscoe

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999