Cronos: a separate compilation tool set for modular esterel applications

Hainque, Olivier; Pautet, Laurent; Biannic, Yann Le; Nassor, Éric

doi:10.1007/3-540-48118-4_47

Cited by 13 publications

(19 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, [9] and [5] start with a fine-grain clustering where every node of the SDG is a sub-graph, and then apply techniques to group nodes into coarser classes. As long as the classes remain disjoint, this approach may result in a larger number of interface functions than our approach.…”

Section: Other Methodsmentioning

confidence: 99%

“…The need for multi-function interfaces has been realized in [9,3,5]. [9,5] start from a very fine-grain interface where every atomic operator is mapped to an interface function, and then use methods to reduce the number of functions by "clustering" operators together.…”

Section: Related Workmentioning

confidence: 99%

“…[9,5] start from a very fine-grain interface where every atomic operator is mapped to an interface function, and then use methods to reduce the number of functions by "clustering" operators together. This approach generates a larger number of interface functions than our dynamic approach.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Modularity vs. Reusability: Code Generation from Synchronous Block Diagrams

Lublinerman¹,

Tripakis²

2008

2008 Design, Automation and Test in Europe

View full text Add to dashboard Cite

We present several methods to generate modular code from synchronous hierarchical block diagrams. Modularity means code is generated for a given macro (i.e., composite) block independently from context, that is, without knowing where this block is to be used, and also with minimal knowledge about its sub-blocks. We achieve this by generating a set of interface functions for each block and a set of dependencies between these functions that is exported along with the interface. The main trade-off is the degree of modularity (number of interface functions) vs. reusability (the set of diagrams that the block can be used in without creating dependency cycles).

show abstract

Section: Other Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Modularity vs. Reusability: Code Generation from Synchronous Block Diagrams

Lublinerman¹,

Tripakis²

2008

2008 Design, Automation and Test in Europe

View full text Add to dashboard Cite

show abstract

“…Such a model is not suitable for WCRT. Hainque et al [10] use a topological abstraction of the underlying circuit graphs (or syntactic structure of Boolean equations) to derive a fairly rigid component dependency model with the effect that multi-threaded execution cannot be modeled compositionally. The interface model also does not cover data dependencies and thus cannot deal with dynamic schedules and does not support WCRT, either.…”

Section: Related Workmentioning

confidence: 99%

“…al. [10] as well as restricted forms of WCRT. However, Lee's interfaces cannot express the difference between an output depending on the joint presence of several values as opposed to depending on each input individually.…”

Section: Related Workmentioning

confidence: 99%

WCRT algebra and interfaces for esterel-style synchronous processing

Mendler

Hanxleden

Traulsen

2009

2009 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition

View full text Add to dashboard Cite

Abstract-The synchronous model of computation together with a suitable execution platform facilitates system-level timing predictability. This paper introduces an algebraic framework for precisely capturing worst case reaction time (WCRT) characteristics for Esterel-style reactive processors with hardware-supported multithreading. This framework provides a formal grounding for the WCRT problem, and allows to improve upon earlier heuristics by accurately and modularly characterizing timing interfaces.

show abstract

Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach

Aguado

Mendler

Pouzet

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Synchronous Programming (SP) is a universal computational principle that provides deterministic concurrency. The same input sequence with the same timing always results in the same externally observable output sequence, even if the internal behaviour generates uncertainty in the scheduling of concurrent memory accesses. Consequently, SP languages have always been strongly founded on mathematical semantics that support formal program analysis. So far, however, communication has been constrained to a set of primitive clock-synchronised shared memory (csm) data types, such as data-flow registers, streams and signals with restricted read and write accesses that limit modularity and behavioural abstractions. This paper proposes an extension to the SP theory which retains the advantages of deterministic concurrency, but allows communication to occur at higher levels of abstraction than currently supported by SP data types. Our approach is as follows. To avoid data races, each csm type publishes a policy interface for specifying the admissibility and precedence of its access methods. Each instance of the csm type has to be policy-coherent, meaning it must behave deterministically under its own policy-a natural requirement if the goal is to build deterministic systems that use these types. In a policy-constructive system, all access methods can be scheduled in a policy-conformant way for all the types without deadlocking. In this paper, we show that a policy-constructive program exhibits deterministic concurrency in the sense that all policyconformant interleavings produce the same input-output behaviour. Policies are conservative and support the csm types existing in current SP languages. Technically, we introduce a kernel SP language that uses arbitrary policy-driven csm types. A big-step fixed-point semantics for this language is developed for which we prove determinism and termination of constructive programs.

show abstract

Cronos: a separate compilation tool set for modular esterel applications

Cited by 13 publications

References 3 publications

Modularity vs. Reusability: Code Generation from Synchronous Block Diagrams

Modularity vs. Reusability: Code Generation from Synchronous Block Diagrams

WCRT algebra and interfaces for esterel-style synchronous processing

Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach

Contact Info

Product

Resources

About