{
 "uuid": "3bbc9713-40c9-49e0-a148-57ffdb124a06",
 "handle": "uniba/20793",
 "type": "Publication",
 "name": "Grounding Synchronous Deterministic Concurrency in Sequential Programming",
 "url": "/entities/publication/3bbc9713-40c9-49e0-a148-57ffdb124a06/",
 "lastModified": "2024-10-15T11:57:33.691+00:00",
 "metadata": {
  "dc.contributor.author": [
   {
    "value": "Aguado, Joaquín",
    "authority": "afeb1f6b-41b7-4b4a-a14d-5c38574707d2",
    "language": "de_DE"
   },
   {
    "value": "Mendler, Michael",
    "authority": "a35cfaac-cffc-473a-86bc-7bf41c04b868",
    "language": "de_DE"
   },
   {
    "value": "Von Hanxleden, Reinhard",
    "authority": "ad587590-e9c0-4dc3-af6c-d87e5ded6950",
    "language": "de_DE"
   },
   {
    "value": "Fuhrmann, Insa",
    "authority": "3e85318b-ae34-4f57-8632-33f451daaa49",
    "language": "de_DE"
   }
  ],
  "dc.date.accessioned": [
   {
    "value": "2019-09-19T15:53:55Z",
    "language": "de_DE"
   }
  ],
  "dc.date.available": [
   {
    "value": "2016-05-25T15:39:49+02:00",
    "language": "de_DE"
   }
  ],
  "dc.date.issued": [
   {
    "value": "2014",
    "language": "de_DE"
   }
  ],
  "dc.description.abstract": [
   {
    "value": "In this report, we introduce an abstract interval domain I(D; P) and associated fixed point semantics for reasoning about concurrent and sequential variable accesses within a synchronous cycle-based model of computation. The interval domain captures must (lower bound) and cannot (upper bound) information to approximate the synchronisation status of variables consisting of a value status D and an init status P. We use this domain for a new behavioural definition of Berry’s causality analysis for Esterel. This gives a compact and uniform understanding of Esterel-style constructiveness for shared-memory multi-threaded programs. Using this new domain-theoretic characterisation we show that Berry’s constructive semantics is a conservative approximation of the recently proposed sequentially constructive (SC) model of computation. We prove that every Berry-constructive program is sequentially constructive, i.e., deterministic and deadlock-free under sequentially admissible scheduling. This gives, for the first time, a natural interpretation of Berry-constructiveness for main-stream imperative programming in terms of scheduling, where previous results were cast in terms of synchronous circuits. It also opens the door to a direct mapping of Esterel’s signal mechanism into boolean variables that can be set and reset arbitrarily within a tick.\r\nWe illustrate the practical usefulness of this mapping by discussing how signal reincarnation is handled efficiently by this transformation, which is of complexity that is linear in program",
    "language": "de_DE"
   }
  ],
  "dc.identifier.uri": [
   {
    "value": "https://fis.uni-bamberg.de/handle/uniba/20793"
   }
  ],
  "dc.identifier.urn": [
   {
    "value": "urn:nbn:de:bvb:473-opus4-250905"
   }
  ],
  "dc.language.abstract": [
   {
    "value": "eng",
    "language": "de_DE"
   }
  ],
  "dc.language.iso": [
   {
    "value": "eng",
    "language": "de_DE"
   }
  ],
  "dc.language.subject": [
   {
    "value": "eng",
    "language": "de_DE"
   },
   {
    "value": "eng",
    "language": "de_DE"
   },
   {
    "value": "eng",
    "language": "de_DE"
   },
   {
    "value": "eng",
    "language": "de_DE"
   },
   {
    "value": "eng",
    "language": "de_DE"
   }
  ],
  "dc.language.title": [
   {
    "value": "eng",
    "language": "de_DE"
   }
  ],
  "dc.publisher": [
   {
    "value": "opus",
    "language": "de_DE"
   }
  ],
  "dc.publisher.place": [
   {
    "value": "Bamberg",
    "language": "de_DE"
   }
  ],
  "dc.relation.authororgunit": [
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#",
    "language": "de_DE"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#",
    "language": "de_DE"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#",
    "language": "de_DE"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#",
    "language": "de_DE"
   }
  ],
  "dc.relation.ispartofseries": [
   {
    "value": "Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik",
    "authority": "b1e60d6b-45fa-4f5d-88cb-56a5d74ab3ed",
    "language": "de_DE"
   }
  ],
  "dc.relation.ispartofseriesnumber": [
   {
    "value": "94",
    "language": "de_DE"
   }
  ],
  "dc.subject": [
   {
    "value": "Concurrency",
    "language": "de_DE"
   },
   {
    "value": "determinism",
    "language": "de_DE"
   },
   {
    "value": "constructiveness",
    "language": "de_DE"
   },
   {
    "value": "Mealy reactive systems",
    "language": "de_DE"
   },
   {
    "value": "synchronous  programming",
    "language": "de_DE"
   }
  ],
  "dc.subject.ddc": [
   {
    "value": "004",
    "language": "de_DE"
   }
  ],
  "dc.title": [
   {
    "value": "Grounding Synchronous Deterministic Concurrency in Sequential Programming",
    "language": "de_DE"
   }
  ],
  "dc.type": [
   {
    "value": "book",
    "language": "de_DE"
   }
  ],
  "dspace.entity.type": [
   {
    "value": "Publication"
   }
  ],
  "ubg.accessRights.licence": [
   {
    "value": "copyright_deu",
    "language": "de_DE"
   }
  ],
  "ubg.faculty.org": [
   {
    "value": "Professur für Grundlagen der Informatik",
    "authority": "30765c58-fe71-4fa1-9811-f2c6e2805751",
    "language": "de_DE"
   }
  ],
  "ubg.fulltexticon": [
   {
    "value": "true"
   }
  ],
  "ubg.generated.csl": [
   {
    "value": "<div class=\"csl-bib-body\">\n  <div class=\"csl-entry\">Aguado, Joaquín; Mendler, Michael; Von Hanxleden, Reinhard; u. a. (2014): <i>Grounding Synchronous Deterministic Concurrency in Sequential Programming</i>, Bamberg: opus.</div>\n</div>"
   }
  ],
  "ubg.intern.opusdatepublished": [
   {
    "value": "2016-05-25T15:39:49+02:00",
    "language": "de_DE"
   }
  ],
  "ubg.intern.org": [
   {
    "value": "Professur für Grundlagen der Informatik",
    "authority": "30765c58-fe71-4fa1-9811-f2c6e2805751",
    "language": "de_DE"
   }
  ],
  "ubg.intern.vonfeld": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.intern.vonfeldeditor": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.pages.count": [
   {
    "value": "86"
   }
  ],
  "ubg.pages.illustration": [
   {
    "value": "Illustrationen"
   }
  ],
  "ubg.subject.gndsw": [
   {
    "value": "Programmiersprache",
    "language": "de_DE"
   },
   {
    "value": "Parallelverarbeitung",
    "language": "de_DE"
   }
  ],
  "ubg.subject.rvk": [
   {
    "value": "ST 240",
    "language": "de_DE"
   }
  ],
  "ubg.submission.type": [
   {
    "value": "full-text",
    "language": "de_DE"
   }
  ],
  "ubg.thesis.grantor": [
   {
    "value": "Uni",
    "language": "de_DE"
   }
  ]
 },
 "relations": {},
 "files": [
  {
   "uuid": "73352c41-b4cb-490f-b22c-678290e285c5",
   "bundle": "ORIGINAL",
   "name": "BBWIAI94MendlerseA2.pdf",
   "size": 1706654,
   "md5": "ad7f537aed07003e73cf3b65e8d87759",
   "mimetype": "application/pdf",
   "url": "/files/73352c41-b4cb-490f-b22c-678290e285c5/BBWIAI94MendlerseA2.pdf",
   "description": "BBWIAI94MendlerseA2.pdf"
  }
 ]
}