Automating separation logic using SMT
R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.

Structural Counter Abstraction
K. Bansal, E. Koskinen, T. Wies, D. Zufferey, 7795 (2013) 62–77.

Ideal abstractions for well structured transition systems
D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.

On an efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.

Static scheduling in clouds
T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, USENIX, 2011, pp. 1–6.

An efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.

Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.

Scheduling large jobs by abstraction refinement
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.

Counterexample-guided focus
A. Podelski, T. Wies, in:, ACM, 2010, pp. 249–260.

Building a calculus of data structures
V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.

A marketplace for cloud resources
T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2010, pp. 1–8.

FlexPRICE: Flexible provisioning of resources in a cloud environment
T.A. Henzinger, A. Tomar, V. Singh, T. Wies, D. Zufferey, in:, IEEE, 2010, pp. 83–90.

Doomed program points
J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.

Forward analysis of depth-bounded processes
T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.

Combining Theories with Shared Set Operations
T. Wies, R. Piskac, V. Kuncak, in:, Springer, 2009, pp. 366–382.

Abstraction Refinement for Quantified Array Assertions
M. Seghir, A. Podelski, T. Wies, in:, Springer, 2009, pp. 3–18.

Intra-module Inference
S. Lahiri, S. Qadeer, J. Galeotti, J. Voung, T. Wies, in:, Springer, 2009, pp. 493–508.

It's Doomed; We Can Prove It
J. Hoenicke, K.R. Leino, A. Podelski, M. Schäf, T. Wies, in:, Springer, 2009, pp. 338–353.

Heap Assumptions on Demand
A. Podelski, A. Rybalchenko, T. Wies, in:, Springer, 2008, pp. 314–327.

Using First-Order Theorem Provers in the Jahob Data Structure Verification System
C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, M. Rinard, in:, Springer, 2007, pp. 74–88.