Thomas Wies
Henzinger_Thomas Group
23 Publications
2013 | Conference Paper | IST-REx-ID: 2447 | 
Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_54.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2847 |
Bansal, Kshitij, Eric Koskinen, Thomas Wies, and Damien Zufferey. “Structural Counter Abstraction.” Edited by Nir Piterman and Scott Smolka. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-36742-7_5.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 3251 |
Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_29.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3302 |
Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.
[Submitted Version]
View
| Files available
2011 | Conference Paper | IST-REx-ID: 3324 |
Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. https://doi.org/10.1007/978-3-642-18275-4_26.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3358 |
Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. https://doi.org/10.1145/1966445.1966476.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Technical Report | IST-REx-ID: 5383 |
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3323
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.
View
| Files available
| DOI
2010 | Conference Paper | IST-REx-ID: 4364
Podelski, Andreas, and Thomas Wies. “Counterexample-Guided Focus,” 249–60. ACM, 2010. https://doi.org/10.1145/1707801.1706330.
View
| DOI
2010 | Conference Paper | IST-REx-ID: 4378 |
Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. https://doi.org/10.1007/978-3-642-11319-2_6.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2010 | Conference Paper | IST-REx-ID: 4381 |
Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,” 83–90. IEEE, 2010. https://doi.org/10.1109/CLOUD.2010.71.
[Submitted Version]
View
| Files available
| DOI
2010 | Conference Paper | IST-REx-ID: 4380 |
Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,” 1–8. ACM, 2010. https://doi.org/10.1145/1879021.1879022.
[Submitted Version]
View
| Files available
| DOI
2010 | Journal Article | IST-REx-ID: 533
Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” Formal Methods in System Design. Springer, 2010. https://doi.org/10.1007/s10703-010-0102-0.
View
| DOI
2010 | Conference Paper | IST-REx-ID: 4361 |
Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. https://doi.org/10.1007/978-3-642-12032-9_8.
[Submitted Version]
View
| Files available
| DOI
2009 | Conference Paper | IST-REx-ID: 4365
Seghir, Mohamed, Andreas Podelski, and Thomas Wies. “Abstraction Refinement for Quantified Array Assertions,” 3–18. Springer, 2009. https://doi.org/1556.
View
| DOI
2009 | Conference Paper | IST-REx-ID: 4360
Wies, Thomas, Ruzica Piskac, and Viktor Kuncak. “Combining Theories with Shared Set Operations,” 366–82. Springer, 2009. https://doi.org/1558.
View
| DOI
2009 | Conference Paper | IST-REx-ID: 4375
Lahiri, Shuvendu, Shaz Qadeer, Juan Galeotti, Jan Voung, and Thomas Wies. “Intra-Module Inference,” 493–508. Springer, 2009. https://doi.org/1555.
View
| DOI
2009 | Conference Paper | IST-REx-ID: 4377
Hoenicke, Jochen, K Rustan Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “It’s Doomed; We Can Prove It,” 338–53. Springer, 2009. https://doi.org/1557.
View
| DOI
2008 | Conference Paper | IST-REx-ID: 4366
Podelski, Andreas, Andrey Rybalchenko, and Thomas Wies. “Heap Assumptions on Demand,” 5123:314–27. Springer, 2008. https://doi.org/10.1007/978-3-540-70545-1_31.
View
| DOI
2007 | Conference Paper | IST-REx-ID: 4394
Bouillaguet, Charles, Viktor Kuncak, Thomas Wies, Karen Zee, and Martin Rinard. “Using First-Order Theorem Provers in the Jahob Data Structure Verification System,” 74–88. Springer, 2007. https://doi.org/1552.
View
| DOI
2007 | Conference Paper | IST-REx-ID: 4398
Berdine, Josh, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter O’Hearn, Thomas Wies, and Hongseok Yang. “Shape Analysis for Composite Data Structures,” 178–92. Springer, 2007. https://doi.org/1553.
View
| DOI
2006 | Conference Paper | IST-REx-ID: 4359
Wies, Thomas, Viktor Kuncak, Patrick Lam, Andreas Podelski, and Martin Rinard. “Field Constraint Analysis,” 157–73. Springer, 2006. https://doi.org/1551.
View
| DOI
2005 | Conference Paper | IST-REx-ID: 4367
Podelski, Andreas, and Thomas Wies. “Boolean Heaps,” 267–82. Springer, 2005. https://doi.org/1550.
View
| DOI
23 Publications
2013 | Conference Paper | IST-REx-ID: 2447 |
Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_54.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2847 |
Bansal, Kshitij, Eric Koskinen, Thomas Wies, and Damien Zufferey. “Structural Counter Abstraction.” Edited by Nir Piterman and Scott Smolka. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-36742-7_5.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 3251 |
Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_29.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3302 |
Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.
[Submitted Version]
View
| Files available
2011 | Conference Paper | IST-REx-ID: 3324 |
Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. https://doi.org/10.1007/978-3-642-18275-4_26.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3358 |
Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. https://doi.org/10.1145/1966445.1966476.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Technical Report | IST-REx-ID: 5383 |
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3323
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.
View
| Files available
| DOI
2010 | Conference Paper | IST-REx-ID: 4364
Podelski, Andreas, and Thomas Wies. “Counterexample-Guided Focus,” 249–60. ACM, 2010. https://doi.org/10.1145/1707801.1706330.
View
| DOI
2010 | Conference Paper | IST-REx-ID: 4378 |
Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. https://doi.org/10.1007/978-3-642-11319-2_6.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2010 | Conference Paper | IST-REx-ID: 4381 |
Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment,” 83–90. IEEE, 2010. https://doi.org/10.1109/CLOUD.2010.71.
[Submitted Version]
View
| Files available
| DOI
2010 | Conference Paper | IST-REx-ID: 4380 |
Henzinger, Thomas A, Anmol Tomar, Vasu Singh, Thomas Wies, and Damien Zufferey. “A Marketplace for Cloud Resources,” 1–8. ACM, 2010. https://doi.org/10.1145/1879021.1879022.
[Submitted Version]
View
| Files available
| DOI
2010 | Journal Article | IST-REx-ID: 533
Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” Formal Methods in System Design. Springer, 2010. https://doi.org/10.1007/s10703-010-0102-0.
View
| DOI
2010 | Conference Paper | IST-REx-ID: 4361 |
Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. https://doi.org/10.1007/978-3-642-12032-9_8.
[Submitted Version]
View
| Files available
| DOI
2009 | Conference Paper | IST-REx-ID: 4365
Seghir, Mohamed, Andreas Podelski, and Thomas Wies. “Abstraction Refinement for Quantified Array Assertions,” 3–18. Springer, 2009. https://doi.org/1556.
View
| DOI
2009 | Conference Paper | IST-REx-ID: 4360
Wies, Thomas, Ruzica Piskac, and Viktor Kuncak. “Combining Theories with Shared Set Operations,” 366–82. Springer, 2009. https://doi.org/1558.
View
| DOI
2009 | Conference Paper | IST-REx-ID: 4375
Lahiri, Shuvendu, Shaz Qadeer, Juan Galeotti, Jan Voung, and Thomas Wies. “Intra-Module Inference,” 493–508. Springer, 2009. https://doi.org/1555.
View
| DOI
2009 | Conference Paper | IST-REx-ID: 4377
Hoenicke, Jochen, K Rustan Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “It’s Doomed; We Can Prove It,” 338–53. Springer, 2009. https://doi.org/1557.
View
| DOI
2008 | Conference Paper | IST-REx-ID: 4366
Podelski, Andreas, Andrey Rybalchenko, and Thomas Wies. “Heap Assumptions on Demand,” 5123:314–27. Springer, 2008. https://doi.org/10.1007/978-3-540-70545-1_31.
View
| DOI
2007 | Conference Paper | IST-REx-ID: 4394
Bouillaguet, Charles, Viktor Kuncak, Thomas Wies, Karen Zee, and Martin Rinard. “Using First-Order Theorem Provers in the Jahob Data Structure Verification System,” 74–88. Springer, 2007. https://doi.org/1552.
View
| DOI
2007 | Conference Paper | IST-REx-ID: 4398
Berdine, Josh, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter O’Hearn, Thomas Wies, and Hongseok Yang. “Shape Analysis for Composite Data Structures,” 178–92. Springer, 2007. https://doi.org/1553.
View
| DOI
2006 | Conference Paper | IST-REx-ID: 4359
Wies, Thomas, Viktor Kuncak, Patrick Lam, Andreas Podelski, and Martin Rinard. “Field Constraint Analysis,” 157–73. Springer, 2006. https://doi.org/1551.
View
| DOI
2005 | Conference Paper | IST-REx-ID: 4367
Podelski, Andreas, and Thomas Wies. “Boolean Heaps,” 267–82. Springer, 2005. https://doi.org/1550.
View
| DOI