23 Publications

Mark all

[23]
2013 | Conference Paper | IST-REx-ID: 2447 | OA
R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.
[Submitted Version] View | Files available | DOI
 
[22]
2013 | Conference Paper | IST-REx-ID: 2847 | OA
K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[21]
2012 | Conference Paper | IST-REx-ID: 3251 | OA
D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.
[Submitted Version] View | Files available | DOI
 
[20]
2011 | Conference Paper | IST-REx-ID: 3302 | OA
T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.
[Submitted Version] View | Files available
 
[19]
2011 | Conference Paper | IST-REx-ID: 3324 | OA
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[18]
2011 | Conference Paper | IST-REx-ID: 3358 | OA
T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342.
[Published Version] View | DOI | Download Published Version (ext.)
 
[17]
2011 | Technical Report | IST-REx-ID: 5383 | OA
T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3323
T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.
View | Files available | DOI
 
[15]
2010 | Conference Paper | IST-REx-ID: 4364
A. Podelski and T. Wies, “Counterexample-guided focus,” presented at the POPL: Principles of Programming Languages, 2010, pp. 249–260.
View | DOI
 
[14]
2010 | Conference Paper | IST-REx-ID: 4378 | OA
V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[13]
2010 | Conference Paper | IST-REx-ID: 4381 | OA
T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.
[Submitted Version] View | Files available | DOI
 
[12]
2010 | Conference Paper | IST-REx-ID: 4380 | OA
T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.
[Submitted Version] View | Files available | DOI
 
[11]
2010 | Journal Article | IST-REx-ID: 533
J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.
View | DOI
 
[10]
2010 | Conference Paper | IST-REx-ID: 4361 | OA
T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.
[Submitted Version] View | Files available | DOI
 
[9]
2009 | Conference Paper | IST-REx-ID: 4365
M. Seghir, A. Podelski, and T. Wies, “Abstraction Refinement for Quantified Array Assertions,” presented at the SAS: Static Analysis Symposium, 2009, pp. 3–18.
View | DOI
 
[8]
2009 | Conference Paper | IST-REx-ID: 4360
T. Wies, R. Piskac, and V. Kuncak, “Combining Theories with Shared Set Operations,” presented at the FroCoS: Frontiers of Combining Systems, 2009, pp. 366–382.
View | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4375
S. Lahiri, S. Qadeer, J. Galeotti, J. Voung, and T. Wies, “Intra-module Inference,” presented at the CAV: Computer Aided Verification, 2009, pp. 493–508.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4377
J. Hoenicke, K. R. Leino, A. Podelski, M. Schäf, and T. Wies, “It’s Doomed; We Can Prove It,” presented at the FM: Formal Methods, 2009, pp. 338–353.
View | DOI
 
[5]
2008 | Conference Paper | IST-REx-ID: 4366
A. Podelski, A. Rybalchenko, and T. Wies, “Heap Assumptions on Demand,” presented at the CAV: Computer Aided Verification, 2008, vol. 5123, pp. 314–327.
View | DOI
 
[4]
2007 | Conference Paper | IST-REx-ID: 4394
C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. Rinard, “Using First-Order Theorem Provers in the Jahob Data Structure Verification System,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, pp. 74–88.
View | DOI
 
[3]
2007 | Conference Paper | IST-REx-ID: 4398
J. Berdine et al., “Shape Analysis for Composite Data Structures,” presented at the CAV: Computer Aided Verification, 2007, pp. 178–192.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4359
T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard, “Field Constraint Analysis,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2006, pp. 157–173.
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4367
A. Podelski and T. Wies, “Boolean Heaps,” presented at the SAS: Static Analysis Symposium, 2005, pp. 267–282.
View | DOI
 

Search

Filter Publications

23 Publications

Mark all

[23]
2013 | Conference Paper | IST-REx-ID: 2447 | OA
R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.
[Submitted Version] View | Files available | DOI
 
