SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language

Abstract

The Clock Constraint Specification Language (CCSL) is a formalism for specifying logical-time constraints on events for the design of real-time embedded systems. A central verification problem of CCSL is to check whether events are schedulable under logical constraints. Although many efforts have been made addressing this problem, the problem is still open. In this paper, we show that the bounded scheduling problem is NP-complete and then propose an efficient SMT-based decision procedure which is sound and complete. Based on this decision procedure , we present a sound algorithm for the general scheduling problem. We implement our algorithm in a prototype tool and illustrate its utility in schedulability analysis in designing real-world systems and automatic proving of algebraic properties of CCSL constraints. Experimental results demonstrate its effectiveness and efficiency.
Fichier principal
Vignette du fichier
paper_30.pdf (462.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02080763 , version 1 (27-03-2019)

Licence

Attribution

Identifiers

Cite

Min Zhang, Fu Song, Frédéric Mallet, Xiaohong Chen. SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language. FASE 2019 - Fundamental Approaches to Software Engineering, Apr 2019, Prague, Czech Republic. pp.61-78, ⟨10.1007/978-3-030-16722-6_4⟩. ⟨hal-02080763⟩
133 View
232 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More