{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:04Z","timestamp":1753889764127,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Constraint automata (CA) constitute a coordination model based on finite\nautomata on infinite words. Originally introduced for modeling of coordinators,\nan interesting new application of CAs is implementing coordinators (i.e.,\ncompiling CAs into executable code). Such an approach guarantees\ncorrectness-by-construction and can even yield code that outperforms\nhand-crafted code. The extent to which these two potential advantages\nmaterialize depends on the smartness of CA-compilers and the existence of\nproofs of their correctness.\n  Every transition in a CA is labeled by a \"data constraint\" that specifies an\natomic data-flow between coordinated processes as a first-order formula. At\nrun-time, compiler-generated code must handle data constraints as efficiently\nas possible. In this paper, we present, and prove the correctness of two\noptimization techniques for CA-compilers related to handling of data\nconstraints: a reduction to eliminate redundant variables and a translation\nfrom (declarative) data constraints to (imperative) data commands expressed in\na small sequential language. Through experiments, we show that these\noptimization techniques can have a positive impact on performance of generated\nexecutable code.<\/jats:p>","DOI":"10.2168\/lmcs-12(3:11)2016","type":"journal-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T10:03:42Z","timestamp":1502359422000},"source":"Crossref","is-referenced-by-count":1,"title":["Data optimizations for constraint automata"],"prefix":"10.46298","volume":"Volume 12, Issue 3","author":[{"given":"Sung-Shik T. Q.","family":"Jongmans","sequence":"first","affiliation":[]},{"given":"Farhad","family":"Arbab","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"1232:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2041\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2041\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:09:13Z","timestamp":1681243753000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-12(3:11)2016","relation":{"is-same-as":[{"id-type":"arxiv","id":"1608.04592","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1608.04592","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,4,27]]},"article-number":"2041"}}