[22]
2013 | Conference Paper | IST-REx-ID: 2847 | OA
K. Bansal, E. Koskinen, T. Wies, and D. Zufferey, “Structural Counter Abstraction,” vol. 7795. Springer, pp. 62–77, 2013.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[21]
2012 | Conference Paper | IST-REx-ID: 3251 | OA
D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.
[Submitted Version] View | Files available | DOI
 
[20]
2011 | Conference Paper | IST-REx-ID: 3302 | OA
T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.
[Submitted Version] View | Files available
 
[19]
2011 | Conference Paper | IST-REx-ID: 3324 | OA
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[18]
2011 | Conference Paper | IST-REx-ID: 3358 | OA
T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342.
[Published Version] View | DOI | Download Published Version (ext.)
 
[17]
2011 | Technical Report | IST-REx-ID: 5383 | OA
T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3323
T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.
View | Files available | DOI
 
[15]
2010 | Conference Paper | IST-REx-ID: 4364
A. Podelski and T. Wies, “Counterexample-guided focus,” presented at the POPL: Principles of Programming Languages, 2010, pp. 249–260.
View | DOI
 
[14]
2010 | Conference Paper | IST-REx-ID: 4378 | OA
V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[13]
2010 | Conference Paper | IST-REx-ID: 4381 | OA
T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “FlexPRICE: Flexible provisioning of resources in a cloud environment,” presented at the CLOUD: Cloud Computing, Miami, USA, 2010, pp. 83–90.
[Submitted Version] View | Files available | DOI
 
[12]
2010 | Conference Paper | IST-REx-ID: 4380 | OA
T. A. Henzinger, A. Tomar, V. Singh, T. Wies, and D. Zufferey, “A marketplace for cloud resources,” presented at the EMSOFT: Embedded Software , Arizona, USA, 2010, pp. 1–8.
[Submitted Version] View | Files available | DOI
 
[11]
2010 | Journal Article | IST-REx-ID: 533
J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.
View | DOI
 
[10]
2010 | Conference Paper | IST-REx-ID: 4361 | OA
T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.
[Submitted Version] View | Files available | DOI
 
[9]
2009 | Conference Paper | IST-REx-ID: 4365
M. Seghir, A. Podelski, and T. Wies, “Abstraction Refinement for Quantified Array Assertions,” presented at the SAS: Static Analysis Symposium, 2009, pp. 3–18.
View | DOI
 
[8]
2009 | Conference Paper | IST-REx-ID: 4360
T. Wies, R. Piskac, and V. Kuncak, “Combining Theories with Shared Set Operations,” presented at the FroCoS: Frontiers of Combining Systems, 2009, pp. 366–382.
View | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4375
S. Lahiri, S. Qadeer, J. Galeotti, J. Voung, and T. Wies, “Intra-module Inference,” presented at the CAV: Computer Aided Verification, 2009, pp. 493–508.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4377
J. Hoenicke, K. R. Leino, A. Podelski, M. Schäf, and T. Wies, “It’s Doomed; We Can Prove It,” presented at the FM: Formal Methods, 2009, pp. 338–353.
View | DOI
 
[5]
2008 | Conference Paper | IST-REx-ID: 4366
A. Podelski, A. Rybalchenko, and T. Wies, “Heap Assumptions on Demand,” presented at the CAV: Computer Aided Verification, 2008, vol. 5123, pp. 314–327.
View | DOI
 
[4]
2007 | Conference Paper | IST-REx-ID: 4394
C. Bouillaguet, V. Kuncak, T. Wies, K. Zee, and M. Rinard, “Using First-Order Theorem Provers in the Jahob Data Structure Verification System,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, pp. 74–88.
View | DOI
 
[3]
2007 | Conference Paper | IST-REx-ID: 4398
J. Berdine et al., “Shape Analysis for Composite Data Structures,” presented at the CAV: Computer Aided Verification, 2007, pp. 178–192.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4359
T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard, “Field Constraint Analysis,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2006, pp. 157–173.
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4367
A. Podelski and T. Wies, “Boolean Heaps,” presented at the SAS: Static Analysis Symposium, 2005, pp. 267–282.
View | DOI
 

Search

Filter Publications