23 Publications

Mark all

[23]
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.
View | Files available | DOI
 
[22]
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.
View | Files available | DOI | Download Submitted Version (ext.)
 
[21]
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.
View | Files available | DOI
 
[20]
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.
View | Files available | DOI
 
[19]
2011 | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger, Thomas A., et al. Static Scheduling in Clouds. USENIX, 2011, pp. 1–6.
View | Files available
 
[18]
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
 
[17]
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.
View | DOI | Download Submitted Version (ext.)
 
[16]
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.
View | DOI | Download Published Version (ext.)
 
[15]
2010 | Journal Article | IST-REx-ID: 533
Hoenicke, Jochen, et al. “Doomed Program Points.” Formal Methods in System Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.
View | DOI
 
[14]
2010 | Conference Paper | IST-REx-ID: 4364
Podelski, Andreas, and Thomas Wies. Counterexample-Guided Focus. ACM, 2010, pp. 249–60, doi:10.1145/1707801.1706330.
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 4378 | OA
Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:10.1007/978-3-642-11319-2_6.
View | DOI | Download Submitted Version (ext.)
 
[12]
2010 | Conference Paper | IST-REx-ID: 4380 | OA
Henzinger, Thomas A., et al. A Marketplace for Cloud Resources. ACM, 2010, pp. 1–8, doi:10.1145/1879021.1879022.
View | Files available | DOI
 
[11]
2010 | Conference Paper | IST-REx-ID: 4381 | OA
Henzinger, Thomas A., et al. FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment. IEEE, 2010, pp. 83–90, doi:10.1109/CLOUD.2010.71.
View | Files available | DOI
 
[10]
2010 | Conference Paper | IST-REx-ID: 4361 | OA
Wies, Thomas, et al. Forward Analysis of Depth-Bounded Processes. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.
View | Files available | DOI
 
[9]
2009 | Conference Paper | IST-REx-ID: 4360
Wies, Thomas, et al. Combining Theories with Shared Set Operations. Springer, 2009, pp. 366–82, doi:1558.
View | DOI
 
[8]
2009 | Conference Paper | IST-REx-ID: 4365
Seghir, Mohamed, et al. Abstraction Refinement for Quantified Array Assertions. Springer, 2009, pp. 3–18, doi:1556.
View | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4375
Lahiri, Shuvendu, et al. Intra-Module Inference. Springer, 2009, pp. 493–508, doi:1555.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4377
Hoenicke, Jochen, et al. It’s Doomed; We Can Prove It. Springer, 2009, pp. 338–53, doi:1557.
View | DOI
 
[5]
2008 | Conference Paper | IST-REx-ID: 4366
Podelski, Andreas, et al. Heap Assumptions on Demand. Vol. 5123, Springer, 2008, pp. 314–27, doi:10.1007/978-3-540-70545-1_31.
View | DOI
 
[4]
2007 | Conference Paper | IST-REx-ID: 4394
Bouillaguet, Charles, et al. Using First-Order Theorem Provers in the Jahob Data Structure Verification System. Springer, 2007, pp. 74–88, doi:1552.
View | DOI
 
[3]
2007 | Conference Paper | IST-REx-ID: 4398
Berdine, Josh, et al. Shape Analysis for Composite Data Structures. Springer, 2007, pp. 178–92, doi:1553.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4359
Wies, Thomas, et al. Field Constraint Analysis. Springer, 2006, pp. 157–73, doi:1551.
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4367
Podelski, Andreas, and Thomas Wies. Boolean Heaps. Springer, 2005, pp. 267–82, doi:1550.
View | DOI
 

Search

Filter Publications

23 Publications

Mark all

[23]
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.
View | Files available | DOI
 
[22]
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.
View | Files available | DOI | Download Submitted Version (ext.)
 
[21]
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.
View | Files available | DOI
 
[20]
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.
View | Files available | DOI
 
[19]
2011 | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger, Thomas A., et al. Static Scheduling in Clouds. USENIX, 2011, pp. 1–6.
View | Files available
 
[18]
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
 
[17]
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.
View | DOI | Download Submitted Version (ext.)
 
[16]
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.
View | DOI | Download Published Version (ext.)
 
[15]
2010 | Journal Article | IST-REx-ID: 533
Hoenicke, Jochen, et al. “Doomed Program Points.” Formal Methods in System Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.
View | DOI
 
[14]
2010 | Conference Paper | IST-REx-ID: 4364
Podelski, Andreas, and Thomas Wies. Counterexample-Guided Focus. ACM, 2010, pp. 249–60, doi:10.1145/1707801.1706330.
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 4378 | OA
Kuncak, Viktor, et al. Building a Calculus of Data Structures. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:10.1007/978-3-642-11319-2_6.
View | DOI | Download Submitted Version (ext.)
 
[12]
2010 | Conference Paper | IST-REx-ID: 4380 | OA
Henzinger, Thomas A., et al. A Marketplace for Cloud Resources. ACM, 2010, pp. 1–8, doi:10.1145/1879021.1879022.
View | Files available | DOI
 
[11]
2010 | Conference Paper | IST-REx-ID: 4381 | OA
Henzinger, Thomas A., et al. FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment. IEEE, 2010, pp. 83–90, doi:10.1109/CLOUD.2010.71.
View | Files available | DOI
 
[10]
2010 | Conference Paper | IST-REx-ID: 4361 | OA
Wies, Thomas, et al. Forward Analysis of Depth-Bounded Processes. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.
View | Files available | DOI
 
[9]
2009 | Conference Paper | IST-REx-ID: 4360
Wies, Thomas, et al. Combining Theories with Shared Set Operations. Springer, 2009, pp. 366–82, doi:1558.
View | DOI
 
[8]
2009 | Conference Paper | IST-REx-ID: 4365
Seghir, Mohamed, et al. Abstraction Refinement for Quantified Array Assertions. Springer, 2009, pp. 3–18, doi:1556.
View | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4375
Lahiri, Shuvendu, et al. Intra-Module Inference. Springer, 2009, pp. 493–508, doi:1555.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4377
Hoenicke, Jochen, et al. It’s Doomed; We Can Prove It. Springer, 2009, pp. 338–53, doi:1557.
View | DOI
 
[5]
2008 | Conference Paper | IST-REx-ID: 4366
Podelski, Andreas, et al. Heap Assumptions on Demand. Vol. 5123, Springer, 2008, pp. 314–27, doi:10.1007/978-3-540-70545-1_31.
View | DOI
 
[4]
2007 | Conference Paper | IST-REx-ID: 4394
Bouillaguet, Charles, et al. Using First-Order Theorem Provers in the Jahob Data Structure Verification System. Springer, 2007, pp. 74–88, doi:1552.
View | DOI
 
[3]
2007 | Conference Paper | IST-REx-ID: 4398
Berdine, Josh, et al. Shape Analysis for Composite Data Structures. Springer, 2007, pp. 178–92, doi:1553.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4359
Wies, Thomas, et al. Field Constraint Analysis. Springer, 2006, pp. 157–73, doi:1551.
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4367
Podelski, Andreas, and Thomas Wies. Boolean Heaps. Springer, 2005, pp. 267–82, doi:1550.
View | DOI
 

Search

Filter Publications