B. Le Goff

dblp:97/3006 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › domain-specific languages › synchronous languages
synchronous language semantics
0.011989
From Synchronous Intensional Programming to Efficient Implementation · RTSS 1989
Embedded and real-time systems
synchronous programming
0.011989
From Synchronous Intensional Programming to Efficient Implementation · RTSS 1989

Methods — techniques the papers use, named apart from their topics

modulo arithmetic · 0.0constraint synthesis · 0.0
YearPublicationVenuePosition
1989 From Synchronous Intensional Programming to Efficient Implementation
abstract
The authors combine concepts of synchronous programming and intensional programming for specification of real-time applications. The language Signal, based on both key elements of synchronous programming (the instantaneous and simultaneous nature of events), offers a specification formalism in which the time flow is implicit, i.e., it is dataflow oriented. Moreover, the referential time definition may be left to context; consequently, it is possible to specify some context-sensitive (intensional) processes. It is shown how local temporal and logical constraints are synthesized to exhibit the necessary and sufficient properties that a context should have to authorize a correct running. The constraints are modeled in the field of modulo 3 integers. The synthesis mechanism is presented through a detailed example.>
B. Le Goff
RTSS2
1988 The Granules, Blutton: An Idea, an Algorithm to Implement on Multiprocessor
B. Le Goff, Paul Le Guernic
STACS1