Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:10.1007/978-3-642-39799-8_54
LibreCat: https://research-explorer.ista.ac.at/record/2447
DOI: 10.1007/978-3-642-39799-8_54

Bansal K, Koskinen E, Wies T, Zufferey D. Structural Counter Abstraction. Piterman N, Smolka S, eds. 2013;7795:62-77. doi:10.1007/978-3-642-36742-7_5
LibreCat: https://research-explorer.ista.ac.at/record/2847
DOI: 10.1007/978-3-642-36742-7_5

Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:10.1007/978-3-642-27940-9_29
LibreCat: https://research-explorer.ista.ac.at/record/3251
DOI: 10.1007/978-3-642-27940-9_29

Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: USENIX; 2011:1-6.
LibreCat: https://research-explorer.ista.ac.at/record/3302

Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:10.1007/978-3-642-18275-4_26
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction refinement. In: ACM; 2011:329-342. doi:10.1145/1966445.1966476
LibreCat: https://research-explorer.ista.ac.at/record/3358
DOI: 10.1145/1966445.1966476

Wies T, Muñiz M, Kuncak V. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria; 2011. doi:10.15479/AT:IST-2011-0005
LibreCat: https://research-explorer.ista.ac.at/record/5383
DOI: 10.15479/AT:IST-2011-0005

Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36
LibreCat: https://research-explorer.ista.ac.at/record/3323
DOI: 10.1007/978-3-642-22438-6_36

Podelski A, Wies T. Counterexample-guided focus. In: ACM; 2010:249-260. doi:10.1145/1707801.1706330
LibreCat: https://research-explorer.ista.ac.at/record/4364
DOI: 10.1145/1707801.1706330

Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures. In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:10.1007/978-3-642-11319-2_6
LibreCat: https://research-explorer.ista.ac.at/record/4378
DOI: 10.1007/978-3-642-11319-2_6

Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. FlexPRICE: Flexible provisioning of resources in a cloud environment. In: IEEE; 2010:83-90. doi:10.1109/CLOUD.2010.71
LibreCat: https://research-explorer.ista.ac.at/record/4381
DOI: 10.1109/CLOUD.2010.71

Henzinger TA, Tomar A, Singh V, Wies T, Zufferey D. A marketplace for cloud resources. In: ACM; 2010:1-8. doi:10.1145/1879021.1879022
LibreCat: https://research-explorer.ista.ac.at/record/4380
DOI: 10.1145/1879021.1879022

Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. Formal Methods in System Design. 2010;37(2-3):171-199. doi:10.1007/s10703-010-0102-0
LibreCat: https://research-explorer.ista.ac.at/record/533
DOI: 10.1007/s10703-010-0102-0

Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:10.1007/978-3-642-12032-9_8
LibreCat: https://research-explorer.ista.ac.at/record/4361
DOI: 10.1007/978-3-642-12032-9_8

Seghir M, Podelski A, Wies T. Abstraction Refinement for Quantified Array Assertions. In: Springer; 2009:3-18. doi:1556
LibreCat: https://research-explorer.ista.ac.at/record/4365
DOI: 1556

Wies T, Piskac R, Kuncak V. Combining Theories with Shared Set Operations. In: Springer; 2009:366-382. doi:1558
LibreCat: https://research-explorer.ista.ac.at/record/4360
DOI: 1558

Lahiri S, Qadeer S, Galeotti J, Voung J, Wies T. Intra-module Inference. In: Springer; 2009:493-508. doi:1555
LibreCat: https://research-explorer.ista.ac.at/record/4375
DOI: 1555

Hoenicke J, Leino KR, Podelski A, Schäf M, Wies T. It’s Doomed; We Can Prove It. In: Springer; 2009:338-353. doi:1557
LibreCat: https://research-explorer.ista.ac.at/record/4377
DOI: 1557

Podelski A, Rybalchenko A, Wies T. Heap Assumptions on Demand. In: Vol 5123. Springer; 2008:314-327. doi:10.1007/978-3-540-70545-1_31
LibreCat: https://research-explorer.ista.ac.at/record/4366
DOI: 10.1007/978-3-540-70545-1_31

Bouillaguet C, Kuncak V, Wies T, Zee K, Rinard M. Using First-Order Theorem Provers in the Jahob Data Structure Verification System. In: Springer; 2007:74-88. doi:1552
LibreCat: https://research-explorer.ista.ac.at/record/4394
DOI: 1552

Berdine J, Calcagno C, Cook B, et al. Shape Analysis for Composite Data Structures. In: Springer; 2007:178-192. doi:1553
LibreCat: https://research-explorer.ista.ac.at/record/4398
DOI: 1553

Wies T, Kuncak V, Lam P, Podelski A, Rinard M. Field Constraint Analysis. In: Springer; 2006:157-173. doi:1551
LibreCat: https://research-explorer.ista.ac.at/record/4359
DOI: 1551

Podelski A, Wies T. Boolean Heaps. In: Springer; 2005:267-282. doi:1550
LibreCat: https://research-explorer.ista.ac.at/record/4367
DOI: 1550