Thomas Haas

Orcid: 0000-0002-3176-8552

Affiliations:
  • TU Braunschweig, Braunschweig, Germany


According to our database1, Thomas Haas authored at least 7 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Recurrence Sets for Proving Fair Non-termination under Axiomatic Memory Consistency Models.
Proc. ACM Program. Lang., 2026

2023
Static Analysis of Memory Models for SMT Encodings.
Proc. ACM Program. Lang., October, 2023

2022
CAAT: consistency as a theory.
Proc. ACM Program. Lang., 2022

Dartagnan: SMT-based Violation Witness Validation (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

2021
Verifying and Optimizing Compact NUMA-Aware Locks on Weak Memory Models.
CoRR, 2021

Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

2020
Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020


  Loading...