List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Clock bound repair for timed systems Computer Aided Verification | 2024-02-16 | Paper |
| Complete multiparty session type projection with automata | 2024-02-01 | Paper |
| Make flows small again: revisiting the flow framework | 2023-12-13 | Paper |
| Automated repair for timed systems Formal Methods in System Design | 2023-06-29 | Paper |
| Local reasoning for global graph properties Programming Languages and Systems | 2022-10-13 | Paper |
| Automated Verification of Concurrent Search Structures Synthesis Lectures on Computer Science | 2021-07-13 | Paper |
| Error invariants for concurrent traces | 2020-01-03 | Paper |
| Deciding local theory extensions via E-matching | 2018-03-01 | Paper |
| Practical SMT-based type error localization Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
| Complete instantiation-based interpolation Journal of Automated Reasoning | 2016-05-25 | Paper |
| Counterexample-guided focus Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
| Complete instantiation-based interpolation Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
| Structural Counter Abstraction Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
| Error invariants FM 2012: Formal Methods | 2012-11-08 | Paper |
| Ideal abstractions for well-structured transition systems Lecture Notes in Computer Science | 2012-06-15 | Paper |
| An efficient decision procedure for imperative tree data structures Lecture Notes in Computer Science | 2011-07-29 | Paper |
| Doomed program points Formal Methods in System Design | 2011-03-31 | Paper |
| Decision Procedures for Automating Termination Proofs Lecture Notes in Computer Science | 2011-02-15 | Paper |
| Forward analysis of depth-bounded processes Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
| Building a calculus of data structures Lecture Notes in Computer Science | 2010-01-14 | Paper |
| Combining theories with shared set operations Frontiers of Combining Systems | 2010-01-07 | Paper |
| Abstraction Refinement for Quantified Array Assertions Static Analysis | 2009-08-18 | Paper |
| Heap Assumptions on Demand Computer Aided Verification | 2008-07-15 | Paper |
| Using First-Order Theorem Provers in the Jahob Data Structure Verification System Lecture Notes in Computer Science | 2008-04-04 | Paper |
| Shape Analysis for Composite Data Structures Computer Aided Verification | 2007-11-29 | Paper |
| Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science | 2007-02-12 | Paper |
| Static Analysis Lecture Notes in Computer Science | 2006-10-31 | Paper |
Research outcomes over time
This page was built for person: Thomas Wies
