{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:56Z","timestamp":1750221296765,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:00:00Z","timestamp":1544140800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSOFT Softw. Eng. Notes"],"published-print":{"date-parts":[[2018,12,7]]},"abstract":"<jats:p>In computing, concurrency refers to the notion that different parts or units of a program or algorithm may be executed out-of-order or in partial order, without affecting the final outcome. Concurrency is historically a difficult topic for students. When confronted with non-deterministic systems, students are challenged to refine their reasoning about sequence, state, and what makes a program \"correct\". A number of problems in concurrency have been posed in the form of relatable examples, e.g. dining philosophers, an ornamental garden, a single lane bridge. These classical problems provide a \"real-world\" analogy that can be used to motivate student engagement and exploration. We explore the questions of whether the RESOLVE framework could support the concepts and operations needed to implement these classical problems, what additional features in RESOLVE would be required for specification and implementation and what related student activities might be developed.<\/jats:p>","DOI":"10.1145\/3229783.3229797","type":"journal-article","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T19:45:00Z","timestamp":1544211900000},"page":"18-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Reasoning About Concurrency"],"prefix":"10.1145","volume":"43","author":[{"given":"Eileen","family":"Kraemer","sequence":"first","affiliation":[{"name":"Clemson University School of Computing"}]},{"given":"Aubrey","family":"Lawson","sequence":"additional","affiliation":[{"name":"Clemson University School of Computing"}]}],"member":"320","published-online":{"date-parts":[[2018,12,7]]},"container-title":["ACM SIGSOFT Software Engineering Notes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3229783.3229797","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3229783.3229797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:11Z","timestamp":1750212791000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3229783.3229797"}},"subtitle":["Scenarios for Activities"],"short-title":[],"issued":{"date-parts":[[2018,12,7]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,12,7]]}},"alternative-id":["10.1145\/3229783.3229797"],"URL":"https:\/\/doi.org\/10.1145\/3229783.3229797","relation":{},"ISSN":["0163-5948"],"issn-type":[{"type":"print","value":"0163-5948"}],"subject":[],"published":{"date-parts":[[2018,12,7]]},"assertion":[{"value":"2018-12-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}