Fischer, C.: Combination and Implementation of Processes and Data: from CSPOZ to Java. PhD thesis, Fachbereich Informatik Universitt Oldenburg, 2000  Home/Search   Document Details and Download   Summary   Related Articles   Check

....so that FM technology transfer can be successful. Z [21, 25] is a state based formal specification language and has an active research community. Object Z [6, 10, 19] is an object oriented extension to Z. The integration of Object Z with process algebra like CSP has been a recent research focus [12, 20, 17]. In this paper, using eXtensible Markup Language (XML) 23] we develop web environment and browsing facilities for Z family languages. Then, we introduce techniques for projecting (object oriented) Z models to UML diagrams, which are based XML Metadata Interchange (XMI) 1] The remainder of ....

C. Fischer. Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, University of Oldenburg, Gemany, January 2000.

....the context of the blocking and the non blocking semantic model. The translation within the context of the blocking semantic model, reported in [BDW99] was originally presented in [Bol98] with the intention of formally proving a result that was being propagated through the literature [SD97, Fis00, DB01] that data refinement, within this model, is equivalent to stable failures refinement. We proved that this result holds for data types with a single operation and, incorrectly, concluded that it holds in the general case. In this chapter we correct the erroneous result of [BDW99] showing ....

....we now investigate the relationship between data refinement and process refinement. We prove first the surprising and important result that data refinement is not equivalent to stable failures refinement. This result is surprising in that it contradicts results in the literature [SD97, BDW99, Fis00, DB01] and important in that it was the catalyst that caused us to investigate the properties of data refinement and to propose the singleton failures refinement ordering. We then prove that data refinement is equivalent to singleton failures refinement. We prove that data refinement is not ....

[Article contains additional citation context not shown here]

C. Fischer. Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, University of Oldenburg, 2000.

....work was financially supported by CNPq grant 143720 98 8. in a slightly different manner than approaches available in the literature. More specifically, our approach is based on Lazi s work [26] to model checking data independent CSP processes and Wehrheim s work [13,14] to data abstracting CSPoz [8] (a combination of CSP and Object Z) although we concentrate on CSPz [7,8] an integration of CSP and Z) The reason to use Wehrheim s approach instead of, for example, the ones proposed in [24,9] is that her approach already uses a CSP algebraic style which is very convenient for using FDR ....

....different manner than approaches available in the literature. More specifically, our approach is based on Lazi s work [26] to model checking data independent CSP processes and Wehrheim s work [13,14] to data abstracting CSPoz [8] a combination of CSP and Object Z) although we concentrate on CSPz [7,8] (an integration of CSP and Z) The reason to use Wehrheim s approach instead of, for example, the ones proposed in [24,9] is that her approach already uses a CSP algebraic style which is very convenient for using FDR [12] Wehrheim s work can be seen as a CSP view of other approaches [24,9] ....

[Article contains additional citation context not shown here]

C.Fischer. Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, Fachbereich Informatik Universit/it Oldenburg, 2000.

....it does catch exceptions and allows for exception speci cation in addition to simple contracts. Jass [7] is a similar system, but adds enough bookkeeping so that it does not check assertions in methods that are called in conditions located in other methods. It also has just added trace assertions [15] as class invariants to specify valid method call sequences. Trace assertions are written separately from the conditions. They can express repetition, disjunction, and conjunction of traces and even control and data dependence on arbitrary predicates of the program state. Contract Java [14] tries ....

Clemens Fischer. Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, University of Oldenburg, January 2000.

....temporal logics. Our solution in Jass was the use of a CSP process in the class invariant that describes allowed traces and is therefore called trace assertion. But the expressiveness of Jass trace assertions was limited to a special subset of Java classes that are obtained when translating CSP OZ [8,7] speci cations to Java skeletons. Trace assertions were always bound to a single object instance so that static methods were not covered and other instances were only partially supported. A new trace assertion facility was implemented as a prototype in the jassda framework with the ....

....Interface to receive events, i.e. monitor the Java program on its own virtual machine, and thus no modi cation is performed on the system under test. Jass was implemented as part of three master s theses [18,2,21] and is available free of charge . The general ideas have been developed in [8], which also gives a formal semantics to Jass. The jassda framework and the Trace Checker were implemented as part of a fourth master s thesis [4] which also gives some operational semantics to the CSP dialect for deriving the implementation. 2 Syntax The design of our speci cation language ....

