Ranko Lazic

Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1): 23-38 (2013)

Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski: Average-price-per-reward games on hybrid automata with strong resets. STTT 13(6): 553-569 (2011)

Ranko Lazic: Safety alternating automata on data words. ACM Trans. Comput. Log. 12(2): 10 (2011)

Marcin Jurdzinski, Ranko Lazic: Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12(3): 19 (2011)

Ranko Lazic: The reachability problem for branching vector addition systems requires doubly-exponential space. Inf. Process. Lett. 110(17): 740-745 (2010)

Adam Bakewell, Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic: Data-abstraction refinement: a game semantic approach. STTT 12(5): 373-389 (2010)

Stéphane Demri, Ranko Lazic, Arnaud Sangnier: Model checking memoryful linear-time logics over one-counter automata. Theor. Comput. Sci. 411(22-24): 2298-2316 (2010)

Stéphane Demri, Ranko Lazic: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3) (2009)

Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic: The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192

Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI 2009: 167-181

Ranko Lazic, Tom Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens which Carry Data. Fundam. Inform. 88(3): 251-274 (2008)

Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS 2008: 63-77

Stéphane Demri, Ranko Lazic, Arnaud Sangnier: Model Checking Freeze LTL over One-Counter Automata. FoSSaCS 2008: 490-504

Ranko Lazic: Safety alternating automata on data words. CoRR abs/0802.4237 (2008)

Marcin Jurdzinski, Ranko Lazic: Alternating Automata on Data Trees and XPath Satisfiability. CoRR abs/0805.0330 (2008)

Stéphane Demri, Ranko Lazic, Arnaud Sangnier: Model checking memoryful linear-time logics over one-counter automata. CoRR abs/0810.5517 (2008)

Ranko Lazic, Rajagopal Nagarajan: Guest Editorial. Formal Asp. Comput. 19(3): 275 (2007)

Stéphane Demri, Ranko Lazic, David Nowak: On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. 205(1): 2-24 (2007)

Aleksandar Dimovski, Ranko Lazic: Compositional software verification based on game semantics and process algebra. STTT 9(1): 37-51 (2007)

Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens Which Carry Data. ICATPN 2007: 301-320

Marcin Jurdzinski, Ranko Lazic: Alternation-free modal mu-calculus for data trees. LICS 2007: 131-140

Ranko Lazic, Rajagopal Nagarajan: Preface. Electr. Notes Theor. Comput. Sci. 145: 1-2 (2006)

Ranko Lazic: Safely Freezing LTL. FSTTCS 2006: 381-392

Aleksandar Dimovski, Ranko Lazic: Assume-Guarantee Software Verification Based on Game Semantics. ICFEM 2006: 529-548

Stéphane Demri, Ranko Lazic: LTL with the Freeze Quantifier and Register Automata. LICS 2006: 17-26

Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic: A Counterexample-Guided Refinement Tool for Open Procedural Programs. SPIN 2006: 288-292

Stéphane Demri, Ranko Lazic, David Nowak: On the freeze quantifier in Constraint LTL: decidability and complexity. CoRR abs/cs/0609008 (2006)

Stéphane Demri, Ranko Lazic: LTL with the Freeze Quantifier and Register Automata. CoRR abs/cs/0610027 (2006)

Aleksandar Dimovski, Ranko Lazic: Software Model Checking Based on Game Semantics and CSP. Electr. Notes Theor. Comput. Sci. 128(6): 105-125 (2005)

Ranko Lazic: Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. Electr. Notes Theor. Comput. Sci. 138(3): 3-19 (2005)

Ranko Lazic, Thomas Christopher Newcomb, Bill Roscoe: Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting. Electr. Notes Theor. Comput. Sci. 138(3): 61-86 (2005)

Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic: Abstraction-refinement for game-based model checking. GALOP 2005: 139

Aleksandar Dimovski, Dan R. Ghica, Ranko Lazic: Data-Abstraction Refinement: A Game Semantic Approach. SAS 2005: 102-117

Stéphane Demri, Ranko Lazic, David Nowak: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. TIME 2005: 113-121

Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe: On model checking data-independent systems with arrays without reset. TPLP 4(5-6): 659-693 (2004)

Ranko Lazic, Thomas Christopher Newcomb, A. W. Roscoe: On Model Checking Data-Independent Systems with Arrays with Whole-Array Operations. 25 Years Communicating Sequential Processes 2004: 275-291

Aleksandar Dimovski, Ranko Lazic: CSP Representation of Game Semantics for Second-Order Idealized Algol. ICFEM 2004: 146-161

Xu Wang, A. W. Roscoe, Ranko Lazic: Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption. IFM 2004: 247-266

Ranko Lazic, David Nowak: On a Semantic Definition of Data Independence . TLCA 2003: 226-240

Ranko Lazic, David Nowak: A Unifying Approach to Data-Independence. CONCUR 2000: 581-595

Ranko Lazic, Bill Roscoe: Data Independence with Generalised Predicate Symbols. PDPTA 1999: 319-326