Modular Compilation of a Synchronous Language
نویسندگان
چکیده
Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing the reliability of systems, especially those which are safety or business critical. It is still difficult to develop automatic specification and verification tools due to limitations like state explosion, undecidability, etc... In this work, we design a new specification model based on a reactive synchronous approach. Then, we benefit from a formal framework well suited to perform compilation and formal validation of systems. In practice, we design and implement a special purpose language (LE ) and its two semantics : the behavioral semantics helps us to define a program by the set of its behaviors and avoid ambiguousness in programs’ interpretation; the execution equational semantics allows the modular compilation of programs into software and hardware targets (C code, Vhdl code, Fpga synthesis, Verification tools). Our approach is pertinent considering the two main requirements of critical realistic applications : the modular compilation allows us to deal with large systems, the model-driven approach provides us with formal validation. keywords: model-driven language, synchronous models, compilation, modularity, verification Annie Ressouche INRIA Sophia Antipolis Méditerranée 2004 route des Lucioles BP 93 06902 Sophia Antipolis, FRANCE, e-mail: [email protected] Daniel Gaffe LEAT Laboratory, Univ of Nice Sophia Antipolis CNRS 250 rue Albert Einstein 06560 Valbonne France, e-mail: [email protected] Valérie Roy CMA Ecole des Mines Sophia Antipolis France, e-mail: [email protected] 1 in ria -0 05 23 52 8, v er si on 1 5 O ct 2 01 0 Author manuscript, published in "Software Engineering Research, Management and Applications Springer (Ed.) (2008) 151-171" DOI : 10.1007/978-3-540-70561-1 2 Annie Ressouche and Daniel Gaffé and Valérie Roy
منابع مشابه
Distributing Synchronous Programs Using Bounded Queues, a coordinated traffic signal application
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [10] across networks using bounded FIFO queues. The problem is first addressed mathematically. Then, based on these formal results, a software library for the modular compilation and distribution of Simulink program is given. The performance the library is given. The value of synchronous programming...
متن کاملUsing Modular Pole for Multi-Objective Design Optimization of a Linear Permanent Magnet Synchronous Motor by Particle Swarm Optimization (PSO)
In this paper particle swarm optimization (PSO) is used for a design optimization of a linear permanent magnet synchronous motor (LPMSM) considering ultra low thrust force ripples, low magnet consumption, improved efficiency and thrust. The influence of PM material is discussed, too and the modular poles are proposed to achieve the best characteristic. PM dimensions and material, air gap and mo...
متن کاملAn ML-Like Module System for the Synchronous Language SIGNAL
Synchronous languages such as Signal are best suited for the design of dependable real time systems Synchronous languages enable a very high level speci cation and an extremely modular implementation of com plex systems by structurally decomposing them into elementary synchronous processes Separate compilation in reactive languages is however made a dif cult issue by global safety requirements ...
متن کاملCompositional synthesis of latency-insensitive systems from multi-clocked synchronous specifications
We consider the problem of synthesizing correct-by-construction globally asynchronous, locally synchronous (GALS) implementations from modular synchronous specifications. This involves the synthesis of asynchronous wrappers that drive the synchronous clocks of the modules and perform input reading in such a fashion as to preserve, in a certain sense, the global properties of the system. Our app...
متن کاملModular Compilation of Synchronous Programs
We present a new method for modular compilation of synchronous programs given in imperative languages like Quartz or Esterel. The main idea of our approach consists of computing sequential jobs that correspond with control flow locations of the program. Each job encodes that part of an instantaneous reaction that is triggered by the activation of the corresponding control flow location. The spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0801.3715 شماره
صفحات -
تاریخ انتشار 2008