Abstract:

We present the architecture and functioning principles of the CAESAR.ADT compiler. CAESAR.ADT (automatically) translates a subset of the data part of LOTOS into executable C code. The class of accepted LOTOS programs is very similar to the class of "computable data types" described by Charles Pecheur. LOTOS sorts are translated into C types using algorithms that can select efficient data representations for common types such as enumerated types, records, integers, etc. LOTOS operations are translated into C functions using a pattern- matching compiling algorithm proposed by Schnoebelen, which compiles the equations into deterministic C code (basically "if-then-else's" and recursive function calls). We present the successive mutations of the compiler since 1988, its applicability to large-size case studies, and the on-going developments.