Welkom...

dr.ir. S.J.C. Joosten (Sebastiaan)

Universitair docent

Expertises

Polynomial
Polynomials
Saturation
Graph In Graph Theory
Invariant
Chemical Analysis
Model
Factorization
Integer
Subresultants
Polynomial Complexity
Computer Systems
Xml
Printing
Context Free Grammars
Formalization
Factorization

Publicaties

Recent
Joosten, S. J. C., Oortwijn, W., Safari, M., & Huisman, M. (2018). An Exercise in Verifying Sequential Programs with VerCors. Paper presented at 20th Workshop on Formal Techniques for Java-like Programs Formal techniques, Amsterdam, Netherlands.
Divasón, J., Joosten, S., Thiemann, R., & Yamada, A. (2018). A Formalization of the LLL Basis Reduction Algorithm. In J. Avigad, & A. Mahboubi (Eds.), 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 (pp. 160-177). (Lecture Notes in Computer Science; Vol. 10895). Springer. DOI: 10.1007/978-3-319-94821-8_10
Divasón, J., Joosten, S. J. C., Thiemann, R., & Yamada, A. (2018). A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving. In S. Lucas (Ed.), 16th International Workshop on Termination: WST 2018, July 18-19. 2018, Oxford, UK (pp. 30-34)
Divasón, J., Joosten, S., Thiemann, R., & Yamada, A. (2018). A verified factorization algorithm for integer polynomials with polynomial complexity. Archive of Formal Proofs.
Joosten, S. J. C. (2018). Finding models through graph saturation. Journal of Logical and Algebraic Methods in Programming, 100, 98-112.
Divasón, J., Joosten, S., Thiemann, R., & Yamada, A. (2018). A verified LLL algorithm. Archive of Formal Proofs, 2018.
Divasón, J., Joosten, S., Kuncar, O., Thiemann, R., & Yamada, A. (2018). Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper). In Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 2-13). DOI: 10.1145/3167103
Divasón, J., Joosten, S., Thiemann, R., & Yamada, A. (2017). A formalization of the Berlekamp-Zassenhaus factorization algorithm. In CPP 2017: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs (pp. 17-29). Association for Computing Machinery. DOI: 10.1145/3018610.3018617
Brockschmidt, M., Joosten, S. J. C., Thiemann, R., & Yamada, A. (2017). Certifying safety and termination proofs for integer transition systems. In L. de Moura (Ed.), Automated Deduction - CADE 26 International Conference on Automated Deduction: 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017. Proceedings (pp. 454-471). (Lecture Notes in Artificial Intelligence; Vol. 10395). Cham: Springer. DOI: 10.1007/978-3-319-63046-5_28
Joosten, S. J. C. (2017). Parsing and Printing of and with Triples. In P. Höfner, D. Pous, & G. Struth (Eds.), Relational and algebraic methods in computer science: 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017. Proceedings (pp. 159-176). (Lecture Notes in Computer Science; Vol. 10226). Cham: Springer.

Pure Link

Contactgegevens

Bezoekadres

Universiteit Twente
Faculteit Elektrotechniek, Wiskunde en Informatica
Zilverling (gebouwnr. 11), kamer 3078
Hallenweg 19
7522NH  Enschede

Navigeer naar locatie

Postadres

Universiteit Twente
Faculteit Elektrotechniek, Wiskunde en Informatica
Zilverling  3078
Postbus 217
7500 AE Enschede