default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLex Bijlsma 0001
Person information
- affiliation: Open University of the Netherlands, Heerlen
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Arno Broeders, Ruud Hermans, Sylvia Stuurman, Lex Bijlsma, Harrie Passier:
Improving students' code correctness and test completeness by informal specifications. CoRR abs/2309.02221 (2023)- 2022
- [j11]Lex A. Bijlsma
, Arjan J. F. Kok, Harrie J. M. Passier, Harold J. Pootjes, Sylvia Stuurman:
Evaluation of design pattern alternatives in Java. Softw. Pract. Exp. 52(5): 1305-1315 (2022) - [c15]Sander Albers, Nando Reij, Wouter Brinksma, Lex Bijlsma, Harrie Passier:
Towards a Tool to Support Students through Procedural Programming Guidance. CSERC 2022: 13-23 - 2021
- [c14]Harrie Passier, Cornelis Huizing, Arjan J. F. Kok, Ruurd Kuiper, Lex Bijlsma, Erik Scheffers, Stefano Schivo, Tanja E. J. Vos:
A Structured (Java) Exercise Repository with Automated Feedback (SERF). CSERC 2021: 68-69 - [c13]Lex Bijlsma, Niels Doorn, Harrie Passier, Harold Pootjes, Sylvia Stuurman:
How do Students Test Software Units? ICSE (SEET) 2021: 189-198 - [c12]Niels Doorn, Tanja E. J. Vos, Beatriz Marín, Harrie Passier, Lex Bijlsma, Silvio Cacace:
Exploring students' sensemaking of test case design. An initial study. QRS Companion 2021: 1069-1078 - [i1]Lex Bijlsma, Niels Doorn, Harrie Passier, Harold Pootjes, Sylvia Stuurman:
How do students test software units? CoRR abs/2102.09368 (2021)
2010 – 2019
- 2019
- [c11]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 - 2018
- [j10]A. Bijlsma, Harrie J. M. Passier, Harold Pootjes, Sylvia Stuurman:
Template Method test pattern. Inf. Process. Lett. 139: 8-12 (2018) - 2016
- [c10]Harrie Passier, Lex Bijlsma, Christoph Bockisch:
Maintaining Unit Tests During Refactoring. PPPJ 2016: 18:1-18:6 - 2011
- [c9]Hanneke Potters, Adriana J. Berlanga, Lex Bijlsma:
Peer production & peer support at the Free Technology Academy. CSERC 2011: 49-56 - [c8]Frans Mofers, Wouter Tebbens, Hanneke Potters, Lex Bijlsma:
Shared QA for producing free educational materials at the FTA. OKCon 2011
2000 – 2009
- 2009
- [c7]David Megías, Wouter Tebbens, Lex Bijlsma, Francesc Santanach:
Free technology academy: a European initiative for distance education about free software and open standards. ITiCSE 2009: 70-74 - 2006
- [c6]Richard Nieuwenhuis, Inge van de Weerd, Lex Bijlsma, Sjaak Brinkkemper, Johan Versendaal:
The Software Product Management Workbench: An Integrated Environment for Managing Product Releases in a Distributed Development Context. CAiSE Forum 2006 - [c5]Inge van de Weerd, Sjaak Brinkkemper, Richard Nieuwenhuis, Johan Versendaal, Lex Bijlsma:
On the Creation of a Reference Framework for Software Product Management: Validation and Tool Support. IWSPM 2006: 3-12 - [c4]Inge van de Weerd, Sjaak Brinkkemper, Richard Nieuwenhuis, Johan Versendaal, Lex Bijlsma:
Towards a Reference Framework for Software Product Management. RE 2006: 312-315 - 2001
- [j9]Lex Bijlsma:
Model-based specification. Inf. Process. Lett. 77(2-4): 77-84 (2001)
1990 – 1999
- 1998
- [j8]Lex Bijlsma, Rob Nederpelt:
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions. Acta Informatica 35(12): 1007-1036 (1998) - [c3]A. Bijlsma:
An Application of Program Derivation Techniques to 18th-Century Mathematics. MPC 1998: 44-51 - [c2]A. J. M. van Gasteren, A. Bijlsma:
An extension of the program derivation format. PROCOMET 1998: 167-185 - 1996
- [j7]A. Bijlsma, Carel S. Scholten:
Point-free Substitution. Sci. Comput. Program. 27(2): 205-214 (1996) - 1993
- [j6]A. Bijlsma:
Quasi-Boolean Equivalence. Inf. Process. Lett. 45(5): 243-247 (1993) - [j5]A. Bijlsma:
Calculating with Procedure Calls. Inf. Process. Lett. 46(5): 211-217 (1993) - 1991
- [j4]A. Bijlsma:
Derivation of Logic Programs by Functional Methods. Inf. Process. Lett. 39(6): 325-332 (1991)
1980 – 1989
- 1989
- [j3]A. Bijlsma, P. A. Matthews, J. G. Wiltink:
A Sharp Proof Rule for Procedures in wp Semantics. Acta Informatica 26(5): 409-419 (1989) - [j2]A. Bijlsma:
Calculating with Pointers. Sci. Comput. Program. 12(3): 191-205 (1989) - [c1]A. Bijlsma:
Transformational Programming and Forests. MPC 1989: 157-173 - 1986
- [j1]A. Bijlsma, J. G. Wiltink, P. A. Matthews:
Equivalence of the Gries and Martin Proof Rules for Procedure Calls. Acta Informatica 23(4): 357-360 (1986)
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-04-24 22:55 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:
