| H. Kirchner and C. Ringeissen. Executing CASL Equational Specifications with the ELAN Rewrite Engine. Note T-9 in [5], November ####. |
....in the CCS agents is given by rewriting of closed terms. This choice is justified since it is suitable to an operational semantics. The rewriting is performed using a set R of rewrite rules deduced from the CASL specifications. This can be achieved following the conceptual steps defined in [32], which is rather devoted to tools; nevertheless this shows how rewriting of CASL terms can be done. In [32] Ringeissen and Kirchner wish to execute CASL equational specifications with the ELAN rewrite engine [8] Both basic and structured specifications are considered, even though some ....
....to an operational semantics. The rewriting is performed using a set R of rewrite rules deduced from the CASL specifications. This can be achieved following the conceptual steps defined in [32] which is rather devoted to tools; nevertheless this shows how rewriting of CASL terms can be done. In [32], Ringeissen and Kirchner wish to execute CASL equational specifications with the ELAN rewrite engine [8] Both basic and structured specifications are considered, even though some restrictions are assumed (subsorting and partiality features) The translation from CASL to ELAN is performed using ....
[Article contains additional citation context not shown here]
H. Kirchner and C. Ringeissen. Executing CASL Equational Specifications with the ELAN Rewrite Engine. Note T-9 in [14], November 2000.
....good basis for prototyping (parts of) Casl specifications. For instance, the ELAN compiler [39] efficiently supports many sorted conditional rewrite rules with associative commutative functions. We have connected ELAN to the HOL CASL parser in order to execute a large class of Casl specifications [38]. Various verification tools have already been developed for algebraic specifications, and can be reused for specific subsets of Casl: equational, conditional, full first order logic with total functions, total functions with subsorts, partial functions, etc. The systems KIV [56] and INKA 5.0 [6, ....
H. Kirchner and C. Ringeissen. Executing Casl equational specifications with the elan rewrite engine. Note T-9, in [24], presented at WADT'99, Bonas, 1999.
....supports many sorted conditional rewrite rules with associative commutative functions. A first prototype has been realised that reads in the FCasEnv format, and translates it into EFix format (ATerms for ELAN) which can then be executed by the ELAN interpreter or compiled to produce C code [38]. The standalone version of CATS also contains an encoding into several other logics. The encoding transforms a Casl specification into second order logic step by step. First, partiality is encoded via error elements living in a supersort; second, subsorting is encoded via injections; and third, ....
Helene Kirchner and Christophe Ringeissen. Executing Casl Equational Specifications with the ELAN Rewrite Engine. Note T-9, in [18], October 1999.
No context found.
H. Kirchner and C. Ringeissen. Executing CASL Equational Specifications with the ELAN Rewrite Engine. Note T-9 in [5], November ####.
No context found.
H'el`ene Kirchner and Christophe Ringeissen. Executing CASL equational specifications with the ELAN rewrite engine. Technical Report 99-R-278, LORIA, Nancy, France, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC