{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:25:46Z","timestamp":1778520346304,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6784,"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":[[1995]]},"DOI":"10.1016\/s1571-0661(04)80002-1","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T15:29:25Z","timestamp":1096385365000},"page":"13-31","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Operational Semantics of a Focusing Debugger"],"prefix":"10.1016","volume":"1","author":[{"given":"Karen L.","family":"Bernstein","sequence":"first","affiliation":[]},{"given":"Eugene W.","family":"Stark","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB1","unstructured":"Samson Abramsky. The lazy lambda calculus. The lazy lambda calculus. In David Turner, editors, Research Topics in Functional Programming, The UT Year of Programming Series, pages 65-116. Addison-Wesley Publishing Company, 1990."},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB2","series-title":"Compiling with Continuations","author":"Andrew Appel","year":"1992"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Karen L. Bernstein and Eugene W. Stark Operational semantics of a focusing debugger (full version). Technical report, State University of New York at Stony Brook, Computer Science Department, 1994. FTP:\/\/ftp.cs.sunysb.edu\/pub\/TechReports\/stark\/focus.ps.Z.","DOI":"10.1016\/S1571-0661(04)80002-1"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB4","series-title":"2nd International Workshop on Automated and Algorithmic Debugging","article-title":"On formally defining debuggers","author":"Karen Bernstein","year":"1995"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB5","unstructured":"Dave Berry. Generating Program Animators from Programming Language Semantics. PhD thesis, University of Edinburgh, Edinburgh, Scotland, June 1991. LFCS, Department of Computer Science."},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB6","unstructured":"Fabio Q.B. da Silva. Correctness Proofs of Compilers and Debuggers: an Approach Based on Structured Operational Semantics. PhD thesis, University of Edinburgh, Edinburgh, Scotland October 1991. LFCS, Department of Computer Science."},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Andrew Gordon. An operational semantics for I\/O in a lazy functiona language. In FPCA '93: Conference on Functional Programming Languages and Computer Architecture, pages 136\u2013145. Association for Computing Machinery, ACM Press, 1993.","DOI":"10.1145\/165180.165199"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB8","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB9","unstructured":"Douglas J. Howe. Equality in lazy computation systems. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 198\u2013203. IEEE, IEEE Computer Society Press, 1989."},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Amir Kishon, Paul Hudak, and Charles Consel. Monitoring semantics: A formal framework for specifying, implementing, and reasoning about execution monitors. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 338\u2013352. ACM Press, June 1991.","DOI":"10.1145\/113445.113474"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB11","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB12","unstructured":"D. M. R. Park. Concurrency and automata on infinite sequences. In Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer-Verlag, 1981."},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB13","unstructured":"G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981."},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB14","series-title":"ACM Distinguished Dissertations","article-title":"Algorithmic Program Debugging","author":"Ehud Shapiro","year":"1983"},{"key":"10.1016\/S1571-0661(04)80002-1_NEWBIB15","doi-asserted-by":"crossref","unstructured":"A. P. Tolmach and A. W. Appel. Debugging Standard ML without reverse engineering. In 1990 ACM Conference on Lisp and Functional Programming. Association for Computing Machinery, ACM Press, June 1990.","DOI":"10.1145\/91556.91564"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104800021?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:03:18Z","timestamp":1761609798000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104800021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":15,"alternative-id":["S1571066104800021"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80002-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Operational Semantics of a Focusing Debugger","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(04)80002-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}