<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-28T15:18:25Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/134697" metadataPrefix="qdc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/134697</identifier><datestamp>2026-04-14T00:19:14Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Open source verification in an anonymous volunteer network</dc:title>
   <dc:creator>Breuer, Peter T.</dc:creator>
   <dc:creator>Pickin, Simón James</dc:creator>
   <dcterms:abstract>An ‘open’ certification process is characterised here that is not based on any central agency, but rather on the option for any party to confirm any part of the certification process at will. The model for this paradigm has been a distributed, piece-wise, semantic audit carried out on the Linux kernel source code using a lightweight formal method. Our goal is a technology that allows open source developers to receive formally backed certifications for their project, in quid pro quo exchanges of resources and expertise with other developers within an amorphous and anonymous cloud of volunteers. To help ensure the integrity of the results, identifying details such as subroutine and variable names are not included in the data sent for analysis, each part of the computation is repeated many times at different sites, and checkpoint information is generated that enables independent checks to be carried out without starting from scratch each time.</dcterms:abstract>
   <dcterms:dateAccepted>2026-04-13T13:58:43Z</dcterms:dateAccepted>
   <dcterms:available>2026-04-13T13:58:43Z</dcterms:available>
   <dcterms:created>2026-04-13T13:58:43Z</dcterms:created>
   <dcterms:issued>2014-10-01</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/134697</dc:identifier>
   <dc:identifier>0167-6423</dc:identifier>
   <dc:identifier>10.1016/j.scico.2013.08.010</dc:identifier>
   <dc:identifier>1872-7964</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Peter T. Breuer, Simon Pickin, Open source verification in an anonymous volunteer network, Science of Computer Programming, Volume 91, Part B, 2014, Pages 161-187, ISSN 0167-6423, https://doi.org/10.1016/j.scico.2013.08.010.</dc:relation>
   <dc:rights>open access</dc:rights>
   <dc:publisher>Elsevier</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>