default search action
Sjaak Smetsers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Renske Weeda, Sjaak Smetsers, Erik Barendsen
:
Unraveling novices' code composition difficulties. Comput. Sci. Educ. 34(3): 414-441 (2024) - 2021
- [c39]Marc Schoolderman, Jonathan Moerman, Sjaak Smetsers, Marko C. J. D. van Eekelen:
Efficient Verification of Optimized Code - Correct High-Speed X25519. NFM 2021: 304-321 - [i4]Marc Schoolderman, Jonathan Moerman, Sjaak Smetsers, Marko C. J. D. van Eekelen:
Efficient Verification of Optimized Code: Correct High-speed X25519. IACR Cryptol. ePrint Arch. 2021: 415 (2021) - 2020
- [c38]Renske Talsma, Erik Barendsen, Sjaak Smetsers:
Analyzing the influence of block highlighting on beginning programmers' reading behavior using eye tracking. CSERC 2020: 9:1-9:10 - [i3]Marc Schoolderman, Jonathan Moerman, Sjaak Smetsers, Marko C. J. D. van Eekelen:
Efficient Verification of Optimized Code: Correct High-speed Curve25519. CoRR abs/2012.09919 (2020)
2010 – 2019
- 2019
- [c37]Marc Schoolderman
Is Deductive Program Verification Mature Enough to be Taught to Software Engineers? CSERC 2019: 50-57 - [c36]Lex Bijlsma, Kees Huizing, Ruurd Kuiper, Harrie Passier, Harold Pootjes, Sjaak Smetsers:
Evaluation of a Structured Design Methodology for Concurrent Programming. CSERC 2019: 58-65 - [i2]Marko C. J. D. van Eekelen, Daniil Frumin, Herman Geuvers, Léon Gondelman, Robbert Krebbers, Marc Schoolderman
A benchmark for C program verification. CoRR abs/1904.01009 (2019) - 2017
- [c35]Renske Smetsers-Weeda, Sjaak Smetsers:
Problem Solving and Algorithmic Development with Flowcharts. WiPSCE 2017: 25-34 - 2016
- [c34]Martijn Stegeman, Erik Barendsen, Sjaak Smetsers:
Designing a rubric for feedback on code quality in programming courses. Koli Calling 2016: 160-164 - 2015
- [j5]Sjaak Smetsers, Marko C. J. D. van Eekelen:
Derivation and inference of higher-order strictness types. Comput. Lang. Syst. Struct. 44: 166-180 (2015) - [c33]Sjaak Smetsers, Ken Madlener, Marko C. J. D. van Eekelen:
Formalizing Bialgebraic Semantics in PVS 6.0. WPTE@RDP 2015: 47-61 - 2014
- [c32]Martijn Stegeman, Erik Barendsen, Sjaak Smetsers:
Towards an empirically validated model for assessment of code quality. Koli Calling 2014: 99-108 - [c31]Daniel J. Bernstein, Bernard van Gastel, Wesley Janssen, Tanja Lange, Peter Schwabe, Sjaak Smetsers:
TweetNaCl: A Crypto Library in 100 Tweets. LATINCRYPT 2014: 64-83 - 2013
- [c30]Sjaak Smetsers, Erik Barendsen:
Verifying Functional Formalizations - A Type-Theoretical Case Study in PVS. The Beauty of Functional Code 2013: 47-59 - [c29]Rody Kersten, Bernard van Gastel, Manu Drijvers, Sjaak Smetsers, Marko C. J. D. van Eekelen:
Using Model-Checking to Reveal a Vulnerability of Tamper-Evident Pairing. NASA Formal Methods 2013: 63-77 - [c28]Ken Madlener, Sjaak Smetsers, Marko C. J. D. van Eekelen:
Modular Bialgebraic Semantics and Algebraic Laws. SBLP 2013: 46-60 - [c27]Ken Madlener, Sjaak Smetsers:
GSOS Formalized in Coq. TASE 2013: 199-206 - 2012
- [c26]Leonard Lensink, Sjaak Smetsers, Marko C. J. D. van Eekelen:
A Proof Framework for Concurrent Programs. IFM 2012: 174-190 - [c25]Leonard Lensink
Generating Verifiable Java Code from Verified PVS Specifications. NASA Formal Methods 2012: 310-325 - [c24]Sjaak Smetsers, Marko C. J. D. van Eekelen:
Higher-Order Strictness Typing. Trends in Functional Programming 2012: 85-100 - 2011
- [j4]Bernard van Gastel, Leonard Lensink
Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving. Sci. Comput. Program. 76(2): 82-99 (2011) - [c23]Ken Madlener, Sjaak Smetsers, Marko C. J. D. van Eekelen:
Formal Component-Based Semantics. SOS 2011: 17-29 - 2010
- [c22]Ken Madlener, Sjaak Smetsers, Marko C. J. D. van Eekelen:
A Formal Verification Study on the Rotterdam Storm Surge Barrier. ICFEM 2010: 287-302
2000 – 2009
- 2009
- [c21]Erik Schierboom, Alejandro Tamalet, Hendrik Tews, Marko C. J. D. van Eekelen, Sjaak Smetsers:
Preemption Abstraction. FMICS 2009: 149-164 - 2008
- [c20]Bernard van Gastel, Leonard Lensink
Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving. FMICS 2008: 85-102 - [c19]Sjaak Smetsers, Arjen van Weelden, Rinus Plasmeijer:
Efficient and Type-Safe Generic Data Storage. WGT@ETAPS 2008: 59-70 - [i1]Sjaak Smetsers, Marko C. J. D. van Eekelen:
LaQuSo: Using Formal Methods for Analysis of Safety-Cr. ERCIM News 2008(75) (2008) - 2007
- [j3]Bart Jacobs, Sjaak Smetsers, Ronny Wichers Schreur:
Code-carrying theories. Formal Aspects Comput. 19(2): 191-203 (2007) - [c18]Leonard Lensink
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization. FMICS 2007: 115-132 - [c17]Marko C. J. D. van Eekelen, Olha Shkaravska, Ron van Kesteren, Bart Jacobs, Erik Poll, Sjaak Smetsers:
AHA: Amortized Heap Space Usage Analysis. Trends in Functional Programming 2007: 36-53 - 2005
- [c16]Artem Alimarine, Sjaak Smetsers, Arjen van Weelden, Marko C. J. D. van Eekelen, Rinus Plasmeijer:
There and back again: arrows for invertible programming. Haskell 2005: 86-97 - [c15]Arjen van Weelden, Sjaak Smetsers, Rinus Plasmeijer:
Polytypic Syntax Tree Operations. IFL 2005: 142-159 - [c14]Artem Alimarine, Sjaak Smetsers:
Improved Fusion for Optimizing Generics. PADL 2005: 203-218 - 2004
- [c13]Artem Alimarine, Sjaak Smetsers:
Optimizing Generic Functions. MPC 2004: 16-31 - 2002
- [c12]Diederik van Arkel, John H. G. van Groningen, Sjaak Smetsers:
Fusion in Practice. IFL 2002: 51-67
1990 – 1999
- 1996
- [j2]Erik Barendsen, Sjaak Smetsers:
Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. Math. Struct. Comput. Sci. 6(6): 579-612 (1996) - [c11]Marko C. J. D. van Eekelen, Sjaak Smetsers, Marinus J. Plasmeijer:
Graph Rewriting Semantics for Functional Programming Languages. CSL 1996: 106-128 - 1995
- [c10]Erik Barendsen, Sjaak Smetsers:
Uniqueness Typing in Natural Deduction Style. Functional Programming 1995: 1 - [c9]Erik Barendsen, Sjaak Smetsers:
Uniqueness Type Inference. PLILP 1995: 189-206 - [c8]Erik Barendsen, Sjaak Smetsers:
A derivation system for uniqueness typing. SEGRAGRA 1995: 11-18 - 1993
- [j1]Eric Nöcker, Sjaak Smetsers:
Partially Strict Non-Recursive Data Types. J. Funct. Program. 3(2): 191-215 (1993) - [c7]Erik Barendsen, Sjaak Smetsers:
Extending Graph Rewriting with Copying. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 51-70 - [c6]Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer:
Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for Graphs. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 358-379 - [c5]Erik Barendsen, Sjaak Smetsers:
Conventional and Uniqueness Typing in Graph Rewrite Systems. FSTTCS 1993: 41-51 - 1992
- [c4]Steffen van Bakel, Sjaak Smetsers, Simon Brock:
Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems. CAAP 1992: 300-321 - 1991
- [c3]Sjaak Smetsers, Eric Nöcker, John H. G. van Groningen, Marinus J. Plasmeijer:
Generating Efficient Code for Lazy Functional Languages. FPCA 1991: 592-617 - [c2]E. G. J. M. H. Nöcker, J. E. W. Smetsers, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer:
Concurrent Clean. PARLE (2) 1991: 202-219 - 1990
- [c1]Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, J. E. W. Smetsers:
Parallel Graph Rewriting on Loosely Coupled Machine Architectures. CTRS 1990: 354-369
Coauthor Index
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-10-23 21: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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: