Formal Methods Meet Domain Specific Languages

In this paper, we relate an experiment whose aim is to study how to combine two existing approaches for ensuring software correctness: Domain Specific Languages (DSLs) and formal methods. As examples, we consider the Bossa DSL and the B formal method. Bossa is dedicated to the development of process...

Full description

Saved in:
Bibliographic Details
Published inIntegrated Formal Methods pp. 187 - 206
Main Authors Bodeveix, Jean-Paul, Filali, Mamoun, Lawall, Julia, Muller, Gilles
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Computer science; control theory; systems
decision procedure
DSL
Exact sciences and technology
formal methods
refinements
scheduling
Software
Software engineering
Formal method
Refinement method
Domain specific language
UNIX system
Scheduling
Rail transportation
Linux system
Program verification
Online AccessGet full text

Cover

More Information
Summary:In this paper, we relate an experiment whose aim is to study how to combine two existing approaches for ensuring software correctness: Domain Specific Languages (DSLs) and formal methods. As examples, we consider the Bossa DSL and the B formal method. Bossa is dedicated to the development of process schedulers and has been used in the context of Linux and Chorus. B is a refinement based formal method which has especially been used in the domain of railway systems. In this paper, we use B to express the correctness of a Bossa specification. Furthermore, we show how B can be used as an alternative to the existing Bossa tools for the production of certified schedulers.
ISBN:3540304924
9783540304920
ISSN:0302-9743
1611-3349
DOI:10.1007/11589976_12