Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
389 Publications
2011 | Technical Report | IST-REx-ID: 5385 | 
Boker, Udi, et al. Temporal Specifications with Accumulative Values. IST Austria, 2011, doi:10.15479/AT:IST-2011-0003.
[Published Version]
View
| Files available
| DOI
2011 | 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 | 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 | Conference Paper | IST-REx-ID: 3366 |
Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20.
[Submitted Version]
View
| Files available
| DOI
2010 | Conference Paper | IST-REx-ID: 10908 |
Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)