H. Barringer, G. Gough, B. Monahan, and A. Williams. A Process Algebra Foundation for Reasoning about Core ELLA. Technical Report UMCS-94-12-1, University of Manchester, December 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The ELLA Verification Environment: A Tutorial Introduction - Barringer, al. (1994) (2 citations) (Correct)
....structure to those used in ELLA, which in many cases can in fact be reflected back into corresponding ELLA expressions. However, in this tutorial you are also invited to inspect the underlying EPA terms, to demonstrate how they are used in this case to represent symbolic state machines. Refer to [BGMW94a, BGMW94c] for details about EPA and the semantics of ELLA. 4.2 Symbolic Simulation 15 #Process del.DELAND:# PROCESS del.DELAND( ch 17: 2]bool ch 3:bool) NORMAL FORM CHOICE ARGS: N 10 in [2]bool) INPUTS: ch 17(N 10) OUTPUTS: ch 3(del 3) NEXT STATE: STV 2:bool : f = and 5, LETS: ....
H. Barringer, G. Gough, B. Monahan, and A. Williams. A Process Algebra Foundation for Reasoning about Core ELLA. Technical Report UMCS-94-12-1, Department of Computer Science, University of Manchester, December 1994. Available on the WWW, URL: http://www.cs.man.ac.uk/csonly/cstechrep/Abstracts/UMCS-94-12-1.html.
The State Evolution Method for Verifying Hardware Systems - Barringer, Gough.. (1995) (1 citation) Self-citation (Barringer Gough Monahan Williams) (Correct)
....methods expertise. A second requirement is that the verification tool can provide structured debugging information at the ELLA level, when designs are found to be different. The methods described in this paper fulfil many of these requirements. An overview of work from the project appears in [5] 2 . Background to the work presented here is found in Milner s work on CCS and bisimilarity[1] More recently, Hennessy[6] has developed techniques for modelling infinite data spaces and constructing their bisimulations; the VPAM system[7] is somewhat similar to our approach of proving ....
....been implemented in Common Lisp, and installed into a design and verification environment[20] developed 4 for the commercial hardware description language ELLA. To check the equivalence of ELLA designs, they are first compiled into deterministic machines, according to the formal semantics of ELLA[5]. The VCG then constructs the logical expressions for the premises of the state evolution rule the user supplies the number of steps required It then converts the function expressions representing the machines into functional normal form and merges the resulting elements for each control ....
H. Barringer, G. Gough, B. Monahan, and A. Williams. A Process Algebra Foundation for Reasoning about Core ELLA. Technical Report UMCS-94-12-1, University of Manchester, December 1994.
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