Operational Semantics of Visual Notations Operational Semantics of Visual Design Languages

This paper shows how to deene an operational semantics of those graphical notations that are used during requirements analysis and design. An abstract syntax using syntax graphs is given to describe the notations uniformly, followed by the formal description of a possible semantics by semantic bases. Finally, a calculus of operations is proposed to integrate the deenition of diierent notations. By describing these semi-formal notations in a formal manner the notations become more precise. Furthermore it is made possible to write tools to interpret the notations operationally.

[1]  Peter Baumgartner,et al.  Tableaux for Diagnosis Applications , 1997, TABLEAUX.

[2]  Peter Baumgartner,et al.  Model Elimination, Logic Programming and Computing Answers , 1995, IJCAI.

[3]  Peter Baumgartner,et al.  Calculi for Disjunctive Logic Programming , 1997, ILPS.

[4]  P. Simons.  Eecient Implementation of the Well- Founded and Stable Model Seman- Tics , 1996 .

[5]  Ilkka Niemell.  A Tableau Calculus for Minimal Model Reasoning Ilkka Niemel a a Tableau Calculus for Minimal Model Reasoning , 1996 .

[6]  Michael J. C. Gordon,et al.  The Denotational Description of Programming Languages , 1979, Springer New York.

[7]  Jürgen Ebert,et al.  Efficient Interpretation of State Charts , 1993, FCT.

[8]  A. Winter.  Generic Support for Understanding Heterogeneous Software Generic Support for Understanding Heterogeneous Software , 1995 .

[9]  Jürgen Dix,et al.  DisLoP: A Research Project on Disjunctive Logic Programming , 1997, AI Commun..

[10]  Jürgen Dix,et al.  Non-monotonic Extensions of Logic Programming: Theory, Implementation and Applications , 1996 .

[11]  Jürgen Dix,et al.  A Comparison of STATIC Semantics with D-WFS , 1996 .

[12]  Jürgen Ebert,et al.  A Generic System to Support Multi-Level Understanding of Heterogeneous Software , 1997 .

[13]  Angelika Franzke.  GRAL 2.0: A Reference Manual , 1997 .

[14]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[15]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism , 1984, Theor. Comput. Sci..

[16]  Jürgen Dix,et al.  Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations , 1996, Fundam. Informaticae.

[17]  Christoph Steigner,et al.  Modelling Timeouts in Protocol Design , 1995 .

[18]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[19]  Wenjin Lu.  Minimal Model Generation Based on E-hyper Tableaux , 1997, KI.

[20]  Robert B. France,et al.  Semantically Extended Data Flow Diagrams: A Formal Specification Tool , 1992, IEEE Trans. Software Eng..

[21]  Lutz Priese,et al.  Abstract Fairness and Semantics , 1997, Theor. Comput. Sci..

[22]  Chandrabose Aravindan.  DisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover , 1996, KI.

[23]  Gottfried Vossen,et al.  I-Serializability: Generalized Correctness for Transaction-Based Environments , 1997, Inf. Process. Lett..

[24]  Harro Wimmel.  Fachberichte Informatik on Some Compositional Petri Net Semantics Universitt at Koblenz{landau on Some Compositional Petri Net Semantics , 1995 .

[25]  Luís Moniz Pereira,et al.  Prolegomena to Logic Programming for Non-monotonic Reasoning , 1996, NMELP.

[26]  Ilkka Niemelä.  Implementing Circumscription Using a Tableau Method , 1996, ECAI.

[27]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[28]  Stephan Philippi,et al.  Integration of Integrity Constraints into Object-Oriented Database Schema according to ODMG-93 , 1995 .

[29]  Richard S. Bird,et al.  Programs and Machines , 1976 .

[30]  Chandrabose Aravindan.  An Abductive Framework for Negation in Disjunctive Logic Programming , 1996, JELIA.

[31]  Jürgen Dix,et al.  Characterizations and Implementation of Static Semantics of Disjunctive Programs , 1996 .

[32]  Edward Yourdon,et al.  Modern structured analysis , 1989 .

[33]  U. Furbach.  Re nements for Restart Model Elimination , 1996 .

[34]  Jürgen Ebert,et al.  Meta-CASE in Practice: a Case for KOGGE , 1997, CAiSE.

[35]  Jürgen Ebert,et al.  Graph Based Modeling and Implementation with EER / GRAL , 1996, ER.

[36]  Frieder Stolzenburg,et al.  Membership-Constraints and Complexity in Logic Programming with Sets , 1996, FroCoS.

[37]  Stefan Brass,et al.  D-wfs: a Connuent Calculus and an Equivalent Characterization , 1995 .

[38]  F. Stolzenburg,et al.  Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints , 1998 .

[39]  Martin Volk,et al.  Constraint Logic Programming for Computational Linguistics , 1996, LACL.

[40]  Jürgen Dix,et al.  Knowledge Representation with Logic Programs , 1997, LPKR.

[41]  Lutz Priese,et al.  Algebraic Characterization of Petri Net Pomset Semantics , 1997, CONCUR.