{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:57Z","timestamp":1761610317265,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4046,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0661(05)80436-0","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"11-18","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Symbolic simulation of synchronous programs"],"prefix":"10.1016","volume":"65","author":[{"given":"David","family":"Garriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S1571-0661(05)80436-0_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1978.1675141","article-title":"Binary decision diagrams","volume":"27","author":"Akers","year":"1978","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB2","first-page":"1","article-title":"Dataflow synchronous languages","author":"Benveniste","year":"1993"},{"issue":"2","key":"10.1016\/S1571-0661(05)80436-0_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","article-title":"The Esterel synchronous programming language: Design, semantics, implementation","volume":"19","author":"Berry","year":"1992","journal-title":"Science of Computer Programming"},{"issue":"3","key":"10.1016\/S1571-0661(05)80436-0_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/136035.136043","article-title":"Symbolic boolean manipulation with ordered binary decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM computing surveys"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB5","first-page":"316","article-title":"Combining constraints solving and symbolic model-checking for a class of systems with non-linear constraints","author":"Chan","year":"1997"},{"issue":"2","key":"10.1016\/S1571-0661(05)80436-0_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite state concurrent systems using temporal logic specification","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Trans. Programming Languages"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB7","first-page":"84","article-title":"Automatic discovery of linear restraints among variables of a program","author":"Cousot","year":"1978"},{"year":"1993","series-title":"Synchronous programming of reactive systems","author":"Halbwachs","key":"10.1016\/S1571-0661(05)80436-0_BIB8"},{"journal-title":"Bac: A boolean automaton checker (version 1)","year":"1994","author":"Halbwachs","key":"10.1016\/S1571-0661(05)80436-0_BIB9"},{"issue":"9","key":"10.1016\/S1571-0661(05)80436-0_BIB10","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1109\/5.97300","article-title":"The synchronous dataflow programming language Lustre","volume":"79","author":"Halbwachs","year":"1991","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"10.1016\/S1571-0661(05)80436-0_BIB11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/A:1008678014487","article-title":"Verification of real-time systems using linear relation analysis","volume":"11","author":"Halbwachs","year":"1997","journal-title":"Formal Methods in System Design"},{"year":"2000","series-title":"Partitionnement Dynamique dans l'Analyse de Relations Lin\u00e9aires et Application \u00e0 la V\u00e9rification de Programmes Synchrones","author":"Jeannet","key":"10.1016\/S1571-0661(05)80436-0_BIB12"},{"issue":"7","key":"10.1016\/S1571-0661(05)80436-0_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","article-title":"King. Symbolic execution and program testing","volume":"19","author":"James","year":"1976","journal-title":"ACM"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB14","series-title":"3rd Workshop on Synchronous Languages","article-title":"Symbolic simulation of interpreted automata","author":"Mauras","year":"1996"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB15","series-title":"MSR'99. ENS Cachan, Mars","article-title":"Simulation symbolique de programmes r\u00e9actifs synchrones: application \u00e0 la mise au point et \u00e0 la v\u00e9rification du controle d'une chaudi\u00e9re","author":"Mauras","year":"1999"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB16","first-page":"414","article-title":"Model-checking for real-time systems","author":"Courcoubetis","year":"1990"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB17","series-title":"Th\u00e8se de doctorat, I.N.P.G., Novembre","article-title":"Compilation efficace d'un langage dclaratif synchrone: le gnrateur de code Lustre - V3","author":"Raymond","year":"1991"},{"key":"10.1016\/S1571-0661(05)80436-0_BIB18","first-page":"400","article-title":"Symbolic model checking of infinite state systems using presburger arithmetic","author":"Gerber","year":"1997"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:06Z","timestamp":1761610026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S1571066105804360"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80436-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Symbolic simulation of synchronous programs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80436-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}