Sjaak Smetsers - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 43 from 43

2021

Efficient Verification of Optimized Code: Correct High-speed X25519Marc Schoolderman, Jonathan Moerman, Sjaak Smetsers, Marko C. J. D. van Eekelen. iacr, 2021:415, 2021. [doi]

Efficient Verification of Optimized Code - Correct High-Speed X25519Marc Schoolderman, Jonathan Moerman, Sjaak Smetsers, Marko C. J. D. van Eekelen. NFM 2021: 304-321 [doi]

2020

Analyzing the influence of block highlighting on beginning programmers' reading behavior using eye trackingRenske Talsma, Erik Barendsen, Sjaak Smetsers. cserc 2020: [doi]

2019

Evaluation of a Structured Design Methodology for Concurrent ProgrammingLex Bijlsma, Kees Huizing, Ruurd Kuiper, Harrie Passier, Harold Pootjes, Sjaak Smetsers. cserc 2019: 58-65 [doi]

Is Deductive Program Verification Mature Enough to be Taught to Software Engineers?Marc Schoolderman, Sjaak Smetsers, Marko C. J. D. van Eekelen. cserc 2019: 50-57 [doi]

2017

Problem Solving and Algorithmic Development with FlowchartsRenske Smetsers-Weeda, Sjaak Smetsers. wipsce 2017: 25-34 [doi]

2016

Designing a rubric for feedback on code quality in programming coursesMartijn Stegeman, Erik Barendsen, Sjaak Smetsers. kolicalling 2016: 160-164 [doi]

2015

Formalizing Bialgebraic Semantics in PVS 6.0Sjaak Smetsers, Ken Madlener, Marko C. J. D. van Eekelen. RTA 2015: 47-61 [doi]

Derivation and inference of higher-order strictness typesSjaak Smetsers, Marko C. J. D. van Eekelen. Comp. Lang., Syst. \& Struct., 44:166-180, 2015. [doi]

2014

TweetNaCl: A Crypto Library in 100 TweetsDaniel J. Bernstein, Bernard van Gastel, Wesley Janssen, Tanja Lange, Peter Schwabe, Sjaak Smetsers. latincrypt 2015: 64-83 [doi]

Towards an empirically validated model for assessment of code qualityMartijn Stegeman, Erik Barendsen, Sjaak Smetsers. kolicalling 2014: 99-108 [doi]

2013

2012

A Proof Framework for Concurrent ProgramsLeonard Lensink, Sjaak Smetsers, Marko C. J. D. van Eekelen. IFM 2012: 174-190 [doi]

Generating Verifiable Java Code from Verified PVS SpecificationsLeonard Lensink, Sjaak Smetsers, Marko C. J. D. van Eekelen. NFM 2012: 310-325 [doi]

Higher-Order Strictness TypingSjaak Smetsers, Marko C. J. D. van Eekelen. sfp 2013: 85-100 [doi]

2011

Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem provingBernard van Gastel, Leonard Lensink, Sjaak Smetsers, Marko C. J. D. van Eekelen. SCP, 76(2):82-99, 2011. [doi]

2010

A Formal Verification Study on the Rotterdam Storm Surge BarrierKen Madlener, Sjaak Smetsers, Marko C. J. D. van Eekelen. icfem 2010: 287-302 [doi]

2009

Preemption AbstractionErik Schierboom, Alejandro Tamalet, Hendrik Tews, Marko C. J. D. van Eekelen, Sjaak Smetsers. fmics 2009: 149-164 [doi]

Efficient and Type-Safe Generic Data StorageSjaak Smetsers, Arjen van Weelden, Marinus J. Plasmeijer. ENTCS, 238(2):59-70, 2009. [doi]

2008

LaQuSo: Using Formal Methods for Analysis of Safety-CrSjaak Smetsers, Marko C. J. D. van Eekelen. ercim, 2008(75), 2008. [doi]

Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem ProvingBernard van Gastel, Leonard Lensink, Sjaak Smetsers, Marko C. J. D. van Eekelen. fmics 2009: 85-102 [doi]

2007

2005

Improved Fusion for Optimizing GenericsArtem Alimarine, Sjaak Smetsers. PADL 2005: 203-218 [doi]

There and back again: arrows for invertible programmingArtem Alimarine, Sjaak Smetsers, Arjen van Weelden, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer. haskell 2005: 86-97 [doi]

Polytypic Syntax Tree OperationsArjen van Weelden, Sjaak Smetsers, Marinus J. Plasmeijer. IFL 2006: 142-159 [doi]

2004

Optimizing Generic FunctionsArtem Alimarine, Sjaak Smetsers. mpc 2004: 16-31 [doi]

2002

Fusion in PracticeDiederik van Arkel, John H. G. van Groningen, Sjaak Smetsers. IFL 2003: 51-67 [doi]

1996

Uniqueness Typing for Functional Languages with Graph Rewriting SemanticsErik Barendsen, Sjaak Smetsers. mscs, 6(6):579-612, 1996.

Graph Rewriting Semantics for Functional Programming LanguagesMarko C. J. D. van Eekelen, Sjaak Smetsers, Marinus J. Plasmeijer. csl 1997: 106-128

1995

Uniqueness Typing in Natural Deduction StyleErik Barendsen, Sjaak Smetsers. fp 1996: 1

Uniqueness Type InferenceErik Barendsen, Sjaak Smetsers. plilp 1995: 189-206

A derivation system for uniqueness typingErik Barendsen, Sjaak Smetsers. ENTCS, 2:11-18, 1995. [doi]

1993

Extending Graph Rewriting with CopyingErik Barendsen, Sjaak Smetsers. Dagstuhl 1994: 51-70

Conventional and Uniqueness Typing in Graph Rewrite SystemsErik Barendsen, Sjaak Smetsers. fsttcs 1993: 41-51

Partially Strict Non-Recursive Data TypesEric Nöcker, Sjaak Smetsers. JFP, 3(2):191-215, 1993.

Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for GraphsSjaak Smetsers, Erik Barendsen, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer. Dagstuhl 1994: 358-379

1992

Partial Type Assignment in Left Linear Apllicative Term Rewriting SystemsSteffen van Bakel, Sjaak Smetsers, Simon Brock. caap 1992: 300-321

1991

Generating Efficient Code for Lazy Functional LanguagesSjaak Smetsers, Eric Nöcker, John H. G. van Groningen, Marinus J. Plasmeijer. fpca 1991: 592-617

Sign in or sign up to see more results.

runs on WebDSL