Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Ranko
    Last name: Lazic
    DBLP: l/RankoLazic
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 58 of 58  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Ranko Lazic, Patrick Totzke.
    What Makes Petri Nets Harder to Verify: Stack or Data?
    Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday 2017 (0) 2017
    Journal article
    Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke.
    A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Matthias Englert, Ranko Lazic, Patrick Totzke.
    Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke.
    Coverability Trees for Petri Nets with Unordered Data.
    Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedin 2016 (0) 2016
    Conference paper
    Ranko Lazic, Andrzej S. Murawski.
    Contextual Approximation and Higher-Order Procedures.
    Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedin 2016 (0) 2016
    Conference paper
    Ranko Lazic, Joël Ouaknine, James Worrell.
    Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete.
    ACM Trans. Comput. Log. 2015, Volume 17 (0) 2016
    Conference paper
    Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke.
    A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    The Complexity of Coverability in ν-Petri Nets.
    Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016 2016 (0) 2016
    Conference paper
    Matthias Englert, Ranko Lazic, Patrick Totzke.
    Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete.
    Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016 2016 (0) 2016
    Journal article
    Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz.
    Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz.
    Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II 2015 (0) 2015
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    Nonelementary Complexities for Branching VASS, MELL, and Extensions.
    ACM Trans. Comput. Log. 2014, Volume 16 (0) 2015
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    The Ideal View on Rackoff's Coverability Technique.
    Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings 2015 (0) 2015
    Journal article
    Ranko Lazic, Sylvain Schmitz.
    Non-Elementary Complexities for Branching VASS, MELL, and Extensions.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Ranko Lazic, Sylvain Schmitz.
    Non-elementary complexities for branching VASS, MELL, and extensions.
    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), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 2014 (0) 2014
    Journal article
    Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic.
    The covering and boundedness problems for branching vector addition systems.
    J. Comput. Syst. Sci. 2013, Volume 79 (0) 2013
    Conference paper
    Ranko Lazic, Joël Ouaknine, James Worrell.
    Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian.
    Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings 2013 (0) 2013
    Journal article
    Ranko Lazic.
    The reachability problem for vector addition systems with a stack is not elementary.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Ranko Lazic.
    Safety alternating automata on data words.
    ACM Trans. Comput. Log. 2010, Volume 12 (0) 2011
    Conference paper
    Marcin Jurdzinski, Ranko Lazic.
    Alternating automata on data trees and XPath satisfiability.
    ACM Trans. Comput. Log. 2010, Volume 12 (0) 2011
    Conference paper
    Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski.
    Average-price-per-reward games on hybrid automata with strong resets.
    STTT 2011, Volume 13 (0) 2011
    Conference paper
    Ranko Lazic.
    The reachability problem for branching vector addition systems requires doubly-exponential space.
    Inf. Process. Lett. 2009, Volume 110 (0) 2010
    Journal article
    Adam Bakewell, Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic.
    Data-abstraction refinement: a game semantic approach.
    STTT 2010, Volume 12 (0) 2010
    Conference paper
    Stéphane Demri, Ranko Lazic, Arnaud Sangnier.
    Model checking memoryful linear-time logics over one-counter automata.
    Theor. Comput. Sci. 2010, Volume 411 (0) 2010
    Conference paper
    Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski.
    Average-Price-per-Reward Games on Hybrid Automata with Strong Resets.
    Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Stéphane Demri, Ranko Lazic.
    LTL with the freeze quantifier and register automata.
    ACM Trans. Comput. Log. 2009, Volume 10 (0) 2009
    Conference paper
    Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic.
    The Covering and Boundedness Problems for Branching Vector Addition Systems.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India 2009 (0) 2009
    Conference paper
    Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski.
    Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.
    Formal Modeling and Analysis of Timed Systems, 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Stéphane Demri, Ranko Lazic, Arnaud Sangnier.
    Model Checking Freeze LTL over One-Counter Automata.
    Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedi 2008 (0) 2008
    Conference paper
    Ranko Lazic.
    Safety alternating automata on data words
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Marcin Jurdzinski, Ranko Lazic.
    Alternating Automata on Data Trees and XPath Satisfiability
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Stéphane Demri, Ranko Lazic, Arnaud Sangnier.
    Model checking memoryful linear-time logics over one-counter automata
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Ranko Lazic, Tom Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell.
    Nets with Tokens which Carry Data.
    Fundam. Inform. 2008, Volume 88 (0) 2008
    Conference paper
    Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell.
    Nets with Tokens Which Carry Data.
    Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Marcin Jurdzinski, Ranko Lazic.
    Alternation-free modal mu-calculus for data trees.
    22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings 2007 (0) 2007
    Conference paper
    Ranko Lazic, Rajagopal Nagarajan.
    Guest Editorial.
    Formal Asp. Comput. 2007, Volume 19 (0) 2007
    Conference paper
    Stéphane Demri, Ranko Lazic, David Nowak.
    On the freeze quantifier in Constraint LTL: Decidability and complexity.
    Inf. Comput. 2007, Volume 205 (0) 2007
    Conference paper
    Aleksandar Dimovski, Ranko Lazic.
    Compositional software verification based on game semantics and process algebra.
    STTT 2007, Volume 9 (0) 2007
    Conference paper
    Ranko Lazic.
    Safely Freezing LTL.
    FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Aleksandar Dimovski, Ranko Lazic.
    Assume-Guarantee Software Verification Based on Game Semantics.
    Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, ICFEM 2006, Macao, China, November 1-3, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Stéphane Demri, Ranko Lazic.
    LTL with the Freeze Quantifier and Register Automata.
    21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings 2006 (0) 2006
    Conference paper
    Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic.
    A Counterexample-Guided Refinement Tool for Open Procedural Programs.
    Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Stéphane Demri, Ranko Lazic.
    LTL with the Freeze Quantifier and Register Automata
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Stéphane Demri, Ranko Lazic, David Nowak.
    On the freeze quantifier in Constraint LTL: decidability and complexity
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Ranko Lazic, Rajagopal Nagarajan.
    Preface.
    Electr. Notes Theor. Comput. Sci. 2006, Volume 145 (0) 2006
    Conference paper
    Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic.
    Abstraction-refinement for game-based model checking.
    Games for Logic and Programming Languages (GALOP 2005), University of Edinburgh, 2-3 April 2005, The workshop was organized as part of the ETAPS Conference 2005 (0) 2005
    Conference paper
    Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic.
    Data-Abstraction Refinement: A Game Semantic Approach.
    Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Stéphane Demri, Ranko Lazic, David Nowak.
    On the Freeze Quantifier in Constraint LTL: Decidability and Complexity.
    12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 23-25 June 2005, Burlington, Vermont, USA 2005 (0) 2005
    Conference paper
    Aleksandar Dimovski, Ranko Lazic.
    Software Model Checking Based on Game Semantics and CSP.
    Electr. Notes Theor. Comput. Sci. 2005, Volume 128 (0) 2005
    Conference paper
    Ranko Lazic.
    Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification.
    Electr. Notes Theor. Comput. Sci. 2005, Volume 138 (0) 2005
    Conference paper
    Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe.
    Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting.
    Electr. Notes Theor. Comput. Sci. 2005, Volume 138 (0) 2005
    Conference paper
    Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe.
    On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations.
    Communicating Sequential Processes: The First 25 Years, Symposium on the Occasion of 25 Years of CSP, London, UK, July 7-8, 2004, Revised Invited Papers 2005 (0) 2004
    Conference paper
    Aleksandar Dimovski, Ranko Lazic.
    CSP Representation of Game Semantics for Second-Order Idealized Algol.
    Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, WA, USA, November 8-12, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Xu Wang, A. W. Roscoe, Ranko Lazic.
    Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption.
    Integrated Formal Methods, 4th International Conference, IFM 2004, Canterbury, UK, April 4-7, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe.
    On model checking data-independent systems with arrays without reset.
    TPLP 2004, Volume 4 (0) 2004
    Conference paper
    Ranko Lazic, David Nowak.
    On a Semantic Definition of Data Independence .
    Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings. 2003 (0) 2003
    Conference paper
    Ranko Lazic, David Nowak.
    A Unifying Approach to Data-Independence.
    CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Ranko Lazic, A. W. Roscoe.
    Data Independence with Generalised Predicate Symbols.
    Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 1999, June 28 - Junlly 1, 1999, Las Vegas, Nevada, USA 1999 (0) 1999
    Show item 1 to 58 of 58  

    Your query returned 58 matches in the database.