...
Abstract. This is a journal extended version of the [DATE’13] publication which includes in addition: (i) a description of the mapping from the Sequentially Constructive (SC) language to the SC graph (SCG); (ii) detailed discussions on thread and statement reincarnation; (iii) a full section on the formalisation of SC based on free scheduling of SCGs; (iv) a more general SC Model of Computation based on the notion of confluence; (v) a revised (positive) definition of SC-Admissibility; (vi) definition of valid SC-schedules; (vii) proof that every ASC schedulable program is indeed SC; (viii) detailed discussion on conservative approximations and (ix) additional examples for illustrating ineffective writes, failure despite deterministic outcome, data-dependency of SC and enforced determinism via reduction of admissible runs.
...
Workshops/Seminars:
[SYNCHRON’12] Sequentially Constructive Concurrency: A Conservative Extension of the Synchronous Model of Computation. (slides)
...
Summary: This presents ...
[RePP’14-2] The WCRT Worst Case Reaction Time analysis of synchronous programsSynchronous Programs: Studying the tick alignment problemTick Alignment Problem. (slides)
M. Mendler.
Workshop on Reconciling Performance with Predictability (RePP’14), Grenoble France, April 2014.
Summary: Synchronous programs are ideally suited for the design of safety critical systems as they provide guarantees on determinism and deadlock freedom. In addition to such functional guarantees, guarantees on timing are also necessary. In this talk, we study the problem of static worst case reaction (WCRT) time analysis of synchronous programs. While, there have been many recent attempts at addressing this problem from the point of view of scalability and precision, one crucial aspect is yet to be examined from a fundamental viewpoint. Concurrent threads in a synchronous program must align during every reaction, a problem that has been termed as the tick alignment problem (TAP), i.e., infeasible ticks that never align in practice must be ruled out for precision. We, for the first time, study TAP in the guise of a number theoretic formulation in order to not only explore its lower bound complexity, but also to develop heuristics that work well in practice.
...
Technical Reports:
[TR1308] Sequentially Constructive Concurrency. A Conservative Extension of the Synchronous Model of Computation. (pdf)
...