{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:39:22Z","timestamp":1730295562244,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/seams.2009.5069079","type":"proceedings-article","created":{"date-parts":[[2009,6,10]],"date-time":"2009-06-10T14:54:20Z","timestamp":1244645660000},"page":"106-115","source":"Crossref","is-referenced-by-count":18,"title":["Towards an assume-guarantee theory for adaptable systems"],"prefix":"10.1109","author":[{"given":"Paola","family":"Inverardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrizio","family":"Pelliccione","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Tivoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","article-title":"in transition for global to modular temporal reasoning about programs","author":"pnueli","year":"1984","journal-title":"Logics and Models of Concurrent Systems"},{"journal-title":"Concurrency State Models and Java Programs","year":"1999","author":"kramer","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30227-8_70"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/69575.69577"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21798-7_1"},{"year":"0","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2006.8"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2004.1317444"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177725"},{"key":"7","article-title":"loop bound analysis based on a combination of program slicing, abstract interpretation, and invariant analysis","author":"ermedahl","year":"0","journal-title":"7th Intl Workshop on Worst-Case Execution Time (WCET) Analysis Dagstuhl Germany 2007 Internationales Begegnungs- und Forschungszentrum fu?r Informatik (IBFI)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2003.1201195"},{"key":"5","article-title":"learning assumptions for compositional verification","volume":"2619","author":"cobleigh","year":"2003","journal-title":"LNCS"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1348250.1348253"},{"key":"9","first-page":"212","article-title":"amoeba-rt: run-time verification of adaptive software","author":"goldsby","year":"2008","journal-title":"Models in Software Engineering Workshops and Symposia at MoDELS 2007"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10515-005-2641-y"}],"event":{"name":"2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)","start":{"date-parts":[[2009,5,18]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2009,5,19]]}},"container-title":["2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5054534\/5069056\/05069079.pdf?arnumber=5069079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T03:39:09Z","timestamp":1489808349000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5069079\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/seams.2009.5069079","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}