Tjark Weber
Senior Lecturer/Associate Professor at Department of Information Technology; Division of Computing Science
- Telephone:
- +46 18 471 10 99
- E-mail:
- tjark.weber@it.uu.se
- Visiting address:
- Hus 10, Regementsvägen 10
- Postal address:
- Box 337
751 05 UPPSALA
- Academic merits:
- Docent
Short presentation
I am a member of the Concurrency research group at the Department of Information Technology, Uppsala University. My research interests include automated and interactive theorem proving, formal verification, programming languages, digital security and computational logic.
Please see http://user.it.uu.se/~tjawe125/ for further details.
Keywords
- programming languages
- theorem proving
- formal verification
- digital security
- computational logic

Publications
Recent publications
-
Finding Universally Quantified Heap Invariants by Horn Clause Transformations
Part of Fundamentals of Software Engineering - 11th IFIP WG 2.2 International Conference, FSEN 2025, Västerås, Sweden, April 7-8, 2025, Proceedings, p. 42-60, 2025
-
Hammering Floating-Point Arithmetic
Part of FRONTIERS OF COMBINING SYSTEMS, FROCOS 2023, p. 217-235, 2023
- DOI for Hammering Floating-Point Arithmetic
- Download full text (pdf) of Hammering Floating-Point Arithmetic
-
Modal Logics for Nominal Transition Systems
Part of Logical Methods in Computer Science, 2021
- DOI for Modal Logics for Nominal Transition Systems
- Download full text 1 (pdf) of Modal Logics for Nominal Transition Systems
- Download full text 2 (pdf) of Modal Logics for Nominal Transition Systems
-
Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading
Part of Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages, p. 1-17, 2021
- DOI for Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading
- Download full text (pdf) of Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading
-
Proof-theoretic Conservativity for HOL with Ad-hoc Overloading
Part of Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30 - December 4, 2020, p. 23-42, 2020
All publications
Articles in journal
-
Modal Logics for Nominal Transition Systems
Part of Logical Methods in Computer Science, 2021
- DOI for Modal Logics for Nominal Transition Systems
- Download full text 1 (pdf) of Modal Logics for Nominal Transition Systems
- Download full text 2 (pdf) of Modal Logics for Nominal Transition Systems
-
Model-theoretic Conservative Extension of Definitional Theories
Part of Electronic Notes in Theoretical Computer Science, p. 133-145, 2018
- DOI for Model-theoretic Conservative Extension of Definitional Theories
- Download full text (pdf) of Model-theoretic Conservative Extension of Definitional Theories
-
The largest respectful function
Part of Logical Methods in Computer Science, 2016
-
Modal Logics for Nominal Transition Systems
Part of Archive of Formal Proofs, 2016
-
Part of Archive of Formal Proofs, 2016
-
Part of Journal on Satisfiability, Boolean Modeling and Computation, 2016
-
Part of Journal of automated reasoning, p. 1-47, 2016
-
The 2013 Evaluation of SMT-COMP and SMT-LIB
Part of Journal of automated reasoning, p. 61-90, 2015
-
Programming and automating mathematics in the Tarski-Kleene hierarchy
Part of Journal of Logical and Algebraic Methods in Programming, p. 87-102, 2014
-
Part of Archive of Formal Proofs, 2013
Conference papers
-
Finding Universally Quantified Heap Invariants by Horn Clause Transformations
Part of Fundamentals of Software Engineering - 11th IFIP WG 2.2 International Conference, FSEN 2025, Västerås, Sweden, April 7-8, 2025, Proceedings, p. 42-60, 2025
-
Hammering Floating-Point Arithmetic
Part of FRONTIERS OF COMBINING SYSTEMS, FROCOS 2023, p. 217-235, 2023
- DOI for Hammering Floating-Point Arithmetic
- Download full text (pdf) of Hammering Floating-Point Arithmetic
-
Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading
Part of Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages, p. 1-17, 2021
- DOI for Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading
- Download full text (pdf) of Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading
-
Proof-theoretic Conservativity for HOL with Ad-hoc Overloading
Part of Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30 - December 4, 2020, p. 23-42, 2020
-
TOOLympics 2019: An overview of competitions in formal methods
Part of Tools and Algorithms for the Construction and Analysis of Systems, p. 3-24, 2019
- DOI for TOOLympics 2019: An overview of competitions in formal methods
- Download full text (pdf) of TOOLympics 2019: An overview of competitions in formal methods
-
Part of Formal Techniques for Distributed Objects, Components, and Systems, p. 179-193, 2017
-
Scrambling and descrambling SMT-LIB benchmarks
Part of Satisfiability Modulo Theories, p. 31-40, 2016
-
Modal Logics for Nominal Transition Systems
Part of 26th International Conference on Concurrency Theory, p. 198-211, 2015
-
Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
Part of Interactive Theorem Proving, p. 197-212, 2013
- DOI for Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
- Download full text (pdf) of Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
-
On the use of underspecified data-type semantics for type safety in low-level code
Part of Proc. 7th Conference on Systems Software Verification, p. 73-87, 2012