C. Fischer. Combination and Implementation of Processes and Data: From CSPOZ to Java. PhD thesis, University of Oldenburg, 2000.

....temporal logics. Our solution in Jass was the use of a CSP process in the class invariant that describes allowed traces and is therefore called trace assertion. But the expressiveness of Jass trace assertions was limited to a special subset of Java classes that are obtained when translating CSP OZ [8,7] specifications to Java skeletons. Trace assertions were always bound to a single object instance so that static methods were not covered and other instances were only partially supported. A new trace assertion facility was implemented as a prototype in the jassda framework with the ....

....Interface to receive events, i.e. monitor the Java program on its own virtual machine, and thus no modification is performed on the system under test. Jass was implemented as part of three master s theses [18,2,21] and is available free of charge . The general ideas have been developed in [8], which also gives a formal semantics to Jass. The jassda framework and the Trace Checker were implemented as part of a fourth master s thesis [4] which also gives some operational semantics to the CSP dialect for deriving the implementation. 2 Syntax The design of our specification language ....

C. Fischer. Combination and Implementation of Processes and Data: From CSPOZ to Java. PhD thesis, University of Oldenburg, 2000.

....that a program may emit during its execution. We chose CSP as specification language for two reasons: First, CSP is not new so that many people put research power into it, that we can now profit from. Second, our main research interest is the step from a formal specification given in CSP OZ [4, 5], which is a combination of CSP [7] and Object Z, to Java, and therefore it is natural to use CSP. Since Java allows threads and (of course) multiple instances of a class, the exact specification of an event is not easy and in most cases not what we want. Therefore CSP jassda uses event sets ....

....As further perspective we will work on the tool itself. We plan to add more operators and to make the specification language more comfortable. These extensions should lead us to be able to specify trace assertions that help us to check Java programs against formal specifications written in CSP OZ [4, 5]. The goal is a mainly automated tool that will translate CSP OZ to CSP jassda and JML [12] specifications preserving the semantics. Acknowledgments We would like to thank the members of the Semantics Group and especially Jochen Hoenicke for a lot of interesting and productive discussions that ....

C. Fischer. Combination and Implementation of Processes and Data: From CSP-OZ to Java. PhD thesis, University of Oldenburg, 2000.

....The Approach to Speci cation and Validation The approach to formally specify and validate the SACI 1 OBC includes the proposal of Timed CSP Z [She00, SSC01] a speci cation language capable of expressing time, data and control using an integrated approach. The language Timed CSP Z extends CSP Z [Fis96, Fis00] with facilities to specify real time systems. The extension was achieved by substituting the CSP part of the language by Timed CSP [RR86] a version of CSP capable of expressing timed behavior) From the semantic point of view, while CSP Z is based on the Failure Divergence Model of CSP [Fis96] ....

C. Fischer. Combination and implementation of processes and data: from csp-oz to java. PhD thesis, University of Oldenburg, 2000.

....26111 Oldenburg, Germany hoenicke informatik.uni oldenburg.de Abstract. We use a combination of three techniques for the specification of processes, data and time: CSP, Object Z and Duration Calculus. Whereas the combination of CSP and Object Z is well established by the work of C. Fischer [2, 3], the integration with Duration Calculus is new. The combination is used to specify parts of a novel case study on radio controlled railway crossings. 1 Introduction Complex computing systems exhibit various behavioural aspects such as communication between components, state transformation ....

....StaticProfile is for storing the maximum speed and is not of interest here. The type seq TrackElement denotes finite sequences of TrackElement s. TrackAtlas staticprof : StaticProfile elems : seq TrackElement The data aspect has to interact with the communication aspect. The combination CSPOZ [2, 3] provides a simple mechanism to bind a communication to a OZ schema describing the effect to the data base. The following schema connects an action with the (internal) event clearDangerPosition. This event is not externally visible but is used to link the CSP and OZ parts. Whenever this event is ....

[Article contains additional citation context not shown here]

