{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:28:52Z","timestamp":1710347332211},"reference-count":21,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-6423(02)00133-8","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"203-220","source":"Crossref","is-referenced-by-count":11,"title":["State space reduction based on live variables analysis"],"prefix":"10.1016","volume":"47","author":[{"given":"Jean-Claude","family":"Fernandez","sequence":"first","affiliation":[]},{"given":"Marius","family":"Bozga","sequence":"additional","affiliation":[]},{"given":"Lucian","family":"Ghirvu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(02)00133-8_BIB1","series-title":"Proc. TACAS\u201999, Amsterdam, The Netherlands","first-page":"208","article-title":"Symbolic verification of lossy channel systems","volume":"Vol. 1579","author":"Abdulla","year":"1999"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB2","series-title":"Compilers","author":"Aho","year":"1986"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB3","series-title":"Proc. CAV\u201998, Vancouver, Canada","first-page":"319","article-title":"Computing abstractions of infinite state systems compositionally and automatically","volume":"Vol. 1427","author":"Bensalem","year":"1998"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB4","series-title":"Proc. CAV\u201996, New Brunswick, USA","first-page":"1","article-title":"Symbolic verification of communication protocols with infinite state spaces using QDDs","volume":"Vol. 1102","author":"Boigelot","year":"1996"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB5","series-title":"6th Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems","first-page":"235","article-title":"Using static analysis to improve automatic test generation","volume":"Vol. 1785","author":"Bozga","year":"2000"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB6","series-title":"Proc. FM\u201999, Toulouse, France","first-page":"307","article-title":"IF: An intermediate representation and validation environment for timed asynchronous systems","volume":"Vol. 1708","author":"Bozga","year":"1999"},{"issue":"1","key":"10.1016\/S0167-6423(02)00133-8_BIB7","first-page":"27","article-title":"Verification and test generation for the SSCOP protocol","volume":"36","author":"Bozga","year":"2000","journal-title":"J. Sci. Comput. Programming (Special Isssue on Formal Methods in Industry)"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB8","doi-asserted-by":"crossref","unstructured":"C. Colby, P. Godefroid, L. Jagadeesan, Automatically closing open reactive systems, in: Proc. ACM SIGPLAN on Programming Language Design and Implementation, Montreal, Canada, 1998, pp. 345\u2013357.","DOI":"10.1145\/277652.277754"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB9","series-title":"Proc. RTSS\u201996, Washington, DC, USA","article-title":"Reducing the number of clock variables of timed automata","author":"Daws","year":"1996"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB10","series-title":"Proc. CAV\u201996, New Brunswick, USA","first-page":"437","article-title":"CADP","volume":"Vol. 1102","author":"Fernandez","year":"1996"},{"issue":"2\/3","key":"10.1016\/S0167-6423(02)00133-8_BIB11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF00121127","article-title":"\u201cOn the Fly\u201d verification of finite transition systems","volume":"1","author":"Fernandez","year":"1992","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB12","series-title":"Proc. CAV\u201993, Heraklion, Greece","first-page":"85","article-title":"Symbolic equivalence checking","volume":"Vol. 697","author":"Fernandez","year":"1993"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB13","article-title":"Partial-Order Methods for the Verification of Concurrent Systems\u2014An Approach to the State Explosion Problem","volume":"Vol. 1032","author":"Godefroid","year":"1996"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB14","series-title":"Proc. SPIN\u201901 Workshop (Toronto, Canada)","article-title":"Verification experiments on the Mascara protocol","volume":"Vol. 2057","author":"Graf","year":"2001"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB15","series-title":"Design and Validation of Computer Protocols, Software Series","author":"Holzmann","year":"1991"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB16","series-title":"Proc. TACAS\u201998, Lisbon, Portugal","first-page":"345","article-title":"Static partial order reduction","volume":"Vol. 1384","author":"Kurshan","year":"1998"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB17","series-title":"Symbolic Model Checking: an Approach to the State Explosion Problem","author":"McMillan","year":"1993"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB18","article-title":"A Calculus of Communication Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB19","series-title":"Advanced Compiler Design Implementation","author":"Muchnick","year":"1997"},{"key":"10.1016\/S0167-6423(02)00133-8_BIB20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","article-title":"Concurrency and automata on infinite sequences","volume":"104","author":"Park","year":"1981","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/S0167-6423(02)00133-8_BIB21","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","article-title":"Program slicing","volume":"SE-10","author":"Weiser","year":"1984","journal-title":"IEEE Trans. Software Eng."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302001338?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642302001338?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T16:05:17Z","timestamp":1584029117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642302001338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167642302001338"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(02)00133-8","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}