{"id":"https://openalex.org/W2516127262","doi":"https://doi.org/10.2168/lmcs-12(3:11)2016","title":"Data optimizations for constraint automata","display_name":"Data optimizations for constraint automata","publication_year":2017,"publication_date":"2017-04-27","ids":{"openalex":"https://openalex.org/W2516127262","doi":"https://doi.org/10.2168/lmcs-12(3:11)2016","mag":"2516127262"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-12(3:11)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(3:11)2016","pdf_url":"https://lmcs.episciences.org/2041/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2041/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sung-Shik T. Q. Jongmans","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]},{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sung-Shik T. Q. Jongmans","raw_affiliation_strings":["Open University of the Netherlands, Radboud University Nijmegen, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Open University of the Netherlands, Radboud University Nijmegen, the Netherlands","institution_ids":["https://openalex.org/I7876267","https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":null,"display_name":"Farhad Arbab","orcid":null},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Farhad Arbab","raw_affiliation_strings":["Centrum Wiskunde & Informatica, Leiden University, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica, Leiden University, the Netherlands","institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I121797337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145872427","https://openalex.org/I7876267"],"apc_list":null,"apc_paid":null,"fwci":0.2356,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52034574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 12, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5292999744415283,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.5292999744415283,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.186599999666214,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.15800000727176666,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.8528000116348267},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6638000011444092},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5995000004768372},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4771000146865845},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.47029998898506165},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4171999990940094},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.388700008392334},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.34360000491142273}],"concepts":[{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.8528000116348267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7739999890327454},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6638000011444092},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5995000004768372},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.517300009727478},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4771000146865845},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.47029998898506165},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4569999873638153},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4171999990940094},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3831000030040741},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.34360000491142273},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3098999857902527},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.299699991941452},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.29910001158714294},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.2168/lmcs-12(3:11)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(3:11)2016","pdf_url":"https://lmcs.episciences.org/2041/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1608.04592","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.04592","pdf_url":"https://arxiv.org/pdf/1608.04592","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:ul:oai:scholarlypublications.universiteitleiden.nl:item_2863946","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1608.04592","pdf_url":"http://hdl.handle.net/1887/56095","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science (LMCS), 12(3:11), 1 - 38","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:5f297d493d41438cb678b90810ea1cce","is_oa":true,"landing_page_url":"https://doaj.org/article/5f297d493d41438cb678b90810ea1cce","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 12, Issue 3 (2017)","raw_type":"article"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/166082","is_oa":false,"landing_page_url":"http://hdl.handle.net/2066/166082","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 12, 3, pp. 11.1-11.38","raw_type":"Article / Letter to editor"},{"id":"pmh:oai:research.ou.nl:publications/4dc9b03b-5150-4f9b-9050-fa1e5c7f148c","is_oa":true,"landing_page_url":"https://hdl.handle.net/1820/4dc9b03b-5150-4f9b-9050-fa1e5c7f148c","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jongmans, S-S T Q & Arbab, F 2017, 'DATA OPTIMIZATIONS FOR CONSTRAINT AUTOMATA', Logical Methods in Computer Science, vol. 12, no. 3, 11. https://doi.org/10.2168/LMCS-12(3:11)2016","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:ou:oai:research.ou.nl:publications/4dc9b03b-5150-4f9b-9050-fa1e5c7f148c","is_oa":true,"landing_page_url":"https://research.ou.nl/en/publications/4dc9b03b-5150-4f9b-9050-fa1e5c7f148c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 12(3):11. Technical University of Braunschweig","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-12(3:11)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(3:11)2016","pdf_url":"https://lmcs.episciences.org/2041/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2516127262.pdf","grobid_xml":"https://content.openalex.org/works/W2516127262.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Constraint":[0],"automata":[1,10],"(CA)":[2],"constitute":[3],"a":[4,75,80,92,128,135,147,161],"coordination":[5],"model":[6],"based":[7],"on":[8,11,59,164],"finite":[9],"infinite":[12],"words.":[13],"Originally":[14],"introduced":[15],"for":[16,120],"modeling":[17],"of":[18,24,62,67,69,116,125,166],"coordinators,":[19],"an":[20,36,85],"interesting":[21],"new":[22],"application":[23],"CAs":[25,31],"is":[26,77],"implementing":[27],"coordinators":[28],"(i.e.,":[29],"compiling":[30],"into":[32],"executable":[33,168],"code).":[34],"Such":[35],"approach":[37],"guarantees":[38],"correctness-by-construction":[39],"and":[40,64,112,134],"can":[41,159],"even":[42],"yield":[43],"code":[44,98],"that":[45,83,155],"outperforms":[46],"hand-crafted":[47],"code.":[48,169],"The":[49],"extent":[50],"to":[51,123,130,141],"which":[52],"these":[53,156],"two":[54,117],"potential":[55],"advantages":[56],"materialize":[57],"depends":[58],"the":[60,65,114],"smartness":[61],"CA-compilers":[63,121],"existence":[66],"proofs":[68],"their":[70],"correctness.":[71],"Every":[72],"transition":[73],"in":[74,146],"CA":[76],"labeled":[78],"by":[79],"\"data":[81],"constraint\"":[82],"specifies":[84],"atomic":[86],"data-flow":[87],"between":[88],"coordinated":[89],"processes":[90],"as":[91,103,105],"first-order":[93],"formula.":[94],"At":[95],"run-time,":[96],"compiler-generated":[97],"must":[99],"handle":[100],"data":[101,126,139,143],"constraints":[102,140],"efficiently":[104],"possible.":[106],"In":[107],"this":[108],"paper,":[109],"we":[110,153],"present,":[111],"prove":[113],"correctness":[115],"optimization":[118,157],"techniques":[119,158],"related":[122],"handling":[124],"constraints:":[127],"reduction":[129],"eliminate":[131],"redundant":[132],"variables":[133],"translation":[136],"from":[137],"(declarative)":[138],"(imperative)":[142],"commands":[144],"expressed":[145],"small":[148],"sequential":[149],"language.":[150],"Through":[151],"experiments,":[152],"show":[154],"have":[160],"positive":[162],"impact":[163],"performance":[165],"generated":[167]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2016-09-16T00:00:00"}