A Contract-Based Approach to Scheduling and Verification of Dynamic Dataflow Networks

Jonatan Wiik, Johan Ersfolk, Marina Walden

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKonferenssiartikkeliTieteellinenvertaisarvioitu

2 Sitaatiot (Scopus)

Abstrakti

Restricted dataflow models of computation have gained widespread adoption in the safety-critical and real-time domains. As more complex functionality is being incorporated in embedded systems, there is a need for more expressive languages while maintaining high analysability. We present a contract-based approach to specification, scheduling and verification of dynamic dataflow networks. The approach is based on finding static schedules based on contracts and utilising this information in the verification process to reduce the number of invariant annotations needed. Moreover, we show that contracts can be used to make compile-time scheduling decisions, hence, improving runtime performance.

AlkuperäiskieliEi tiedossa
Otsikko2018 16th ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE 2018)
ToimittajatDerler Patricia, Gao Sicun
KustantajaIEEE
Sivut1–10
ISBN (elektroninen)978-1-5386-6195-6
ISBN (painettu)978-1-5386-6196-3
DOI - pysyväislinkit
TilaJulkaistu - 2018
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
Tapahtuma16th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE2018) - 16th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE2018)
Kesto: 15 lokakuuta 201817 lokakuuta 2018

Konferenssi

Konferenssi16th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE2018)
Ajanjakso15/10/1817/10/18

Keywords

  • Dataflow programming
  • Design-by-Contract
  • Formal verification
  • Quasi-static scheduling

Viittausmuodot