Library Rustre.Memory

• Memory
  • Datatype
  • Operations
  • Properties

Library Rustre.Correctness

• • Technical lemmas
  • Control absorption theorems
  • More technical lemmas
  • Correctness of expression's translation
    • Correctness of clock's translation
    • Correctness of translate_lexp
    • Correctness of translate_cexp
    • Correctness of translate_eqns
    • Correctness of translate
    • Correctness of the reset code
  • Correctness, from the point of view of the event loop
  • Correctness of optimized code

Library Rustre.Correctness.MemoryCorres

• Correspondence between dataflow and imperative memories
  • Induction principle for Memory_Corres and Memory_Corres_eq
  • Induction principle for Memory_Corres and Memory_Corres_eq
  • Global environment management
  • Memory management

Library Rustre.Correctness.IsPresent

• Tying clock semantics and imperative semantics
  • Properties

Library Rustre.Correctness.Proper

• Setoid morphisms for translation

Library Rustre.Translation

• Translation
  • Identification of node instances
  • Translation
  • Properties

Library Rustre.Minimp

Library Rustre.Minimp.FuseIfte

Library Rustre.Minimp.Equiv

• Equivalence of Minimp programs

Library Rustre.Minimp.Semantics

• Minimp semantics
  • Determinism of semantics

Library Rustre.Minimp.Syntax

• Minimp syntax
  • Induction principle for exp
  • Decidable equality

Library Rustre.Dataflow

Library Rustre.Dataflow.NoDup

• No duplication of variables
  • Properties

Library Rustre.Dataflow.Ordered

• Ordering of nodes
  • Properties of Is_node_in
  • Properties of Ordered_nodes

Library Rustre.Dataflow.WellFormed.Decide

• Well formed CoreDF programs: decision procedure

Library Rustre.Dataflow.WellFormed

• Well formed CoreDF programs
  • Properties of Is_well_sch
  • Properties of Welldef_global

Library Rustre.Dataflow.MemSemantics

• The CoreDF+Memory semantics
  • Induction principle for msem_equation and msem_node
  • Properties
    • Equation non-activation
    • Environment cons-ing lemmas
    • Memory management
  • Fundamental theorem

Library Rustre.Dataflow.Semantics

• The CoreDF semantics
  • Environment and history
  • Instantaneous semantics
  • Liftings of instantaneous semantics
  • Time-dependent semantics
  • Induction principle for sem_node and sem_equation
  • Determinism of the semantics
    • Instantaneous semantics
    • Lifted semantics
  • Properties of the global environment
  • Clocking property
  • Presence and absence in non-empty lists

Library Rustre.Dataflow.Clocking.Properties

Library Rustre.Dataflow.Clocking.Parents

Library Rustre.Dataflow.Clocking

• Well clocked programs
  • Basic properties of clocking

Library Rustre.Dataflow.Memories

• Collecting memory cells
  • Properties

Library Rustre.Dataflow.IsDefined.Decide

• Defined variables : decision procedure
  • Properties

Library Rustre.Dataflow.IsDefined

• Defined variables
  • Properties

Library Rustre.Dataflow.IsVariable.Decide

• Stack variables: decision procedure
  • Properties

Library Rustre.Dataflow.IsVariable

• Stack variables
  • Properties

Library Rustre.Dataflow.IsFree.Decide

• Free variables: decision procedure
• Specification lemmas

Library Rustre.Dataflow.IsFree

• Free variables

Library Rustre.Dataflow.Syntax

• The CoreDF dataflow language
  • Clocks
  • Expressions
  • Control expressions
  • Equations
  • Node
  • Program
  • Properties

Library Rustre.Dataflow.Stream

• Extensional model of synchronous streams
  • Datatypes
  • Synchronous functions
  • Properties

Library Rustre.Nelist

• Non-empty lists
  • Datatype
  • Operations
  • Predicates
  • Properties
    • About length
    • About nelist2list
    • About map
    • About Forall
    • About Exists
    • About NoDup

Library Rustre.Example

Library Rustre.Common

• Common definitions
  • Finite sets and finite maps
  • Basic types supported by CoreDF:
  • Universe for typed signatures
  • Properties
    • About identifiers
    • About basic types
    • About operators
    • About Coq stdlib