C. Fischer. Combination and Implementation of Processes and Data: From CSP-OZ to Java. PhD thesis, Bericht Nr. 2/2000, University of Oldenburg, April 2000.

No context found.

C. Fischer. Combination and Implementation of Processes and Data: From CSP-OZ to Java. PhD thesis, Bericht Nr. 2/2000, University of Oldenburg, April 2000.

....Design by Contract extensions: Sun is currently developing a simple assertion facility for Java [24] and tools like iContract [16] or specification languages like JML [ 17] or BSL [5] already allow for a rich set of assertions to be written into Java code. In this paper we present the tool Jass [10] which, besides the standard Design by Contract facilities like pre , postconditions and class invariants, additionally o#ers refinement checks and trace assertions. Trace assertions are used to monitor the dynamic behaviour of an object, the ordering of method invocations and calls in time. Thus ....

....Jass is influenced by the process algebra CSP [12] in the syntax of trace assertions a number of operators close to CSP operators appear. In fact, our ultimate goal is the generation of assertions from formal specifications, in our case, from specifications writ2 Bartetzko et al. ten in CSP OZ [10,9], a combination of Object Z and CSP. Trace assertions are a novel concept for Design by Contract and, to the best of our knowledge, none of the above mentioned tools 6 currently support a similar facility. Refinement checks are also inspired by an important design technique of formal methods. ....

[Article contains additional citation context not shown here]

Fischer, C., "Combination and Implementation of Processes and Data: From CSP-OZ to Java," Ph.D. thesis, University of Oldenburg (2000).

....articles on integration modelling in the Formal Specification Column. Differing from previous articles of the Column we will not propose an abstract integration paradigm or a metamodel here but discuss the semantic basis for one particular object oriented integrated formal method, namely CSP OZ [Fis97, Fis00]. CSP OZ is a formal method which combines the state oriented method Object Z [DRS95, Smi00] an object oriented extension of Z, 1 with the process algebra CSP [Ros97] The semantic basis for this combination is the failure divergence model of CSP. In this paper, we explain the design choices ....

....systems, for which CSP can be used as a modelling language. 3 Failure Divergence Semantics The reference model of [GR99] for integrated formalisms proposes to use abstract transition systems as the semantical basis for layer 2 specifications. Although this is also possible for CSP OZ [Fis00] (the transition system can then be the basis for deriving failures and divergences) we will directly discuss the failure divergence semantics here. The choice for a failure divergence semantics has several advantages. I The failure divergence model is the basis for defining three different ....

C. Fischer. Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, University of Oldenburg, 2000. to appear.

No context found.

Fischer, C.: Combination and Implementation of Processes and Data: from CSPOZ to Java. PhD thesis, Fachbereich Informatik Universitt Oldenburg, 2000

No context found.

Clemens Fischer. "Combination and Implementation of Processes and Data: from CSP-OZ to Java". PhD thesis, University of Oldenburg, Oldenburg, Germany (January 2000). Submitted.

No context found.

Clemens Fischer. Combination and implementation of processes and data: from CSP-OZ to Java. PhD thesis, report of the Comp. Sce. dept. 2/2000.

No context found.

C. Fischer. Combination and implementation of processes and data: from CSP-OZ to Java. PhD thesis, University of Oldenburg, January 2000.

No context found.

Clemens Fischer. Combination and implementation of processes and data: from CSP-OZ to Java. PhD thesis, report of the Comp. Sce. dept. 2/2000, University of Oldenburg, Oldenburg, Germany (April 2000).

No context found.

Clemens Fischer. Combination and implementation of processes and data: from CSP-OZ to Java. PhD thesis, report of the Comp. Sce. dept. 2/2000, University of Oldenburg, Oldenburg, Germany (April 2000).

No context found.

C. Fischer. Combination and Implementation of Processes and Data: From CSPOZ to Java. PhD thesis, Bericht Nr. 2/2000, University of Oldenburg, April 2000.

No context found.

Fischer, C.: Combination and Implementation of Processes and Data: From CSP-OZ to Java. PhD thesis, University of Oldenburg, Gemany, January 2000.

No context found.

Clemens Fischer. Combination and implementation of processes and data: from CSP-OZ to Java. PhD thesis, report of the Comp. Sce. dept. 2/2000.

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