1987 · 557 citations · 9 references
ComputingComputer EngineeringComputer ScienceFormal MethodsProgramming LanguagesReal-time SystemsControl-flow AnalysisData-flow AnalysisFinite State Machine ModelingReal-time Systems DesignReal-time Systems ProgrammingSpecification LanguagesDeclarative SemanticsDeclarative TransformationFinite-state ProcessesInference RulesProgram TransformationReal-time Code GenerationReal-time SemanticsTimed Automata
LUSTRE is a synchronous data-flow language for programming systems which interact with their environments in real-time. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we show how to use this semantics in order to generate efficient sequential code, namely, a finite state automaton which represents the control of the program. Formal rules for program transformation are also presented.
9
The Semantics of a Simple Language for Parallel Programming.
Gilles Kahn · IFIP Congress · 1974 · 2.1K citations
Calculi for synchrony and asynchrony
Robin Milner · Theoretical Computer Science · 1983 · 898 citations · Full text
From regular expressions to deterministic automata
Gérard Berry, Ravi Sethi · Theoretical Computer Science · 1986 · 264 citations · Full text