Sebastiaan J. C. Joosten

Orcid: 0000-0002-6590-6220

According to our database1, Sebastiaan J. C. Joosten authored at least 34 papers between 2011 and 2023.

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

2023
Translating First-Order Predicate Logic to Relation Algebra, Implemented using Z3.
CoRR, 2023

2021
Gale-Stewart Games.
Arch. Formal Proofs, 2021

2020
Improving Performance of the VerCors Program Verifier.
Proceedings of the Deductive Software Verification: Future Perspectives, 2020

Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL.
J. Autom. Reason., 2020

A Verified Implementation of Algebraic Numbers in Isabelle/HOL.
J. Autom. Reason., 2020

A Verified Implementation of the Berlekamp-Zassenhaus Factorization Algorithm.
J. Autom. Reason., 2020

Automated Verification of Parallel Nested DFS.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Formal Verification of Parallel Prefix Sum.
Proceedings of the NASA Formal Methods - 12th International Symposium, 2020

2019
Universal Turing Machine.
Arch. Formal Proofs, 2019

2018
Finding models through graph saturation.
J. Log. Algebraic Methods Program., 2018

Graph Saturation.
Arch. Formal Proofs, 2018

A verified factorization algorithm for integer polynomials with polynomial complexity.
Arch. Formal Proofs, 2018

A verified LLL algorithm.
Arch. Formal Proofs, 2018

A Formalization of the LLL Basis Reduction Algorithm.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

An exercise in verifying sequential programs with VerCors.
Proceedings of the Companion Proceedings for the ISSTA/ECOOP 2018 Workshops, 2018

Static Code Verification Through Process Models.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Distributed Systems, 2018

Reasoning About JML: Differences Between KeY and OpenJML.
Proceedings of the Integrated Formal Methods - 14th International Conference, 2018

Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper).
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

Towards Reliable Concurrent Software.
Proceedings of the Principled Software Development, 2018

2017
Subresultants.
Arch. Formal Proofs, 2017

A formalization of the Berlekamp-Zassenhaus factorization algorithm.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

Certifying Safety and Termination Proofs for Integer Transition Systems.
Proceedings of the Automated Deduction - CADE 26, 2017

Parsing and Printing of and with Triples.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2017

2016
The Factorization Algorithm of Berlekamp and Zassenhaus.
Arch. Formal Proofs, 2016

2015
Process algebra semantics & reachability analysis for micro-architectural models of communication fabrics.
Proceedings of the 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2015

Automatic extraction of micro-architectural models of communication fabrics from register transfer level designs.
Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, 2015

Type Checking by Domain Analysis in Ampersand.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2015

2014
Initial Experiments with TPTP-style Automated Theorem Provers on ACL2 Problems.
Proceedings of the Proceedings Twelfth International Workshop on the ACL2 Theorem Prover and its Applications, 2014

Scalable liveness verification for communication fabrics.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2014

2013
A Macro for Reusing Abstract Functions and Theorems
Proceedings of the Proceedings International Workshop on the ACL2 Theorem Prover and its Applications, 2013

Generation of inductive invariants from register transfer level designs of communication fabrics.
Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2013

Relaxation of 3-partition instances.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Formal Deadlock Verification for Click Circuits.
Proceedings of the 19th IEEE International Symposium on Asynchronous Circuits and Systems, 2013

2011
Ampersand - Applying Relation Algebra in Practice.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011


  Loading...