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.

437 Publications


2012 | Published | Conference Paper | IST-REx-ID: 10906 | OA
Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.
[Published Version] View | DOI | Download Published Version (ext.)
 

2012 | Published | Journal Article | IST-REx-ID: 3168 | OA
Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 

2012 | Published | Journal Article | IST-REx-ID: 3249 | OA
Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3264
Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3299 | OA
Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology, 1–3.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3301 | OA
Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP).
[Submitted Version] View | Files available
 

2011 | Published | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.
[Submitted Version] View | Files available
 

2011 | Published | Conference Paper | IST-REx-ID: 3323
Wies T, Muñiz M, Kuncak V. 2011. An efficient decision procedure for imperative tree data structures. CADE 23: Automated Deduction , LNAI , vol. 6803, 476–491.
View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3324 | OA
Piskac R, Wies T. 2011. Decision procedures for automating termination proofs. VMCAI: Verification Model Checking and Abstract Interpretation, LNCS, vol. 6538, 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3325
Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610.
View | DOI | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3326 | OA
Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Journal Article | IST-REx-ID: 3352
Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.
View | DOI | WoS
 

2011 | Published | Journal Article | IST-REx-ID: 3353 | OA
Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4), 14.
[Submitted Version] View | Files available | DOI | WoS
 

earlier version | 2011 | Published | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
View | Files available | DOI | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3355 | OA
Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264.
[Submitted Version] View | Files available | DOI
 

earlier version | 2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI | WoS
 

2011 | Published | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI | WoS
 

Filters and Search Terms

department=ToHe

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed