Simon Wimmer

Orcid: 0000-0001-5998-4655

Affiliations:
  • University of Pennsylvania, Philadelphia, PA, USA
  • Technische Universität München, Germany (former)


According to our database1, Simon Wimmer authored at least 24 papers between 2013 and 2024.

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

2024
Difference Bound Matrices.
Arch. Formal Proofs, 2024

Worklist Algorithms.
Arch. Formal Proofs, 2024

LL(1) Parser Generator.
Arch. Formal Proofs, 2024

AutoCorres2.
Arch. Formal Proofs, 2024

2022
Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Practice, 2022

2020
Trustworthy Verification of Realtime Systems.
PhD thesis, 2020

Verified Certification of Reachability Checking for Timed Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Certifying Emptiness of Timed Büchi Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2020

2019
VerifyThis 2019 - Polished Isabelle Solutions.
Arch. Formal Proofs, 2019

IMP2 - Simple Program Verification in Isabelle/HOL.
Arch. Formal Proofs, 2019

Munta: A Verified Model Checker for Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2019

2018
Monadification, Memoization and Dynamic Programming.
Arch. Formal Proofs, 2018

Probabilistic Timed Automata.
Arch. Formal Proofs, 2018

Hidden Markov Models.
Arch. Formal Proofs, 2018

VerifyThis 2018 - Polished Isabelle Solutions.
Arch. Formal Proofs, 2018

Verified Model Checking of Timed Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Competitive Proving for Fun.
Proceedings of the Selected Student Contributions and Workshop Papers of LuxLogAI 2018, 2018

Verified Memoization and Dynamic Programming.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

MDP + TA = PTA: Probabilistic Timed Automata, Formalized (Short Paper).
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

2017
The Floyd-Warshall Algorithm for Shortest Paths.
Arch. Formal Proofs, 2017

2016
Timed Automata.
Arch. Formal Proofs, 2016

Formalized Timed Automata.
Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

2013
Lehmer's Theorem.
Arch. Formal Proofs, 2013

Pratt's Primality Certificates.
Arch. Formal Proofs, 2013


  Loading...