The Library
Browse by Warwick Author
Up a level |
Jump to: ACI Sécurité et informatique (ACI) | Christ Church (University of Oxford) | ENS Cachan | Engineering and Physical Sciences Research Council (EPSRC) | Engineering and Physical Sciences Research Council (EPSRC) | European Research Council (ERC) | France. Agence nationale de la recherche (ANR) | Horizon 2020 (European Commission) (H2020) | Intel Corporation | Intel Corporation | Labex Digicosme, Université Paris-Saclay (UPS) | Leverhulme Trust (LT) | Narodowe Centrum Nauki (NCN) | Narodowe Centrum Nauki [National Science Centre] (NCN) | Narodowe Centrum Nauki [Polish National Science Center] | QinetiQ (Firm) | Royal Society (Great Britain) | United States. Office of Naval Research | École normale supérieure (Cachan, France) (ENS)
Number of items: 49.
ACI Sécurité et informatique (ACI)
Demri, Stéphane P. and Lazic, Ranko (2009) LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic (TOCL), Vol.10 (No.3). p. 16. doi:10.1145/1507244.1507246 ISSN 1529-3785.
Christ Church (University of Oxford)
Lazic, Ranko and Nowak, David (2003) On a semantic definition of data independence. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
ENS Cachan
Lazic, Ranko (2011) Safety alternating automata on data words. ACM Transactions on Computational Logic (TOCL), Vol.12 (No.2). pp. 1-24. doi:10.1145/1877714.1877716 ISSN 1529-3785.
Engineering and Physical Sciences Research Council (EPSRC)
Colcombet, Thomas , Jurdzinski, Marcin, Lazic, Ranko and Schmitz, Sylvain (2017) Perfect half space games. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030187. doi:10.1109/LICS.2017.8005105
Figueira, Diego, Lazic, Ranko, Leroux, Jerome, Mazowiecki, Filip and Sutre, Grégoire (2017) Polynomial-space completeness of reachability for succinct branching VASS in dimension one. In: The 44th International Colloquium on Automata, Languages, and Programming (ICALP), Warsaw, Poland, 10-14 Jul 2017. Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 80 119 : 1-119: 14. ISBN 9783959770415. doi:10.4230/LIPIcs.ICALP.2017.119 ISSN 1868-8969.
Clemente, Lorenzo, Lasota, Slawomir, Lazic, Ranko and Mazowiecki, Filip (2017) Timed pushdown automata and branching vector addition systems. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030194. doi:10.1109/LICS.2017.8005083
Lazic, Ranko and Totzke, Patrick (2017) What makes petri nets harder to verify : stack or data?, Concurrency, security, and puzzles : Festschrift for A.W. Roscoe on the occasion of his 60th birthday. In: Concurrency, Security, and Puzzles : Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, 10160 . Springer, pp. 144-161. ISBN 9783319510453
Goller, Stefan, Haase, Christoph, Lazic, Ranko and Totzke, Patrick (2016) A polynomial-time algorithm for reachability in branching VASS in dimension one. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 12-15 Jul 2016. Published in: Leibniz International Proceedings in Informatics (LIPIcs) ISBN 9783959770132. doi:10.4230/LIPIcs.ICALP.2016.105 ISSN 1868-8969.
Englert, Matthias, Lazic, Ranko and Totzke, Patrick (2016) Reachability in two-dimensional unary vector addition systems with states is NL-complete. In: Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), New York City, USA, 5–8 Jul 2016. Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Hofman, Piotr , Lasota, Slawomir , Lazic, Ranko, Leroux, Jerome , Schmitz, Sylvain and Totzke, Patrick (2016) Coverability trees for petri nets with unordered data. In: 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Eindhoven, The Netherlands, 2-8 Apr 2016. Published in: Lecture Notes in Computer Science, 9634 pp. 445-461. ISBN 9783662496299. doi:10.1007/978-3-662-49630-5_26 ISSN 0302-9743.
Lazic, Ranko and Schmitz, Sylvain (2015) The ideal view on Rackoff's coverability technique. In: 9th International Workshop on Reachability Problems, Warsaw, Poland, 21-23 Sep 2015. Published in: Reachability Problems : 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, 9328 pp. 76-88. doi:10.1007/978-3-319-24537-9_8 ISSN 0302-9743.
Jurdzinski, Marcin, Lazic, Ranko and Schmitz, Sylvain (2015) Fixed-dimensional energy games are in pseudo-polynomial time. In: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, 6-10 Jul 2015. Published in: Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, 9135 pp. 260-272. ISBN 9783662476659. doi:10.1007/978-3-662-47666-6_21 ISSN 0302-9743.
Bakewell, Adam, Dimovski, Aleksandar, Ghica, Dan R. and Lazic, Ranko (2010) Data-abstraction refinement : a game semantic approach. International Journal on Software Tools for Technology Transfer, Vol.12 (No.5). pp. 373-389. doi:10.1007/s10009-010-0143-0 ISSN 1433-2779.
Demri, Stéphane P. and Lazic, Ranko (2009) LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic (TOCL), Vol.10 (No.3). p. 16. doi:10.1145/1507244.1507246 ISSN 1529-3785.
Dimovski, Aleksandar and Lazic, Ranko (2004) CSP representation of game semantics for second-order idealized Algol. University of Warwick. Department of Computer Science. (Department of Computer Science research report).
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) On model checking data-independent systems with arrays with whole-array operations. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) Polymorphic systems with arrays : decidability and undecidability. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Dimovski, Aleksandar and Lazic, Ranko (2004) Software model checking based on game semantics and CSP. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Lazic, Ranko and Nowak, David (2003) On a semantic definition of data independence. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Engineering and Physical Sciences Research Council (EPSRC)
Lazic, Ranko (2011) Safety alternating automata on data words. ACM Transactions on Computational Logic (TOCL), Vol.12 (No.2). pp. 1-24. doi:10.1145/1877714.1877716 ISSN 1529-3785.
European Research Council (ERC)
Colcombet, Thomas , Jurdzinski, Marcin, Lazic, Ranko and Schmitz, Sylvain (2017) Perfect half space games. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030187. doi:10.1109/LICS.2017.8005105
Clemente, Lorenzo, Lasota, Slawomir, Lazic, Ranko and Mazowiecki, Filip (2017) Timed pushdown automata and branching vector addition systems. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030194. doi:10.1109/LICS.2017.8005083
France. Agence nationale de la recherche (ANR)
Hofman, Piotr , Lasota, Slawomir , Lazic, Ranko, Leroux, Jerome , Schmitz, Sylvain and Totzke, Patrick (2016) Coverability trees for petri nets with unordered data. In: 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Eindhoven, The Netherlands, 2-8 Apr 2016. Published in: Lecture Notes in Computer Science, 9634 pp. 445-461. ISBN 9783662496299. doi:10.1007/978-3-662-49630-5_26 ISSN 0302-9743.
Jurdzinski, Marcin, Lazic, Ranko and Schmitz, Sylvain (2015) Fixed-dimensional energy games are in pseudo-polynomial time. In: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, 6-10 Jul 2015. Published in: Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, 9135 pp. 260-272. ISBN 9783662476659. doi:10.1007/978-3-662-47666-6_21 ISSN 0302-9743.
Lazic, Ranko and Schmitz, Sylvain (2015) Nonelementary complexities for branching VASS, MELL, and extensions. ACM Transactions on Computational Logic (TOCL), Volume 16 (Number 3). Article number 20. doi:10.1145/2733375 ISSN 1529-3785.
Lazic, Ranko and Schmitz, Sylvain (2014) Non-elementary complexities for branching VASS, MELL, and extensions. In: Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th ACM/IEEE Symposium on Logic in Computer Science, Vienna, Austria, 14-18 Jul 2014. Published in: 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) (Article number 61). ISBN 9781450328869. doi:10.1145/2603088.2603129
Demri, Stéphane P., Lazic, Ranko and Sangnier, Arnaud (2010) Model checking memoryful linear-time logics over one-counter automata. Theoretical Computer Science, Vol.411 (No.22-24). pp. 2298-2316. doi:10.1016/j.tcs.2010.02.021 ISSN 0304-3975.
Horizon 2020 (European Commission) (H2020)
Clemente, Lorenzo, Lasota, Slawomir, Lazic, Ranko and Mazowiecki, Filip (2017) Timed pushdown automata and branching vector addition systems. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030194. doi:10.1109/LICS.2017.8005083
Intel Corporation
Jurdzinski, Marcin and Lazic, Ranko (2011) Alternating automata on data trees and XPath satisfiability. ACM Transactions on Computational Logic (TOCL), Volume 12 (Number 3). pp. 1-21. doi:10.1145/1929954.1929956 ISSN 1529-3785.
Demri, Stéphane P. and Lazic, Ranko (2009) LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic (TOCL), Vol.10 (No.3). p. 16. doi:10.1145/1507244.1507246 ISSN 1529-3785.
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) On model checking data-independent systems with arrays with whole-array operations. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) Polymorphic systems with arrays : decidability and undecidability. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Lazic, Ranko and Nowak, David (2003) On a semantic definition of data independence. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Intel Corporation
Lazic, Ranko (2011) Safety alternating automata on data words. ACM Transactions on Computational Logic (TOCL), Vol.12 (No.2). pp. 1-24. doi:10.1145/1877714.1877716 ISSN 1529-3785.
Labex Digicosme, Université Paris-Saclay (UPS)
Goller, Stefan, Haase, Christoph, Lazic, Ranko and Totzke, Patrick (2016) A polynomial-time algorithm for reachability in branching VASS in dimension one. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Rome, Italy, 12-15 Jul 2016. Published in: Leibniz International Proceedings in Informatics (LIPIcs) ISBN 9783959770132. doi:10.4230/LIPIcs.ICALP.2016.105 ISSN 1868-8969.
Hofman, Piotr , Lasota, Slawomir , Lazic, Ranko, Leroux, Jerome , Schmitz, Sylvain and Totzke, Patrick (2016) Coverability trees for petri nets with unordered data. In: 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Eindhoven, The Netherlands, 2-8 Apr 2016. Published in: Lecture Notes in Computer Science, 9634 pp. 445-461. ISBN 9783662496299. doi:10.1007/978-3-662-49630-5_26 ISSN 0302-9743.
Leverhulme Trust (LT)
Hofman, Piotr , Lasota, Slawomir , Lazic, Ranko, Leroux, Jerome , Schmitz, Sylvain and Totzke, Patrick (2016) Coverability trees for petri nets with unordered data. In: 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Eindhoven, The Netherlands, 2-8 Apr 2016. Published in: Lecture Notes in Computer Science, 9634 pp. 445-461. ISBN 9783662496299. doi:10.1007/978-3-662-49630-5_26 ISSN 0302-9743.
Lazic, Ranko and Schmitz, Sylvain (2015) The ideal view on Rackoff's coverability technique. In: 9th International Workshop on Reachability Problems, Warsaw, Poland, 21-23 Sep 2015. Published in: Reachability Problems : 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, 9328 pp. 76-88. doi:10.1007/978-3-319-24537-9_8 ISSN 0302-9743.
Jurdzinski, Marcin, Lazic, Ranko and Schmitz, Sylvain (2015) Fixed-dimensional energy games are in pseudo-polynomial time. In: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, 6-10 Jul 2015. Published in: Automata, Languages, and Programming : 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, 9135 pp. 260-272. ISBN 9783662476659. doi:10.1007/978-3-662-47666-6_21 ISSN 0302-9743.
Narodowe Centrum Nauki (NCN)
Hofman, Piotr , Lasota, Slawomir , Lazic, Ranko, Leroux, Jerome , Schmitz, Sylvain and Totzke, Patrick (2016) Coverability trees for petri nets with unordered data. In: 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Eindhoven, The Netherlands, 2-8 Apr 2016. Published in: Lecture Notes in Computer Science, 9634 pp. 445-461. ISBN 9783662496299. doi:10.1007/978-3-662-49630-5_26 ISSN 0302-9743.
Narodowe Centrum Nauki [National Science Centre] (NCN)
Clemente, Lorenzo, Lasota, Slawomir, Lazic, Ranko and Mazowiecki, Filip (2017) Timed pushdown automata and branching vector addition systems. In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Reykjavik, Iceland, 20-23 Jun 2017. Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) ISBN 9781509030194. doi:10.1109/LICS.2017.8005083
Narodowe Centrum Nauki [Polish National Science Center]
Czerwiński, Wojciech, Daviaud, Laure, Fijalkow, Nathanael, Jurdzinski, Marcin, Lazic, Ranko and Parys, Pawel (2019) Universal trees grow inside separating automata : quasi-polynomial lower bounds for parity games. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), California, 6-9 Jan 2019. Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 2333-2349. ISBN 9781611975482. doi:10.1137/1.9781611975482.142
QinetiQ (Firm)
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) On model checking data-independent systems with arrays with whole-array operations. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) Polymorphic systems with arrays : decidability and undecidability. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Royal Society (Great Britain)
Figueira, Diego, Lazic, Ranko, Leroux, Jerome, Mazowiecki, Filip and Sutre, Grégoire (2017) Polynomial-space completeness of reachability for succinct branching VASS in dimension one. In: The 44th International Colloquium on Automata, Languages, and Programming (ICALP), Warsaw, Poland, 10-14 Jul 2017. Published in: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 80 119 : 1-119: 14. ISBN 9783959770415. doi:10.4230/LIPIcs.ICALP.2017.119 ISSN 1868-8969.
Lazic, Ranko and Totzke, Patrick (2017) What makes petri nets harder to verify : stack or data?, Concurrency, security, and puzzles : Festschrift for A.W. Roscoe on the occasion of his 60th birthday. In: Concurrency, Security, and Puzzles : Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, 10160 . Springer, pp. 144-161. ISBN 9783319510453
United States. Office of Naval Research
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) On model checking data-independent systems with arrays with whole-array operations. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
Lazic, Ranko, Newcomb, Tom and Roscoe, A. W. (2004) Polymorphic systems with arrays : decidability and undecidability. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
École normale supérieure (Cachan, France) (ENS)
Demri, Stéphane P. and Lazic, Ranko (2009) LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic (TOCL), Vol.10 (No.3). p. 16. doi:10.1145/1507244.1507246 ISSN 1529-3785.
This list was generated on Fri Mar 29 01:02:22 2024 GMT.