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

Jonatan Wiik, Johan Ersfolk, Marina Walden

Forskningsoutput: Kapitel i bok/konferenshandlingKonferensbidragVetenskapligPeer review

2 Citeringar (Scopus)

Sammanfattning

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.

OriginalspråkOdefinierat/okänt
Titel på gästpublikation2018 16th ACM/IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE 2018)
RedaktörerDerler Patricia, Gao Sicun
FörlagIEEE
Sidor1–10
ISBN (elektroniskt)978-1-5386-6195-6
ISBN (tryckt)978-1-5386-6196-3
DOI
StatusPublicerad - 2018
MoE-publikationstypA4 Artikel i en konferenspublikation
Evenemang16th 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)
Varaktighet: 15 okt 201817 okt 2018

Konferens

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

Nyckelord

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

Citera det här