Get started
Author

Tjark Weber

Observed name: Weber, Tjark
Institution: Uppsala University
ORCID: 0000-0001-8967-6987
Observed ORCID: 0000-0001-8967-6987
OpenAlex ID: A5083906333
Mathematizing C++ concurrency
2011 · Mark Batty, Scott Owens, et al. · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 319
Mathematizing C++ concurrency
2011 · Mark Batty, Scott Owens, et al. · ACM SIGPLAN Notices · 261
Fast LCF-Style Proof Reconstruction for Z3
2010 · Sascha Böhme, Tjark Weber · Lecture notes in computer science · 123
Efficiently checking propositional refutations in HOL theorem provers
2007 · Tjark Weber, Hasan Amjad · Journal of Applied Logic · 52
TOOLympics 2019: An Overview of Competitions in Formal Methods
2019 · Ezio Bartocci, Dirk Beyer, et al. · Lecture notes in computer science · 51
The SMT Competition 2015–2018
2019 · Tjark Weber, Sylvain Conchon, et al. · Journal on Satisfiability Boolean Modeling and Computation · 45
PDF
Towards Mechanized Program Verification with Separation Logic
2004 · Tjark Weber · Lecture notes in computer science · 42
Nitpicking c++ concurrency
2011 · Jasmin Christian Blanchette, Tjark Weber, et al. · 41
SAT-based Finite Model Generation for Higher-Order Logic
2008 · Tjark Weber · mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) · 40
PDF
Reconstruction of Z3’s Bit-Vector Proofs in HOL4 and Isabelle/HOL
2011 · Sascha Böhme, Anthony C. J. Fox, et al. · Lecture notes in computer science · 36
SMT solvers: new oracles for the HOL theorem prover
2011 · Tjark Weber · International Journal on Software Tools for Technology Transfer · 33
Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL
2011 · Simon Foster, Georg Struth, et al. · Lecture notes in computer science · 29
The 2014 SMT Competition
2016 · David R. Cok, David Déharbe, et al. · Journal on Satisfiability Boolean Modeling and Computation · 28
PDF
Automating Algebraic Methods in Isabelle
2011 · Walter Guttmann, Georg Struth, et al. · Lecture notes in computer science · 27
Towards Automated Proof Support for Probabilistic Distributed Systems
2005 · Annabelle K. McIver, Tjark Weber · Lecture notes in computer science · 27
Formal Memory Models for the Verification of Low-Level Operating-System Code
2009 · Hendrik Tews, Marcus Völp, et al. · Journal of Automated Reasoning · 25
Integrating a SAT Solver with an LCF-style Theorem Prover
2006 · Tjark Weber · Electronic Notes in Theoretical Computer Science · 24
PDF
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
2008 · Hendrik Tews, Tjark Weber, et al. · Electronic Notes in Theoretical Computer Science · 23
PDF
Bounded Model Generation for Isabelle/HOL
2005 · Tjark Weber · Electronic Notes in Theoretical Computer Science · 22
PDF
The 2013 Evaluation of SMT-COMP and SMT-LIB
2015 · David R. Cok, Aaron Stump, et al. · Journal of Automated Reasoning · 21
Modal Logics for Nominal Transition Systems
2015 · Parrow, Joachim, Borgström, Johannes, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 18
PDF
Psi-Calculi in Isabelle
2015 · Jesper Bengtson, Joachim Parrow, et al. · Journal of Automated Reasoning · 16
Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
2013 · Alasdair Armstrong, Georg Struth, et al. · Lecture notes in computer science · 12
Programming and automating mathematics in the Tarski–Kleene hierarchy
2014 · Alasdair Armstrong, Georg Struth, et al. · Journal of Logical and Algebraic Methods in Programming · 10
PDF
Finite Models in FOL-Based Crypto-Protocol Verification
2009 · Jan Jürjens, Tjark Weber · Lecture notes in computer science · 10
Works count: 70
Citation count: 1,422
H-index: 20
I10-index: 25
Year
Topic
Type