The Experts below are selected from a list of 12765 Experts worldwide ranked by ideXlab platform

Chouki Tibermacine - One of the best experts on this subject based on the ideXlab platform.

  • Multi-paradigm Architecture Constraint Specification and Configuration Based on Graphs and Feature Models
    SOFSEM 2018: Theory and Practice of Computer Science, 2018
    Co-Authors: Sahar Kallel, Ahmed Hadj Kacem, Chouki Tibermacine, Christophe Dony
    Abstract:

    Currently, architecture Constraints can be specified and checked in different paradigms of software development, the object-oriented, component-based and service-based one. But the current state of the art and practice do not consider their Specification at a high level of abstraction, independently from any paradigm vocabulary. We propose in this paper a process combining graphs and feature modeling to specify multi-paradigm architecture Constraints. These Constraints are expressed with OCL on a particular meta-model of graphs. Then these Constraints can be transformed to any chosen paradigm, after their configuration using a feature/variability model. This transformation allows later to handle these Constraints in that (chosen) paradigm: to refine them, to generate source code from them, and to check them on models and on source code. A case study is presented in this paper; it concerns architecture Constraint Specification and configuration under software migration from the object-oriented to the component-based paradigm.

  • SOFSEM - Multi-paradigm Architecture Constraint Specification and Configuration Based on Graphs and Feature Models
    SOFSEM 2018: Theory and Practice of Computer Science, 2017
    Co-Authors: Sahar Kallel, Chouki Tibermacine, Ahmed Hadj Kacem, Christophe Dony
    Abstract:

    Currently, architecture Constraints can be specified and checked in different paradigms of software development, the object-oriented, component-based and service-based one. But the current state of the art and practice do not consider their Specification at a high level of abstraction, independently from any paradigm vocabulary. We propose in this paper a process combining graphs and feature modeling to specify multi-paradigm architecture Constraints. These Constraints are expressed with OCL on a particular meta-model of graphs. Then these Constraints can be transformed to any chosen paradigm, after their configuration using a feature/variability model. This transformation allows later to handle these Constraints in that (chosen) paradigm: to refine them, to generate source code from them, and to check them on models and on source code. A case study is presented in this paper; it concerns architecture Constraint Specification and configuration under software migration from the object-oriented to the component-based paradigm.

  • A family of languages for architecture Constraint Specification
    Journal of Systems and Software, 2010
    Co-Authors: Chouki Tibermacine, Régis Fleurquin, Salah Sadou
    Abstract:

    During software development, architecture decisions should be documented so that quality attributes guaranteed by these decisions and required in the software Specification could be persisted. An important part of these architectural decisions is often formalized using Constraint languages which differ from one stage to another in the development process. In this paper, we present a family of architectural Constraint languages, called ACL. Each member of this family, called a profile, can be used to formalize architectural decisions at a given stage of the development process. An ACL profile is composed of a core Constraint language, which is shared with the other profiles, and a MOF architecture metamodel. In addition to this family of languages, this paper introduces a transformation-based interpretation method of profiles and its associated tool.

Frédéric Mallet - One of the best experts on this subject based on the ideXlab platform.

  • SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language
    2019
    Co-Authors: Min Zhang, Frédéric Mallet, Fu Song, Chen Xiaohong
    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.

  • FASE - SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language
    Fundamental Approaches to Software Engineering, 2019
    Co-Authors: Min Zhang, Frédéric Mallet, Fu Song, Xiaohong Chen
    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.

  • From Logical Time Scheduling to Real-Time Scheduling
    2018
    Co-Authors: Frédéric Mallet, Min Zhang
    Abstract:

    Scheduling is a central yet challenging problem in real-time embedded systems. The Clock Constraint Specification Language (CCSL) provides a formalism to specify logical Constraints of events in real-time embedded systems. A prerequisite for the events is that they must be schedulable under Constraints. That is, there must be a schedule which controls all events to occur infinitely often. Schedulability analysis of CCSL raises important algorithmic problems such as computational complexity and design of efficient decision procedures. In this work, we compare the scheduling problems of CCSL Specifications to the real-time scheduling problem. We show how to encode a simple task model in CCSL and discuss some benefits and differences compared to more classical scheduling strategies.

  • FTSCS - An Executable Semantics of Clock Constraint Specification Language and Its Applications
    Communications in Computer and Information Science, 2016
    Co-Authors: Min Zhang, Frédéric Mallet
    Abstract:

    The Clock Constraint Specification Language (ccsl) is a language to specify logical and timed Constraints between logical clocks. Given a set of clock Constraints specified in ccsl, formal analysis is preferred to check if there exists a schedule that satisfies all the Constraints, if the Constraints are valid or not, and if the Constraints satisfy expected properties. In this paper, we present a formal executable semantics of ccsl in rewriting logic and demonstrate some applications of the formal semantics to its formal analysis: (1) to automatically find bounded or periodic schedules that satisfy all the given Constraints; (2) to simulate the execution of schedules with customized simulation policies; and (3) to verify LTL properties of ccsl Constraints by bounded model checking. Compared with other existing modeling approaches, advantages with the rewriting-based semantics of ccsl are that we do not need to assume a bounded number of steps for the formalization, and we can exhaustively explore all the solutions within a given bound for the analysis.

  • An Executable Semantics of Clock Constraint Specification Language and its Applications
    2015
    Co-Authors: Min Zhang, Frédéric Mallet
    Abstract:

    The Clock Constraint Specification Language (ccsl) is a language to specify logical and timed Constraints between logical clocks. Given a set of clock Constraints specified in ccsl, formal analysis is preferred to check if there exists a schedule that satisfies all the Constraints, if the Constraints are valid or not, and if the Constraints satisfy expected properties. In this paper, we present a formal executable semantics of ccsl in rewriting logic and demonstrate some applications of the formal semantics to its formal analysis: 1) to automatically find bounded or periodic schedules that satisfy all the given Constraints; 2) to simulate the execution of schedules with customized simulation policies; and 3) to verify LTL properties of ccsl Constraints by bounded model checking. Compared with other existing modeling approaches, advantages with the rewriting-based semantics of ccsl are that we do not need to assume a bounded number of steps for the formalization, and we can exhaustively explore all the solutions within a given bound for the analysis.

