![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Sebastiaan J. C. Joosten
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c21]Sebastiaan J. C. Joosten
, Stef Joosten
:
Data Migration Under a Changing Schema in Ampersand. RAMiCS 2024: 175-192 - 2023
- [i3]Anthony Brogni
, Sebastiaan J. C. Joosten:
Translating First-Order Predicate Logic to Relation Algebra, Implemented using Z3. CoRR abs/2308.02513 (2023) - 2021
- [j11]Sebastiaan J. C. Joosten:
Gale-Stewart Games. Arch. Formal Proofs 2021 (2021) - 2020
- [j10]Sebastiaan J. C. Joosten
, René Thiemann
, Akihisa Yamada
:
A Verified Implementation of Algebraic Numbers in Isabelle/HOL. J. Autom. Reason. 64(3): 363-389 (2020) - [j9]Jose Divasón
, Sebastiaan J. C. Joosten
, René Thiemann
, Akihisa Yamada
:
A Verified Implementation of the Berlekamp-Zassenhaus Factorization Algorithm. J. Autom. Reason. 64(4): 699-735 (2020) - [j8]René Thiemann
, Ralph Bottesch, Jose Divasón
, Max W. Haslbeck
, Sebastiaan J. C. Joosten
, Akihisa Yamada
:
Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL. J. Autom. Reason. 64(5): 827-856 (2020) - [c20]Mohsen Safari, Wytse Oortwijn, Sebastiaan J. C. Joosten, Marieke Huisman
:
Formal Verification of Parallel Prefix Sum. NFM 2020: 170-186 - [c19]Wytse Oortwijn
, Marieke Huisman
, Sebastiaan J. C. Joosten
, Jaco van de Pol
:
Automated Verification of Parallel Nested DFS. TACAS (1) 2020: 247-265 - [p1]Henk Mulder, Marieke Huisman
, Sebastiaan J. C. Joosten
:
Improving Performance of the VerCors Program Verifier. 20 Years of KeY 2020: 65-82
2010 – 2019
- 2019
- [j7]Jian Xu, Xingyuan Zhang, Christian Urban, Sebastiaan J. C. Joosten:
Universal Turing Machine. Arch. Formal Proofs 2019 (2019) - 2018
- [j6]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A verified LLL algorithm. Arch. Formal Proofs 2018 (2018) - [j5]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A verified factorization algorithm for integer polynomials with polynomial complexity. Arch. Formal Proofs 2018 (2018) - [j4]Sebastiaan J. C. Joosten:
Graph Saturation. Arch. Formal Proofs 2018 (2018) - [j3]Sebastiaan J. C. Joosten:
Finding models through graph saturation. J. Log. Algebraic Methods Program. 100: 98-112 (2018) - [c18]Marieke Huisman
, Sebastiaan J. C. Joosten:
Towards Reliable Concurrent Software. Principled Software Development 2018: 129-146 - [c17]Jose Divasón
, Sebastiaan J. C. Joosten, Ondrej Kuncar, René Thiemann
, Akihisa Yamada
:
Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper). CPP 2018: 2-13 - [c16]Jan Boerman, Marieke Huisman
, Sebastiaan J. C. Joosten:
Reasoning About JML: Differences Between KeY and OpenJML. IFM 2018: 30-46 - [c15]Sebastiaan J. C. Joosten, Marieke Huisman
:
Static Code Verification Through Process Models. ISoLA (3) 2018: 343-354 - [c14]Sebastiaan J. C. Joosten, Wytse Oortwijn, Mohsen Safari, Marieke Huisman
:
An exercise in verifying sequential programs with VerCors. ISSTA/ECOOP Workshops 2018: 40-45 - [c13]Jose Divasón
, Sebastiaan J. C. Joosten, René Thiemann
, Akihisa Yamada
:
A Formalization of the LLL Basis Reduction Algorithm. ITP 2018: 160-177 - [i2]Sebastiaan J. C. Joosten:
Finding models through graph saturation. CoRR abs/1806.09392 (2018) - 2017
- [j2]Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
Subresultants. Arch. Formal Proofs 2017 (2017) - [c12]Sebastiaan J. C. Joosten:
Parsing and Printing of and with Triples. RAMiCS 2017: 159-176 - [c11]Marc Brockschmidt, Sebastiaan J. C. Joosten, René Thiemann
, Akihisa Yamada
:
Certifying Safety and Termination Proofs for Integer Transition Systems. CADE 2017: 454-471 - [c10]Jose Divasón
, Sebastiaan J. C. Joosten, René Thiemann
, Akihisa Yamada
:
A formalization of the Berlekamp-Zassenhaus factorization algorithm. CPP 2017: 17-29 - 2016
- [j1]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
The Factorization Algorithm of Berlekamp and Zassenhaus. Arch. Formal Proofs 2016 (2016) - 2015
- [c9]Stef M. M. Joosten
, Sebastiaan J. C. Joosten:
Type Checking by Domain Analysis in Ampersand. RAMiCS 2015: 225-240 - [c8]Sebastiaan J. C. Joosten, Julien Schmaltz:
Automatic extraction of micro-architectural models of communication fabrics from register transfer level designs. DATE 2015: 1413-1418 - [c7]Sanne Wouda, Sebastiaan J. C. Joosten, Julien Schmaltz:
Process algebra semantics & reachability analysis for micro-architectural models of communication fabrics. MEMOCODE 2015: 198-207 - 2014
- [c6]Sebastiaan J. C. Joosten, Julien Schmaltz:
Scalable liveness verification for communication fabrics. DATE 2014: 1-6 - [c5]Sebastiaan J. C. Joosten, Cezary Kaliszyk
, Josef Urban:
Initial Experiments with TPTP-style Automated Theorem Provers on ACL2 Problems. ACL2 2014: 77-85 - 2013
- [c4]Freek Verbeek, Sebastiaan J. C. Joosten, Julien Schmaltz:
Formal Deadlock Verification for Click Circuits. ASYNC 2013: 183-190 - [c3]Sebastiaan J. C. Joosten, Julien Schmaltz:
Generation of inductive invariants from register transfer level designs of communication fabrics. MEMOCODE 2013: 57-64 - [c2]Sebastiaan J. C. Joosten, Bernard van Gastel, Julien Schmaltz:
A Macro for Reusing Abstract Functions and Theorems. ACL2 2013: 29-41 - [i1]Sebastiaan J. C. Joosten, Hans Zantema:
Relaxation of 3-partition instances. CTW 2013: 133-136 - 2011
- [c1]Gerard Michels, Sebastiaan J. C. Joosten, Jaap van der Woude, Stef Joosten
:
Ampersand - Applying Relation Algebra in Practice. RAMiCS 2011: 280-293
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint