Paper Info
Title
Compiling ARGOS into Boolean Equations
Abstract
In most imperative synchronous languages (Esterel, Argos, Statecharts,...), the semantics of the control structures may be conveniently described as compositions of Mealy machines. This constitutes the usual formal semantics of Argos, for instance, where basic components are Mealy machines. On the other hand, the compilation process should not be based upon an explicit generation of the Mealy machine that represents the behaviour of the whole program, because this machine may have a very large number of states. Hence we try to perform a symbolic compilation into a Mealy machine implicitly represented by a set of Boolean equations.
Year
DOI
Venue
1996
10.1007/3-540-61648-9_35
FTRTFT
Keywords
Field
DocType
boolean equations,compiling argos,formal semantics,control structure
Formal semantics (linguistics),Programming language,Computer science,Large numbers,Boolean algebra,Esterel,Mealy machine,True quantified Boolean formula,Boolean expression,Semantics
Conference
Volume
ISSN
ISBN
1135
0302-9743
3-540-61648-9
Citations 
PageRank 
References 
13
1.59
7
Authors
2
Name
Order
Citations
PageRank
Florence Maraninchi157153.43
Nicolas Halbwachs23957426.43