Christophe Dony - One of the best experts on this subject based on the ideXlab platform.

  • Multi-paradigm Architecture Constraint Specification and Configuration Based on Graphs and Feature Models
    SOFSEM 2018: Theory and Practice of Computer Science, 2018
    Co-Authors: Sahar Kallel, Ahmed Hadj Kacem, Chouki Tibermacine, Christophe Dony
    Abstract:

    Currently, architecture Constraints can be specified and checked in different paradigms of software development, the object-oriented, component-based and service-based one. But the current state of the art and practice do not consider their Specification at a high level of abstraction, independently from any paradigm vocabulary. We propose in this paper a process combining graphs and feature modeling to specify multi-paradigm architecture Constraints. These Constraints are expressed with OCL on a particular meta-model of graphs. Then these Constraints can be transformed to any chosen paradigm, after their configuration using a feature/variability model. This transformation allows later to handle these Constraints in that (chosen) paradigm: to refine them, to generate source code from them, and to check them on models and on source code. A case study is presented in this paper; it concerns architecture Constraint Specification and configuration under software migration from the object-oriented to the component-based paradigm.

  • SOFSEM - Multi-paradigm Architecture Constraint Specification and Configuration Based on Graphs and Feature Models
    SOFSEM 2018: Theory and Practice of Computer Science, 2017
    Co-Authors: Sahar Kallel, Chouki Tibermacine, Ahmed Hadj Kacem, Christophe Dony
    Abstract:

    Currently, architecture Constraints can be specified and checked in different paradigms of software development, the object-oriented, component-based and service-based one. But the current state of the art and practice do not consider their Specification at a high level of abstraction, independently from any paradigm vocabulary. We propose in this paper a process combining graphs and feature modeling to specify multi-paradigm architecture Constraints. These Constraints are expressed with OCL on a particular meta-model of graphs. Then these Constraints can be transformed to any chosen paradigm, after their configuration using a feature/variability model. This transformation allows later to handle these Constraints in that (chosen) paradigm: to refine them, to generate source code from them, and to check them on models and on source code. A case study is presented in this paper; it concerns architecture Constraint Specification and configuration under software migration from the object-oriented to the component-based paradigm.

