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

2014 | Technical Report | IST-REx-ID: 5417 | OA
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 | Technical Report | IST-REx-ID: 5416 | OA
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 | Technical Report | IST-REx-ID: 5415 | OA
Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria, 2014, doi:10.15479/AT:IST-2014-170-v1-1.
[Published Version] View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2218 | OA
Cerny, Pavol, et al. Regression-Free Synthesis for Concurrency. Vol. 8559, Springer, 2014, pp. 568–84, doi:10.1007/978-3-319-08867-9_38.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2014 | Conference Paper | IST-REx-ID: 2167 | OA
Daca, Przemyslaw, et al. “Compositional Specifications for IOCO Testing.” IEEE 7th International Conference on Software Testing, Verification and Validation, 6823899, IEEE, 2014, doi:10.1109/ICST.2014.50.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic Systems. Vol. 8559, Springer, 2014, pp. 473–90, doi:10.1007/978-3-319-08867-9_31.
View | Files available | DOI
 
2014 | Technical Report | IST-REx-ID: 5428 | OA
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
 
2013 | Conference Paper | IST-REx-ID: 10898
Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, no. 5, 17, ACM Press, 2013, doi:10.1145/2482767.2482789.
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 1385 | OA
Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 1387 | OA
Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11.
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2181 | OA
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 | 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
 
2013 | Conference Paper | IST-REx-ID: 2237 | OA
Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer, 2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2243 | OA
Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.
[Published Version] View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2289 | OA
Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7.
[Published Version] View | Files available | DOI
 
