Ranko Lazic
Ranko Lazic
Department of Computer Science, University of Warwick
Verified email at warwick.ac.uk - Homepage
Cited by
Cited by
LTL with the freeze quantifier and register automata
S Demri, R Lazić
ACM Transactions on Computational Logic (TOCL) 10 (3), 1-30, 2009
A semantic study of data independence with applications to model checking.
RS Lazic
University of Oxford, 1999
Nets with tokens which carry data
R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell
Fundamenta Informaticae 88 (3), 251-274, 2008
Alternating automata on data trees and XPath satisfiability
M Jurdziński, R Lazić
ACM Transactions on Computational Logic (TOCL) 12 (3), 19, 2011
On the freeze quantifier in constraint LTL: Decidability and complexity
S Demri, R Lazić, D Nowak
Information and Computation 205 (1), 2-24, 2007
Succinct progress measures for solving parity games
M Jurdziński, R Lazić
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2017
Model checking freeze LTL over one-counter automata
S Demri, R Lazić, A Sangnier
International Conference on Foundations of Software Science and …, 2008
A unifying approach to data-independence
R Lazić, D Nowak
International Conference on Concurrency Theory, 581-596, 2000
The covering and boundedness problems for branching vector addition systems
S Demri, M Jurdziński, O Lachish, R Lazić
Journal of Computer and System Sciences 79 (1), 23-38, 2013
The reachability problem for Petri nets is not elementary
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Fixed-dimensional energy games are in pseudo-polynomial time
M Jurdziński, R Lazić, S Schmitz
International Colloquium on Automata, Languages, and Programming, 260-272, 2015
Safety alternating automata on data words
R Lazić
ACM Transactions on Computational Logic (TOCL) 12 (2), 10, 2011
Nonelementary complexities for branching VASS, MELL, and extensions
R Lazić, S Schmitz
ACM Transactions on Computational Logic (TOCL) 16 (3), 1-30, 2015
Data-abstraction refinement: A game semantic approach
A Dimovski, DR Ghica, R Lazić
International Static Analysis Symposium, 102-117, 2005
On model checking data-independent systems with arrays without reset
RS Lazic, TC Newcomb, AW Roscoe
arXiv preprint cs/0405103, 2004
Data independence with generalised predicate symbols
R Lazic, B Roscoe
Proceedings of the International Conference on Parallel and Distributed …, 1999
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
The ideal view on Rackoff's coverability technique
R Lazić, S Schmitz
Information and Computation, 104582, 2020
What Makes Petri Nets Harder to Verify: Stack or Data?
R Lazić, P Totzke
Concurrency, Security, and Puzzles, 144-161, 2017
Compositional software verification based on game semantics and process algebra
A Dimovski, R Lazić
International Journal on Software Tools for Technology Transfer 9 (1), 37-51, 2007
The system can't perform the operation now. Try again later.
Articles 1–20