{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T14:15:13Z","timestamp":1673360113409},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/tcad.2014.2301671","type":"journal-article","created":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T18:04:52Z","timestamp":1400263492000},"page":"839-852","source":"Crossref","is-referenced-by-count":2,"title":["Local State Space Analysis Leads to Better Partial Order Reduction"],"prefix":"10.1109","volume":"33","author":[{"given":"Hao","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2035544"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2012.15"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73370-6_8"},{"key":"ref11","first-page":"197","article-title":"An improvement in formal verification","author":"holzmann","year":"0","journal-title":"Proc 7th FORTE Conf Formal Description Tech"},{"key":"ref12","author":"godefroid","year":"1995","journal-title":"Partial-Order Methods for the Verification of Concurrent Systems An Approach to the State-Explosion Problem"},{"key":"ref13","first-page":"438","article-title":"Refining dependencies improves partial-order verification methods (extended abstract)","author":"godefroid","year":"0","journal-title":"Proc CAV"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2011.25"},{"key":"ref15","author":"holzmann","year":"2003","journal-title":"The SPIN Model Checker Primer and Reference Manual"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-89874-6.50028-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39176-7_15"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.21236\/ADA442970","author":"martin","year":"1986","journal-title":"Self-timed FIFO An exercise in compiling programs into VLSI circuits"},{"key":"ref28","first-page":"288","article-title":"Efficient stateful dynamic partial order reduction","author":"yang","year":"0","journal-title":"Proc of the 15th International SPIN Workshop on Model Checking of Software"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00121128"},{"key":"ref27","first-page":"398","article-title":"Monotonic partial order reduction: An optimal symbolic partial order reduction technique","volume":"lncs 5643","author":"kahlon","year":"0","journal-title":"Proc Int Conf Comput Aided Verification"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50026-6"},{"key":"ref6","author":"clarke","year":"2000","journal-title":"Model checking"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ASYNC.1996.494447"},{"key":"ref5","author":"dill","year":"1988","journal-title":"Trace theory for automatic hierarchical verification of speed independent circuits"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10009-010-0137-y","article-title":"Solving the ignoring problem for partial order reduction","volume":"12","author":"evangelista","year":"2010","journal-title":"Int J Softw Tools Technol Transfer"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050035"},{"key":"ref2","first-page":"110","article-title":"Dynamic partial-order reduction for model checking software","author":"flanagan","year":"0","journal-title":"Proc Symp Principles of Programming Languages"},{"key":"ref9","first-page":"39","article-title":"Exploring the scope for partial order reduction","author":"geldenhuys","year":"0","journal-title":"Proc ATVA"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10009-008-0093-y","article-title":"Partial-order reduction for general state exploring algorithms","volume":"11","author":"bo\u0161na?ki","year":"2009","journal-title":"Int J Softw Tools Technol Transfer"},{"key":"ref20","author":"myers","year":"1995","journal-title":"Computer-aided synthesis and verification of gate-level timed circuits"},{"key":"ref22","first-page":"409","article-title":"All from one, one for all: On model checking using representatives","author":"peled","year":"0","journal-title":"Proc 5th Int Conf CAV"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73370-6_17"},{"key":"ref24","first-page":"491","article-title":"Stubborn sets for reduced state space generation","author":"valmari","year":"0","journal-title":"Proc 12th Int Conf Appl Theory Petri Nets Adv Petri Nets"},{"key":"ref23","first-page":"208","article-title":"Relative timing","author":"stevens","year":"0","journal-title":"Proc Int Symp Adv Res Asynchronous Circuits Syst"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"377","DOI":"10.3233\/FI-2011-613","article-title":"Can stubborn sets be optimal?","volume":"113","author":"valmari","year":"2011","journal-title":"Fundam Inf"},{"key":"ref25","first-page":"429","article-title":"The state explosion problem","author":"valmari","year":"0","journal-title":"Lectures on Petri Nets I Basic Models Advances in Petri Nets"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6816010\/06816122.pdf?arnumber=6816122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:54:13Z","timestamp":1642006453000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6816122\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2014.2301671","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]}}}