Sahar Kallel - One of the best experts on this subject based on the ideXlab platform.

  • Multi-paradigm Architecture Constraint Specification and Configuration Based on Graphs and Feature Models
    SOFSEM 2018: Theory and Practice of Computer Science, 2018
    Co-Authors: Sahar Kallel, Ahmed Hadj Kacem, Chouki Tibermacine, Christophe Dony
    Abstract:

    Currently, architecture Constraints can be specified and checked in different paradigms of software development, the object-oriented, component-based and service-based one. But the current state of the art and practice do not consider their Specification at a high level of abstraction, independently from any paradigm vocabulary. We propose in this paper a process combining graphs and feature modeling to specify multi-paradigm architecture Constraints. These Constraints are expressed with OCL on a particular meta-model of graphs. Then these Constraints can be transformed to any chosen paradigm, after their configuration using a feature/variability model. This transformation allows later to handle these Constraints in that (chosen) paradigm: to refine them, to generate source code from them, and to check them on models and on source code. A case study is presented in this paper; it concerns architecture Constraint Specification and configuration under software migration from the object-oriented to the component-based paradigm.

  • SOFSEM - Multi-paradigm Architecture Constraint Specification and Configuration Based on Graphs and Feature Models
    SOFSEM 2018: Theory and Practice of Computer Science, 2017
    Co-Authors: Sahar Kallel, Chouki Tibermacine, Ahmed Hadj Kacem, Christophe Dony
    Abstract:

    Currently, architecture Constraints can be specified and checked in different paradigms of software development, the object-oriented, component-based and service-based one. But the current state of the art and practice do not consider their Specification at a high level of abstraction, independently from any paradigm vocabulary. We propose in this paper a process combining graphs and feature modeling to specify multi-paradigm architecture Constraints. These Constraints are expressed with OCL on a particular meta-model of graphs. Then these Constraints can be transformed to any chosen paradigm, after their configuration using a feature/variability model. This transformation allows later to handle these Constraints in that (chosen) paradigm: to refine them, to generate source code from them, and to check them on models and on source code. A case study is presented in this paper; it concerns architecture Constraint Specification and configuration under software migration from the object-oriented to the component-based paradigm.

Min Zhang - One of the best experts on this subject based on the ideXlab platform.

  • SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language
    2019
    Co-Authors: Min Zhang, Frédéric Mallet, Fu Song, Chen Xiaohong
    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.

  • FASE - SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language
    Fundamental Approaches to Software Engineering, 2019
    Co-Authors: Min Zhang, Frédéric Mallet, Fu Song, Xiaohong Chen
    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.

  • From Logical Time Scheduling to Real-Time Scheduling
    2018
    Co-Authors: Frédéric Mallet, Min Zhang
    Abstract:

    Scheduling is a central yet challenging problem in real-time embedded systems. The Clock Constraint Specification Language (CCSL) provides a formalism to specify logical Constraints of events in real-time embedded systems. A prerequisite for the events is that they must be schedulable under Constraints. That is, there must be a schedule which controls all events to occur infinitely often. Schedulability analysis of CCSL raises important algorithmic problems such as computational complexity and design of efficient decision procedures. In this work, we compare the scheduling problems of CCSL Specifications to the real-time scheduling problem. We show how to encode a simple task model in CCSL and discuss some benefits and differences compared to more classical scheduling strategies.

  • towards smt based ltl model checking of clock Constraint Specification language for real time and embedded systems
    Languages Compilers and Tools for Embedded Systems, 2017
    Co-Authors: Min Zhang, Yunhui Ying
    Abstract:

    The Clock Constraint Specification Language (CCSL) is a formal language companion to MARTE (shorthand for Modeling and Analysis of Real-Time and Embedded systems), a UML profile used to facilitate the design and analysis of real-time and embedded systems. CCSL is proposed to specify Constraints on the occurrences of events in systems. However, the language lacks efficient verification support to formally analyze temporal properties, which are important properties to real-time and embedded systems. In this paper, we propose an SMT-based approach to model checking of the temporal properties specified in Linear Temporal Logic (LTL) for CCSL by transforming CCSL Constraints and LTL formulas into SMT formulas. We implement a prototype tool for the proposed approach and use the state-of-the-art tool Z3 as its underlying SMT solver. We model two practical real-time and embedded systems, i.e., a traffic light controller and a power window system in CCSL , and model check LTL properties of them using the proposed approach. Experimental results demonstrate the effectiveness and efficiency of our approach.

  • LCTES - Towards SMT-based LTL model checking of clock Constraint Specification language for real-time and embedded systems
    Proceedings of the 18th ACM SIGPLAN SIGBED Conference on Languages Compilers and Tools for Embedded Systems, 2017
    Co-Authors: Min Zhang, Yunhui Ying
    Abstract:

    The Clock Constraint Specification Language (CCSL) is a formal language companion to MARTE (shorthand for Modeling and Analysis of Real-Time and Embedded systems), a UML profile used to facilitate the design and analysis of real-time and embedded systems. CCSL is proposed to specify Constraints on the occurrences of events in systems. However, the language lacks efficient verification support to formally analyze temporal properties, which are important properties to real-time and embedded systems. In this paper, we propose an SMT-based approach to model checking of the temporal properties specified in Linear Temporal Logic (LTL) for CCSL by transforming CCSL Constraints and LTL formulas into SMT formulas. We implement a prototype tool for the proposed approach and use the state-of-the-art tool Z3 as its underlying SMT solver. We model two practical real-time and embedded systems, i.e., a traffic light controller and a power window system in CCSL , and model check LTL properties of them using the proposed approach. Experimental results demonstrate the effectiveness and efficiency of our approach.