2013 | Conference (Editor) | IST-REx-ID: 2288
Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6.
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 2298 | OA
Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.
[Submitted Version] View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2299 | OA
Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2301
Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.
View | DOI | Download None (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2328 | OA
Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:10.1007/978-3-642-40184-8_18.
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2447 | OA
Piskac, Ruzica, et al. Automating Separation Logic Using SMT. Vol. 8044, Springer, 2013, pp. 773–89, doi:10.1007/978-3-642-39799-8_54.
[Submitted Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2517 | OA
Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3.
[Submitted Version] View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2854 | OA
Chatterjee, Krishnendu, et al. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.” Journal of Computer and System Sciences, vol. 79, no. 5, Elsevier, 2013, pp. 640–57, doi:10.1016/j.jcss.2012.12.001.
[Published Version] View | Files available | DOI
 
2013 | Conference (Editor) | IST-REx-ID: 2885
Kucera, Antonin, et al., editors. Mathematical and Engineering Methods in Computer Science. Vol. 7721, Springer, 2013, pp. 1–228, doi:10.1007/978-3-642-36046-6.
View | DOI
 
2013 | Technical Report | IST-REx-ID: 5402 | OA
Henzinger, Thomas A., and Ali Sezgin. How Free Is Your Linearizable Concurrent Data Structure? IST Austria, 2013, doi:10.15479/AT:IST-2013-123-v1-1.
[Published Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25, doi:10.1109/FMCAD.2013.6679386.
View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 5406 | OA
Chatterjee, Krishnendu, et al. Distributed Synthesis for LTL Fragments. IST Austria, 2013, doi:10.15479/AT:IST-2013-130-v1-1.
[Published Version] View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2327 | OA
Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring. Vol. 8052, Springer, 2013, pp. 273–87, doi:10.1007/978-3-642-40184-8_20.
[Submitted Version] View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 6440 | OA
Henzinger, Thomas A., et al. Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues . IST Austria, 2013, doi:10.15479/AT:IST-2013-124-v1-1.
[Published Version] View | Files available | DOI
 
2013 | Book Chapter | IST-REx-ID: 5747 | OA
Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.
View | Files available | DOI
 
2013 | Thesis | IST-REx-ID: 1405 | OA
Zufferey, Damien. Analysis of Dynamic Message Passing Programs. Institute of Science and Technology Austria, 2013, doi:10.15479/at:ista:1405.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2847 | OA
Bansal, Kshitij, et al. Structural Counter Abstraction. Edited by Nir Piterman and Scott Smolka, vol. 7795, Springer, 2013, pp. 62–77, doi:10.1007/978-3-642-36742-7_5.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2445 | OA
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
 
2012 | Conference Paper | IST-REx-ID: 1384 | OA
Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, 57, ACM, 2012, doi:10.1145/2393596.2393664.
[Preprint] View | DOI | Download Preprint (ext.)
 
2012 | Journal Article | IST-REx-ID: 2302
Henzinger, Thomas A., and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2, IEEE, 2012, pp. 310–22, doi:10.1109/TCBB.2012.91.
View | DOI | PubMed | Europe PMC
 
2012 | Journal Article | IST-REx-ID: 2848 | OA
Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.” Journal of Theoretical Biology, vol. 301, Elsevier, 2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
2012 | Conference Paper | IST-REx-ID: 2891 | OA
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 | Conference Paper | IST-REx-ID: 2890
Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62, doi:10.1145/2380356.2380371.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 2888
Henzinger, Thomas A. “Quantitative Reactive Models.” Conference Proceedings MODELS 2012, vol. 7590, Springer, 2012, pp. 1–2, doi:10.1007/978-3-642-33666-9_1.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, Pavol, et al. “Interface Simulation Distances.” Electronic Proceedings in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.
[Preprint] View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2942
Henzinger, Thomas A., and Dejan Nickovic. “Independent Implementability of Viewpoints.” Conference Proceedings Monterey Workshop 2012, vol. 7539, Springer, 2012, pp. 380–95, doi:10.1007/978-3-642-34059-8_20.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3136
Guet, Calin C., et al. Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits. Vol. 7358, Springer, 2012, pp. 294–309, doi:10.1007/978-3-642-31424-7_24.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3162 | OA
Asarin, Eugene, et al. Parametric Identification of Temporal Properties. Vol. 7186, Springer, 2012, pp. 147–60, doi:10.1007/978-3-642-29860-8_12.
[Submitted Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3253
Bouajjani, Ahmed, et al. Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data. Vol. 7148, Springer, 2012, pp. 1–22, doi:10.1007/978-3-642-27940-9_1.
View | DOI
 
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
 
2011 | 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
 
2011 | Conference Paper | IST-REx-ID: 3362 | OA
Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27.
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, Krishnendu, et al. QUASY: Quantitative Synthesis Tool. Vol. 6605, Springer, 2011, pp. 267–71, doi:10.1007/978-3-642-19835-9_24.
[Submitted Version] View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3381 | OA
Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:10.1142/S0129054111008441.
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.
[Published Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3326 | OA
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 | 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
 
2011 | Conference Paper | IST-REx-ID: 3324 | OA
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 | Conference Paper | IST-REx-ID: 3360 | OA
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 | Conference Paper | IST-REx-ID: 3361 | OA
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
 
2011 | Conference Paper | IST-REx-ID: 3358 | OA
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 | 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 | 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 | Journal Article | IST-REx-ID: 3364 | OA
Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular Processes.” Theoretical Computer Science, vol. 412, no. 21, Elsevier, 2011, pp. 2128–41, doi:10.1016/j.tcs.2010.10.022.
[Submitted Version] View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 531 | OA
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.)
 
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, Udi, et al. Temporal Specifications with Accumulative Values. 5970226, IEEE, 2011, doi:10.1109/LICS.2011.33.
[Submitted Version] View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5385 | OA
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 | OA
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 | OA
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 | OA
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.)
 
2010 | Conference Paper | IST-REx-ID: 3719 | OA
Feret, Jérôme, et al. Lumpability Abstractions of Rule-Based Systems. Vol. 40, Open Publishing Association, 2010, pp. 142–61.
[Submitted Version] View | Files available | arXiv
 
2010 | Conference Paper | IST-REx-ID: 3847 | OA
Didier, Frédéric, et al. SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks. IEEE, 2010, pp. 193–94, doi:10.1109/QEST.2010.33.
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3845 | OA
Henzinger, Thomas A., et al. Aligators for Arrays. Vol. 6397, Springer, 2010, pp. 348–56, doi:10.1007/978-3-642-16242-8_25.
[Submitted Version] View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 3842 | OA
Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.” IET Systems Biology, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:10.1049/iet-syb.2010.0005.
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer, 2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. Formal Modeling and Analysis of Timed Systems. Vol. 6246, Springer, 2010, doi:10.1007/978-3-642-15297-9.
View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 4369 | OA
Nickovic, Dejan, and Nir Piterman. From MTL to Deterministic Timed Automata. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:10.1007/978-3-642-15297-9_13.
[Submitted Version] View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 3834 | OA
Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.” BMC Systems Biology, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:10.1186/1752-0509-4-42.
[Published Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3840
Henzinger, Thomas A. From Boolean to Quantitative Notions of Correctness. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:10.1145/1706299.1706319.
View | DOI
 
2010 | Conference Paper | IST-REx-ID: 3839 | OA
Henzinger, Thomas A., et al. Invariant and Type Inference for Matrices. Vol. 5944, Springer, 2010, pp. 163–79, doi:10.1007/978-3-642-11319-2_14.
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3838 | OA
Henzinger, Thomas A., et al. Hybrid Numerical Solution of the Chemical Master Equation. Springer, 2010, pp. 55–65, doi:10.1145/1839764.1839772.
[Submitted Version] View | Files available | DOI
 
2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.
[Submitted Version] View | Files available | DOI
 

Search

Filter Publications