{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q465488","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q465488","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q465488","kernelVersion":"v1","immutable":true,"modified":"2026-01-20T23:31:40Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q465488","name":"Deadlock checking by data race detection","headline":"Deadlock checking by data race detection","description":"scientific article; zbMATH DE number 6360846","url":"https://portal.mardi4nfdi.de/entity/Q465488","datePublished":"2014-10-23","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q444479"},{"@id":"https://portal.mardi4nfdi.de/entity/Q338622"},{"@id":"https://portal.mardi4nfdi.de/entity/Q338623"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q246441"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.JLAMP.2014.07.003","url":"https://doi.org/10.1016/J.JLAMP.2014.07.003"},"sameAs":["https://doi.org/10.1016/J.JLAMP.2014.07.003"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3393404"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5633643"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5466554"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2753764"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4380998"},{"@id":"https://portal.mardi4nfdi.de/entity/Q444480"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2948236"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4779111"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2575137"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3392925"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4764612"}]},"provenance":{"prov:generatedAtTime":"2026-01-20T23:31:40Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}