{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:04:44Z","timestamp":1648695884184},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,8]]},"abstract":"<jats:p> The outcome of verifying software is often a 'counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. The verification is usually done using a model of the software (often also using some abstraction to reduce its complexity) rather than the actual code. In order to understand the reason for the failure manifested by such a counterexample, it is sometimes necessary to test such an execution using the actual code. In this way we also find out whether we have a genuine error or a \"false negative\". Due to nondeterminism in concurrent code, enforcing a particular behavior of an actual program is not guaranteed even when one starts the execution with the prescribed initial state. Testers are faced with a similar problem when they have to demonstrate that a suspicious scenario can actually be executed. Such a scenario may involve some intricate scheduling and thus be illusive to demonstrate. We describe here a transformation that allows us to repeat a selected execution sequences of concurrent code. Since the transformation implies changes to the original code, we strive to minimize its effect on the original program. <\/jats:p>","DOI":"10.1142\/s012905410600408x","type":"journal-article","created":{"date-parts":[[2006,8,4]],"date-time":"2006-08-04T22:37:04Z","timestamp":1154731024000},"page":"743-761","source":"Crossref","is-referenced-by-count":0,"title":["ENFORCING CONCURRENT TEMPORAL BEHAVIORS"],"prefix":"10.1142","volume":"17","author":[{"given":"DORON","family":"PELED","sequence":"first","affiliation":[{"name":"Department of Computer Science, The University of Warwick, Coventry, CV4 7AL, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HONGYANG","family":"QU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Warwick, Coventry, CV4 7AL, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","volume-title":"Model Checking","author":"Clarke E.","year":"1999"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/2563"},{"key":"rf5","first-page":"27","volume":"9","author":"Dijkstra E. W.","journal-title":"Communication of the ACM"},{"key":"rf6","first-page":"365","volume":"5","author":"Floyd R. W.","journal-title":"Communications of the ACM"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.10.031"},{"key":"rf10","volume-title":"SDL 99 The Next Millenium","author":"Grabowski J.","year":"1999"},{"key":"rf11","first-page":"21","volume":"75","author":"Katz S.","journal-title":"Theoretical Computer Science"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676929"},{"key":"rf15","volume-title":"The Temporal Logic of Reactive Systems and Concurrent Systems: Specification","author":"Manna Z.","year":"1991"},{"key":"rf16","unstructured":"A.\u00a0Mazurkiewicz, Advances in Petri Nets 1986, Lecture Notes in Computer Science\u00a0255 (Springer-Verlag, 1987)\u00a0pp. 279\u2013324."},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90112-2"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00219-3"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379149"},{"key":"rf25","unstructured":"W.\u00a0Thomas, Handbook of Theoretical Computer Science\u00a0B, ed. J.\u00a0van Leeuwen (Elsevier, Amsterdam, 1990)\u00a0pp. 133\u2013191."},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90157-O"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"rf28","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"Zielonka W.","journal-title":"R.A.I.R.O - Information Theory et Application"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410600408X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:40:21Z","timestamp":1565138421000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410600408X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":18,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,8]]}},"alternative-id":["10.1142\/S012905410600408X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410600408x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}