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.




386 Publications

2012 | Journal Article | IST-REx-ID: 3168
Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science, vol. 431, Elsevier, 2012, pp. 137–64, doi:10.1016/j.tcs.2011.12.059.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2012 | Journal Article | IST-REx-ID: 3128 | OA
Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.
[Submitted Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3155 | OA
Delahaye, Benoît, et al. Synchronous Interface Theories and Time Triggered Scheduling. Vol. 7273, Springer, 2012, pp. 203–18, doi:10.1007/978-3-642-30793-5_13.
[Submitted Version] View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3836
Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” Science of Computer Programming, vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:10.1016/j.scico.2010.06.004.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 2967
Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3, 27, ACM, 2012, doi:10.1145/2287718.2287727.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 494
Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4, 29, ACM, 2012, doi:10.1145/2362355.2362357.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3249
Cerny, Pavol, et al. “Simulation Distances.” Theoretical Computer Science, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:10.1016/j.tcs.2011.08.002.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 10903
Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” Automated Technology for Verification and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 10906 | OA
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 | Book Chapter | IST-REx-ID: 5745 | OA
Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” Automated Technology for Verification and Analysis, vol. 7561, Springer Berlin Heidelberg, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3251 | OA
Zufferey, Damien, et al. Ideal Abstractions for Well Structured Transition Systems. Vol. 7148, Springer, 2012, pp. 445–60, doi:10.1007/978-3-642-27940-9_29.
[Submitted Version] View | Files available | DOI
 
2011 | 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 | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger, Thomas A., et al. Static Scheduling in Clouds. USENIX, 2011, pp. 1–6.
[Submitted Version] View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3301 | OA
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 | Conference Paper | IST-REx-ID: 3299 | OA
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 | Conference Paper | IST-REx-ID: 3316 | OA
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 | Journal Article | IST-REx-ID: 3353 | OA
Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4, 14, ACM, 2011, doi:10.1145/1985342.1985345.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3355 | OA
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 | Journal Article | IST-REx-ID: 3354
Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4, 28, ACM, 2011, doi:10.1145/1970398.1970404.
View | Files available | DOI
 

Search

Filter Publications