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.
447 Publications
2012 |
Published |
Conference Paper |
IST-REx-ID: 2891 |
Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” Leibniz International Proceedings in Informatics, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:10.4230/LIPIcs.FSTTCS.2012.362.
[Published Version]
View
| Files available
| DOI
2012 |
Published |
Conference Paper |
IST-REx-ID: 10906 |
Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:10.1007/978-3-642-28756-5_46.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 |
Published |
Conference Paper |
IST-REx-ID: 2936 |
Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Proceedings of the 10th ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |
Published |
Journal Article |
IST-REx-ID: 531 |
Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” Formal Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
earlier version | 2011 |
Published |
Technical Report |
IST-REx-ID: 5383 |
Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005.
[Published Version]
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3264
Gupta, Ashutosh, et al. Solving Recursion-Free Horn Clauses over LI+UIF. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:10.1007/978-3-642-25318-8_16.
View
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3299 |
Henzinger, Thomas A., and Maria Mateescu. Propagation Models for Computing Biochemical Reaction Networks. Springer, 2011, pp. 1–3, doi:10.1145/2037509.2037510.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3301 |
Henzinger, Thomas A., and Maria Mateescu. Tail Approximation for the Chemical Master Equation. Tampere International Center for Signal Processing, 2011.
[Submitted Version]
View
| Files available
2011 |
Published |
Conference Paper |
IST-REx-ID: 3316 |
Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |
Published |
Conference Paper |
IST-REx-ID: 3323
Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36.
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3324 |
Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:10.1007/978-3-642-18275-4_26.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |
Published |
Conference Paper |
IST-REx-ID: 3325
Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454.
View
| DOI
| WoS
2011 |
Published |
Conference Paper |
IST-REx-ID: 3326 |
Almagor, Shaull, et al. What’s Decidable about Weighted Automata. Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
Journal Article |
IST-REx-ID: 3352
Fisher, Jasmin, et al. “Biology as Reactivity.” Communications of the ACM, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:10.1145/2001269.2001289.
View
| DOI
| WoS
2011 |
Published |
Conference Paper |
IST-REx-ID: 3355 |
Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE, 2011, pp. 255–64, doi:10.1109/QEST.2011.40.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3357
Chatterjee, Krishnendu, et al. The Complexity of Request-Response Games. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:10.1007/978-3-642-21254-3_17.
View
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3358 |
Henzinger, Thomas A., et al. Scheduling Large Jobs by Abstraction Refinement. ACM, 2011, pp. 329–42, doi:10.1145/1966445.1966476.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |
Published |
Conference Paper |
IST-REx-ID: 3359
Cerny, Pavol, and Thomas A. Henzinger. From Boolean to Quantitative Synthesis. ACM, 2011, pp. 149–54, doi:10.1145/2038642.2038666.
View
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3360 |
Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82.
[Published Version]
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3361 |
Cerny, Pavol, et al. The Complexity of Quantitative Information Flow Problems. IEEE, 2011, pp. 205–17, doi:10.1109/CSF.2011.21.
[Submitted Version]
View
| Files available
| DOI
| WoS