default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Wies
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j10]Nisarg Patel, Dennis Shasha, Thomas Wies:
Verifying Lock-Free Search Structure Templates (Artifact). Dagstuhl Artifacts Ser. 10(2): 15:1-15:2 (2024)- [c58]Thomas Wies:
Verifying Concurrent Search Structures (Invited Talk). CONCUR 2024: 3:1-3:1 - [c57]Nisarg Patel, Dennis Shasha, Thomas Wies:
Verifying Lock-Free Search Structure Templates. ECOOP 2024: 30:1-30:28 - [c56]Elaine Li
, Felix Stutz, Thomas Wies:
Deciding Subtyping for Asynchronous Multiparty Sessions. ESOP (1) 2024: 176-205 - [i27]Elaine Li, Felix Stutz, Thomas Wies:
Deciding Subtyping for Asynchronous Multiparty Sessions. CoRR abs/2401.16395 (2024) - [i26]Nisarg Patel, Dennis Shasha, Thomas Wies:
Verifying Lock-free Search Structure Templates. CoRR abs/2405.13271 (2024) - [i25]Mihai Nicola, Chaitanya Agarwal, Eric Koskinen, Thomas Wies:
Inferring Accumulative Effects of Higher Order Programs. CoRR abs/2408.02791 (2024) - [i24]Sebastian Wolff, Ekanshdeep Gupta, Zafer Esen, Hossein Hojjat, Philipp Rümmer, Thomas Wies:
Arithmetizing Shape Analysis. CoRR abs/2408.09037 (2024) - 2023
- [j9]Roland Meyer, Thomas Wies, Sebastian Wolff:
Embedding Hindsight Reasoning in Separation Logic. Proc. ACM Program. Lang. 7(PLDI): 1848-1871 (2023) - [c55]Roland Meyer, Anton Opaterny, Thomas Wies, Sebastian Wolff:
nekton: A Linearizability Proof Checker. CAV (1) 2023: 170-183 - [c54]Elaine Li, Felix Stutz, Thomas Wies, Damien Zufferey:
Complete Multiparty Session Type Projection with Automata. CAV (3) 2023: 350-373 - [c53]Kunming Jiang, Devora Chait-Roth, Zachary DeStefano, Michael Walfish, Thomas Wies:
Less is more: refinement proofs for probabilistic proofs. SP 2023: 1112-1129 - [c52]Roland Meyer, Thomas Wies, Sebastian Wolff:
Make Flows Small Again: Revisiting the Flow Framework. TACAS (1) 2023: 628-646 - [e4]Thomas Wies:
Programming Languages and Systems - 32nd European Symposium on Programming, ESOP 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings. Lecture Notes in Computer Science 13990, Springer 2023, ISBN 978-3-031-30043-1 [contents] - [e3]David Mohaisen, Thomas Wies:
Networked Systems - 11th International Conference, NETYS 2023, Benguerir, Morocco, May 22-24, 2023, Proceedings. Lecture Notes in Computer Science 14067, Springer 2023, ISBN 978-3-031-37764-8 [contents] - [i23]Roland Meyer, Thomas Wies, Sebastian Wolff:
Make flows small again: revisiting the flow framework. CoRR abs/2304.04886 (2023) - [i22]Elaine Li, Felix Stutz, Thomas Wies, Damien Zufferey:
Complete Multiparty Session Type Projection with Automata. CoRR abs/2305.17079 (2023) - [i21]Roland Meyer, Thomas Wies, Sebastian Wolff:
Context-Aware Separation Logic. CoRR abs/2307.15549 (2023) - 2022
- [j8]Roland Meyer, Thomas Wies, Sebastian Wolff:
A concurrent program logic with a future and history. Proc. ACM Program. Lang. 6(OOPSLA2): 1378-1407 (2022) - [c51]Preston Moore, Thomas Wies, Marc Waldman, Phyllis G. Frankl, Justin Cappos:
Needles in a Haystack: Using PORT to Catch Bad Behaviors within Application Recordings. ICSOFT 2022: 137-145 - [e2]Bernd Finkbeiner, Thomas Wies:
Verification, Model Checking, and Abstract Interpretation - 23rd International Conference, VMCAI 2022, Philadelphia, PA, USA, January 16-18, 2022, Proceedings. Lecture Notes in Computer Science 13182, Springer 2022, ISBN 978-3-030-94582-4 [contents] - [i20]Roland Meyer, Thomas Wies, Sebastian Wolff:
A Concurrent Program Logic with a Future and History. CoRR abs/2207.02355 (2022) - [i19]Roland Meyer, Thomas Wies, Sebastian Wolff:
Embedding Hindsight Reasoning in Separation Logic. CoRR abs/2209.13692 (2022) - [i18]Kunming Jiang, Devora Chait-Roth, Zachary DeStefano, Michael Walfish, Thomas Wies:
Less is more: refinement proofs for probabilistic proofs. IACR Cryptol. ePrint Arch. 2022: 1557 (2022) - 2021
- [b2]Siddharth Krishna, Nisarg Patel, Dennis E. Shasha, Thomas Wies:
Automated Verification of Concurrent Search Structures. Synthesis Lectures on Computer Science, Morgan & Claypool Publishers 2021, ISBN 978-3-031-00678-4, pp. 1-188 - [j7]Martin Kölbl, Stefan Leue, Thomas Wies:
Automated repair for timed systems. Formal Methods Syst. Des. 59(1): 136-169 (2021) - [j6]Nisarg Patel, Siddharth Krishna, Dennis E. Shasha, Thomas Wies:
Verifying concurrent multicopy search structures. Proc. ACM Program. Lang. 5(OOPSLA): 1-32 (2021) - [j5]Zvonimir Pavlinovic, Yusen Su, Thomas Wies:
Data flow refinement type inference. Proc. ACM Program. Lang. 5(POPL): 1-31 (2021) - [c50]Xintian Han, Mark Goldstein, Aahlad Manas Puli, Thomas Wies, Adler J. Perotte, Rajesh Ranganath:
Inverse-Weighted Survival Games. NeurIPS 2021: 2160-2172 - [i17]Nisarg Patel, Siddharth Krishna, Dennis E. Shasha, Thomas Wies:
Verifying Concurrent Multicopy Search Structures. CoRR abs/2109.05631 (2021) - [i16]Xintian Han, Mark Goldstein, Aahlad Manas Puli, Thomas Wies, Adler J. Perotte, Rajesh Ranganath:
Inverse-Weighted Survival Games. CoRR abs/2111.08175 (2021) - 2020
- [c49]Martin Kölbl, Stefan Leue, Thomas Wies:
TarTar: A Timed Automata Repair Tool. CAV (1) 2020: 529-540 - [c48]Siddharth Krishna, Alexander J. Summers, Thomas Wies:
Local Reasoning for Global Graph Properties. ESOP 2020: 308-335 - [c47]Siddharth Krishna, Nisarg Patel, Dennis E. Shasha, Thomas Wies:
Verifying concurrent search structure templates. PLDI 2020: 181-196 - [i15]Martin Kölbl, Stefan Leue, Thomas Wies:
TarTar: A Timed Automata Repair Tool. CoRR abs/2002.02760 (2020) - [i14]Yan Shvartzshnaider, Ananth Balashankar, Vikas Patidar, Thomas Wies, Lakshminarayanan Subramanian:
Beyond The Text: Analysis of Privacy Statements through Syntactic and Semantic Role Labeling. CoRR abs/2010.00678 (2020) - [i13]Zvonimir Pavlinovic, Yusen Su, Thomas Wies:
Data Flow Refinement Type Inference. CoRR abs/2011.04876 (2020)
2010 – 2019
- 2019
- [c46]Martin Kölbl, Stefan Leue, Thomas Wies:
Clock Bound Repair for Timed Systems. CAV (1) 2019: 79-96 - [c45]Preston Moore, Justin Cappos, Phyllis G. Frankl, Thomas Wies:
Charting a Course Through Uncertain Environments: SEA Uses Past Problems to Avoid Future Failures. ISSRE 2019: 1-12 - [c44]Yan Shvartzshnaider, Zvonimir Pavlinovic, Ananth Balashankar, Thomas Wies, Lakshminarayanan Subramanian, Helen Nissenbaum, Prateek Mittal:
VACCINE: Using Contextual Integrity For Data Leakage Detection. WWW 2019: 1702-1712 - [i12]Siddharth Krishna, Alexander J. Summers, Thomas Wies:
Local Reasoning for Global Graph Properties. CoRR abs/1911.08632 (2019) - 2018
- [j4]Siddharth Krishna, Dennis E. Shasha, Thomas Wies:
Go with the flow: compositional abstractions for concurrent data structures. Proc. ACM Program. Lang. 2(POPL): 37:1-37:31 (2018) - [c43]Yan Shvartzshanider, Ananth Balashankar, Thomas Wies, Lakshminarayanan Subramanian:
RECIPE: Applying Open Domain Question Answering to Privacy Policies. QA@ACL 2018: 71-77 - 2017
- [c42]Riad S. Wahby, Ye Ji, Andrew J. Blumberg, Abhi Shelat, Justin Thaler, Michael Walfish, Thomas Wies:
Full Accounting for Verifiable Outsourcing. CCS 2017: 2071-2086 - [c41]Wei Wang, Clark W. Barrett, Thomas Wies:
Partitioned Memory Models for Program Analysis. VMCAI 2017: 539-558 - [e1]Andrei Paskevich, Thomas Wies:
Verified Software. Theories, Tools, and Experiments - 9th International Conference, VSTTE 2017, Heidelberg, Germany, July 22-23, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10712, Springer 2017, ISBN 978-3-319-72307-5 [contents] - [i11]Yan Shvartzshnaider, Zvonimir Pavlinovic, Thomas Wies, Lakshminarayanan Subramanian, Prateek Mittal, Helen Nissenbaum:
The VACCINE Framework for Building DLP Systems. CoRR abs/1711.02742 (2017) - [i10]Siddharth Krishna, Dennis E. Shasha, Thomas Wies:
Go with the Flow: Compositional Abstractions for Concurrent Data Structures (Extended Version). CoRR abs/1711.03272 (2017) - [i9]Riad S. Wahby, Ye Ji, Andrew J. Blumberg, Abhi Shelat, Justin Thaler, Michael Walfish, Thomas Wies:
Full accounting for verifiable outsourcing. IACR Cryptol. ePrint Arch. 2017: 242 (2017) - 2016
- [j3]Nishant Totla, Thomas Wies:
Complete Instantiation-Based Interpolation. J. Autom. Reason. 57(1): 37-65 (2016) - [c40]Andreas Holzer, Daniel Schwartz-Narbonne, Mitra Tabaei Befrouei, Georg Weissenbacher, Thomas Wies:
Error Invariants for Concurrent Traces. FM 2016: 370-387 - [c39]Yan Shvartzshnaider, Schrasing Tong, Thomas Wies, Paula Kift, Helen Nissenbaum, Lakshminarayanan Subramanian, Prateek Mittal:
Learning Privacy Expectations by Crowdsourcing Contextual Informational Norms. HCOMP 2016: 209-218 - [c38]Andreas Podelski, Martin Schäf, Thomas Wies:
Classifying Bugs with Interpolants. TAP@STAF 2016: 151-168 - [i8]Yan Shvartzshnaider, Schrasing Tong, Thomas Wies, Paula Kift, Helen Nissenbaum, Lakshminarayanan Subramanian, Prateek Mittal:
Crowdsourcing Verifiable Contextual Integrity Norms. CoRR abs/1601.04740 (2016) - [i7]Andreas Holzer, Daniel Schwartz-Narbonne, Mitra Tabaei Befrouei, Georg Weissenbacher, Thomas Wies:
Error Invariants for Concurrent Traces. CoRR abs/1608.08584 (2016) - 2015
- [c37]Kshitij Bansal, Andrew Reynolds, Tim King, Clark W. Barrett, Thomas Wies:
Deciding Local Theory Extensions via E-matching. CAV (2) 2015: 87-105 - [c36]Zvonimir Pavlinovic, Tim King, Thomas Wies:
Practical SMT-based type error localization. ICFP 2015: 412-423 - [c35]Daniel Schwartz-Narbonne, Chanseok Oh, Martin Schäf, Thomas Wies:
VERMEER: A Tool for Tracing and Explaining Faulty C Programs. ICSE (2) 2015: 737-740 - [c34]Daniel Schwartz-Narbonne, Martin Schäf, Dejan Jovanovic, Philipp Rümmer, Thomas Wies:
Conflict-Directed Graph Coverage. NFM 2015: 327-342 - [c33]Zvonimir Pavlinovic, Tim King, Thomas Wies:
Finding Minimum Type Error Sources. Software Engineering & Management 2015: 43-44 - [i6]Siddharth Krishna, Christian Puhrsch, Thomas Wies:
Learning Invariants using Decision Trees. CoRR abs/1501.04725 (2015) - [i5]Kshitij Bansal, Andrew Reynolds, Tim King, Clark W. Barrett, Thomas Wies:
On Deciding Local Theory Extensions via E-matching. CoRR abs/1508.06827 (2015) - [i4]Zvonimir Pavlinovic, Tim King, Thomas Wies:
On Practical SMT-Based Type Error Localization. CoRR abs/1508.06836 (2015) - 2014
- [j2]Gudmund Grov, Thomas Wies:
Preface - Invariant Generation. Sci. Comput. Program. 93: 87-88 (2014) - [c32]Ruzica Piskac, Thomas Wies, Damien Zufferey:
Automating Separation Logic with Trees and Data. CAV 2014: 711-728 - [c31]Shahram Esmaeilsabzali, Rupak Majumdar, Thomas Wies, Damien Zufferey:
Dynamic Package Interfaces. FASE 2014: 261-275 - [c30]Zvonimir Pavlinovic, Tim King, Thomas Wies:
Finding minimum type error sources. OOPSLA 2014: 525-542 - [c29]Chanseok Oh, Martin Schäf, Daniel Schwartz-Narbonne, Thomas Wies:
Concolic Fault Localization. SCAM 2014: 135-144 - [c28]Ruzica Piskac, Thomas Wies, Damien Zufferey:
GRASShopper - Complete Heap Verification with Mixed Specifications. TACAS 2014: 124-139 - [c27]Wei Wang, Clark W. Barrett, Thomas Wies:
Cascade 2.0. VMCAI 2014: 142-160 - 2013
- [c26]Ruzica Piskac, Thomas Wies, Damien Zufferey:
Automating Separation Logic Using SMT. CAV 2013: 773-789 - [c25]Nishant Totla, Thomas Wies:
Complete instantiation-based interpolation. POPL 2013: 537-548 - [c24]Martin Schäf, Daniel Schwartz-Narbonne, Thomas Wies:
Explaining inconsistent code. ESEC/SIGSOFT FSE 2013: 521-531 - [c23]Kshitij Bansal, Eric Koskinen, Thomas Wies, Damien Zufferey:
Structural Counter Abstraction. TACAS 2013: 62-77 - [c22]Jürgen Christ, Evren Ermis, Martin Schäf, Thomas Wies:
Flow-Sensitive Fault Localization. VMCAI 2013: 189-208 - [i3]Shahram Esmaeilsabzali, Rupak Majumdar, Thomas Wies, Damien Zufferey:
A Notion of Dynamic Interface for Depth-Bounded Object-Oriented Packages. CoRR abs/1311.4615 (2013) - [i2]Shahram Esmaeilsabzali, Rupak Majumdar, Thomas Wies, Damien Zufferey:
Dynamic Package Interfaces - Extended Version. CoRR abs/1311.4934 (2013) - 2012
- [c21]Evren Ermis, Martin Schäf, Thomas Wies:
Error Invariants. FM 2012: 187-201 - [c20]Damien Zufferey, Thomas Wies, Thomas A. Henzinger:
Ideal Abstractions for Well-Structured Transition Systems. VMCAI 2012: 445-460 - [c19]Thomas Wies, Marco Muñiz, Viktor Kuncak:
Deciding Functional Lists with Sublist Sets. VSTTE 2012: 66-81 - 2011
- [c18]Thomas Wies, Marco Muñiz, Viktor Kuncak:
An Efficient Decision Procedure for Imperative Tree Data Structures. CADE 2011: 476-491 - [c17]Thomas A. Henzinger, Vasu Singh, Thomas Wies, Damien Zufferey:
Scheduling large jobs by abstraction refinement. EuroSys 2011: 329-342 - [c16]Thomas A. Henzinger, Anmol V. Singh, Vasu Singh, Thomas Wies, Damien Zufferey:
Static Scheduling in Clouds. HotCloud 2011 - [c15]Ruzica Piskac, Thomas Wies:
Decision Procedures for Automating Termination Proofs. VMCAI 2011: 371-386 - 2010
- [j1]Jochen Hoenicke, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies:
Doomed program points. Formal Methods Syst. Des. 37(2-3): 171-199 (2010) - [c14]Thomas A. Henzinger, Anmol V. Singh, Vasu Singh, Thomas Wies, Damien Zufferey:
FlexPRICE: Flexible Provisioning of Resources in a Cloud Environment. IEEE CLOUD 2010: 83-90 - [c13]Thomas A. Henzinger, Anmol V. Singh, Vasu Singh, Thomas Wies, Damien Zufferey:
A marketplace for cloud resources. EMSOFT 2010: 1-8 - [c12]Thomas Wies, Damien Zufferey, Thomas A. Henzinger:
Forward Analysis of Depth-Bounded Processes. FoSSaCS 2010: 94-108 - [c11]Andreas Podelski, Thomas Wies:
Counterexample-guided focus. POPL 2010: 249-260 - [c10]Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thomas Wies:
Building a Calculus of Data Structures. VMCAI 2010: 26-44
2000 – 2009
- 2009
- [b1]Thomas Wies:
Symbolic shape analysis. University of Freiburg, 2009 - [c9]Shuvendu K. Lahiri, Shaz Qadeer, Juan P. Galeotti, Jan W. Voung, Thomas Wies:
Intra-module Inference. CAV 2009: 493-508 - [c8]Jochen Hoenicke, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies:
It's Doomed; We Can Prove It. FM 2009: 338-353 - [c7]Thomas Wies, Ruzica Piskac, Viktor Kuncak:
Combining Theories with Shared Set Operations. FroCoS 2009: 366-382 - [c6]Mohamed Nassim Seghir, Andreas Podelski, Thomas Wies:
Abstraction Refinement for Quantified Array Assertions. SAS 2009: 3-18 - 2008
- [c5]Andreas Podelski, Andrey Rybalchenko, Thomas Wies:
Heap Assumptions on Demand. CAV 2008: 314-327 - 2007
- [c4]Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter W. O'Hearn, Thomas Wies, Hongseok Yang:
Shape Analysis for Composite Data Structures. CAV 2007: 178-192 - [c3]Charles Bouillaguet, Viktor Kuncak, Thomas Wies, Karen Zee, Martin C. Rinard:
Using First-Order Theorem Provers in the Jahob Data Structure Verification System. VMCAI 2007: 74-88 - 2006
- [c2]Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin C. Rinard:
Field Constraint Analysis. VMCAI 2006: 157-173 - [i1]Thomas Wies, Viktor Kuncak, Karen Zee, Andreas Podelski, Martin C. Rinard:
On Verifying Complex Properties using Symbolic Shape Analysis. CoRR abs/cs/0609104 (2006) - 2005
- [c1]Andreas Podelski, Thomas Wies:
Boolean Heaps. SAS 2005: 268-283
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
