Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
401 Publications
2014 | Published | Conference Paper | IST-REx-ID: 2027 | 
Brázdil, Tomáš, et al. “Verification of Markov Decision Processes Using Learning Algorithms.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, vol. 8837, Society of Industrial and Applied Mathematics, 2014, pp. 98–114, doi:10.1007/978-3-319-11936-6_8.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Journal Article | IST-REx-ID: 2038 |
Boker, Udi, et al. “Temporal Specifications with Accumulative Values.” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4, 27, ACM, 2014, doi:10.1145/2629686.
[Submitted Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2053 |
Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–65, doi:10.1007/978-3-662-44584-6_18.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Journal Article | IST-REx-ID: 2056 |
Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial Reaction Networks.” Journal of Mathematical Biology, vol. 69, no. 3, Springer, 2014, pp. 767–97, doi:10.1007/s00285-013-0738-7.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Journal Article | IST-REx-ID: 2187 |
Bloem, Roderick, et al. “Synthesizing Robust Systems.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.
[Submitted Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2190 |
Esparza, Javier, and Jan Kretinsky. From LTL to Deterministic Automata: A Safraless Compositional Approach. Vol. 8559, Springer, 2014, pp. 192–208, doi:10.1007/978-3-319-08867-9_13.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Conference Paper | IST-REx-ID: 2217
Henzinger, Thomas A., and Jan Otop. “Model Measuring for Hybrid Systems.” Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control, Springer, 2014, pp. 213–22, doi:10.1145/2562059.2562130.
View
| Files available
| DOI
2014 | Published | Journal Article | IST-REx-ID: 2233 |
Boker, Udi, and Thomas A. Henzinger. “Exact and Approximate Determinization of Discounted-Sum Automata.” Logical Methods in Computer Science, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:10.2168/LMCS-10(1:10)2014.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2239
Boker, Udi, et al. Battery Transition Systems. Vol. 49, no. 1, ACM, 2014, pp. 595–606, doi:10.1145/2535838.2535875.
View
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5411 |
Daca, Przemyslaw, et al. Compositional Specifications for IOCO Testing. IST Austria, 2014, doi:10.15479/AT:IST-2014-148-v2-1.
[Published Version]
View
| Files available
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5416 |
Henzinger, Thomas A., and Jan Otop. Model Measuring for Hybrid Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-171-v1-1.
[Published Version]
View
| Files available
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5417 |
Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1.
[Published Version]
View
| Files available
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5428 |
Chatterjee, Krishnendu, et al. Quantitative Fair Simulation Games. IST Austria, 2014, doi:10.15479/AT:IST-2014-315-v1-1.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 1702 |
Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 169, Open Publishing, 2014, pp. 31–38, doi:10.4204/EPTCS.169.5.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Journal Article | IST-REx-ID: 1733 |
Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 | Published | Conference Paper | IST-REx-ID: 1392 |
Dragoi, Cezara, et al. A Logic-Based Framework for Verifying Consensus Algorithms. Vol. 8318, Springer, 2014, pp. 161–81, doi:10.1007/978-3-642-54013-4_10.
[Submitted Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 1393 |
Gordon, Andrew, et al. “Probabilistic Programming.” Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–81, doi:10.1145/2593882.2593900.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2013 | Published | Conference Paper | IST-REx-ID: 2445 |
Cerny, Pavol, et al. Efficient Synthesis for Concurrency by Semantics-Preserving Transformations. Vol. 8044, Springer, 2013, pp. 951–67, doi:10.1007/978-3-642-39799-8_68.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2181 |
Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2182
Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.
View
| DOI