Photo of Sebastiaan Jozef Christiaan Joosten

Sebastiaan Jozef Christiaan Joosten

dr.ir.

20172019
If you made any changes in Pure these will be visible here soon.

Personal profile

Education/Academic qualification

PhD, Eindhoven University of Technology

Keywords

  • QA75 Electronic computers. Computer science
  • Formal methods
  • Logic
  • Verification

Fingerprint Dive into the research topics where Sebastiaan Jozef Christiaan Joosten is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 4 Similar Profiles
Formalization Mathematics
Factorization Engineering & Materials Science
Subresultants Mathematics
Polynomials Engineering & Materials Science
Computability Theory Mathematics
Context free grammars Engineering & Materials Science
Polynomial Complexity Mathematics
Turing Machine Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2017 2019

Universal Turing Machine and Computability Theory in Isabelle/HOL

Xu, J., Zhang, X., Urban, C. & Joosten, S. J. C., 1 Feb 2019, In : Archive of Formal Proofs.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Computability Theory
Turing Machine
Halting Problem
Recursive Functions
Undecidability
1 Citation (Scopus)
34 Downloads (Pure)

A Formalization of the LLL Basis Reduction Algorithm

Divasón, J., Joosten, S., Thiemann, R. & Yamada, A., 4 Jul 2018, Interactive Theorem Proving: 9th International Conference, ITP 2018. Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018. Proceedings. Avigad, J. & Mahboubi, A. (eds.). Springer, p. 160-177 18 p. (Lecture Notes in Computer Science; vol. 10895).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Open Access
File
Formalization
LLL Algorithm
Computer Algebra
Number theory
Soundness

An Exercise in Verifying Sequential Programs with VerCors

Joosten, S. J. C., Oortwijn, W., Safari, M. & Huisman, M., 16 Jul 2018. 6 p.

Research output: Contribution to conferencePaperAcademicpeer-review

Open Access
File
File editors
Data structures

A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving

Divasón, J., Joosten, S. J. C., Thiemann, R. & Yamada, A., Jul 2018, 16th International Workshop on Termination: WST 2018, July 18-19. 2018, Oxford, UK. Lucas, S. (ed.). p. 30-34 5 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File

A verified factorization algorithm for integer polynomials with polynomial complexity

Divasón, J., Joosten, S., Thiemann, R. & Yamada, A., 6 Feb 2018, In : Archive of Formal Proofs. 79 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Polynomial Complexity
Factorization
Polynomial
Integer
Polynomial time