Tabular Expressions and their Relational Semantics

• Autorzy: Janicki R. , Wassyng A.
• Języki publikacji: EN

Abstrakty

EN

Tabular Expressions are means to represent the complex relations that are used to specify or document software systems. A formal model and a semantics for tabular expressions are presented. The model covers most known types of tables used in software engineering, and admits precise classification and definition of new types of tables. The practical importance of the semantics of tabular expressions is also discussed.

Słowa kluczowe

EN

computer software; computer systems; mathematical models; software engineering

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 67, nr 4
• Strony: 343--370
• Opis fizyczny: Bibliogr. 44 poz., tab.

Twórcy

autor

Janicki R.

• Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada L8S 4K1

autor

Wassyng A.

• Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada L8S 4K1

Bibliografia

• [1] R. Abraham, Evaluating Generalized Tabular Expressions in Software Documentation, M. Eng. Thesis, Dept. of Electrical and Computer Engineering, McMaster University 1997, also CRL Report 346, McMaster University, Hamilton, Ontario, Canada, 1997.
• [2] A. V. Aho, J. D. Ullman, Foundations of Computer Science, Computer Science Press 1992.
• [3] G. H. Archinoff, R. J. Hohendorf, A. Wassyng, B. Quigley, M. R. Borsch, Verification of the Shutdown System Software at the Darlington Nuclear Generating Station, International Conference on Control and Instrumentation in Nuclear Installations, Glasgow, U.K., 1990, No. 4.3.
• [4] P. C. Clements, Function Specification for the A-7E Function Driver Module, NRL Memorandum Report 4658, U.S. Naval Research Lab., 1981.
• [5] J. Desharnais, R. Khédri, A. Mili, Towards a Uniform Relational Semantics for Tabular Expressions, Proc. of RELMICS 98, Warsaw 1998.
• [6] J. Desharnais, R. Khédri, A. Mili, Interpretation of Tabular Expressions Using Arrays of Relations, In E. Orłowska, A. Szałas (eds.) Studies in Fuzziness and Soft Computing, Springer 2001, pp. 3-14.
• [7] J. Desharnais, R. Khédri, A. Mili, Representation, Validation and Intergration of Scenarios Using Tabular Expressions, Formal Methods in System Design, to appear.
• [8] J. Desharnais, R. Khédri, A. Mili, Computing the Demonic Meet of Relations Represented by Predicate Expressions Tables, Technical Report CAS-04-03-RK, McMaster University, Hamilton, Ontario, Canada, 2004.
• [9] M. P. E. Heimdahl, N. G. Leveson, Completeness and Consistency Analysis of State-Based Requirements, 17th International Conference on Software Engineering (ICSE’95), IEEE Computer Society, Seattle, WA, 1995, 3-14.
• [10] C. Heitmeyer, A. Bull, C. Gasarch, B. Labaw, SCR*: A Toolset for Specifying and Analyzing Requirements, Proc. 9th Annual Conf. on Computer Assurance (COMPASS’95), Gaithersburg, MD, 1995.
• [11] K. L. Heninger, Specifying Software Requirements for Complex Systems: New Techniques and their Applications, IEEE Transactions on Software Engineering, 6, 1, (1980), 2-13.
• [12] K. L. Heninger, J. Kallander, D. L. Parnas, J. E. Shore, Software Requirements for the A-7E Aircraft, NRL Memorandum Report 3876, U.S. Naval Research Lab., 1978.
• [13] D. N. Hoover, Z. Chen, Tablewise, a Decision Table Tool, Proc. 9th Annual Conf. on Computer Assurance (COMPASS’95), Gaithersburg,MD, 1995.
• [14] R. B. Hurlay, Decision Tables in Software Engineering, Van Nostrand Reinhold Company, New York 1983.
• [15] R. Janicki, Towards a Formal Semantics of Parnas Tables, 17th International Conference on Software Engineering (ICSE’95), IEEE Computer Society, Seattle, WA, 1995, 231-240.
• [16] R. Janicki, On Formal Semantics of Tabular Expressions, CRL Report 355, McMaster University, Hamilton, Ontario 1997.
• [17] R. Janicki, Remarks on Mereology of Direct Products and Relations, in J. Desharnais, M. Frappier, W. MacCaull (eds.), Relational Methods in Computer Science, Methodos Publ. 2002, pp. 65-84.
• [18] R. Janicki, On a Mereological System for Relational Software Specifications, Proc. of MFCS’2002 (Mathematical Foundations of Computer Science), Lecture Notes in Comp. Science 2420, Springer 2002, pp. 375-386.
• [19] R. Janicki, R. Khédri, On Formal Semantics of Tabular Expressions, Science of Computer Programming, 39 (2001), 189-214.
• [20] R. Janicki, D. L. Parnas, J. Zucker, Tabular Representations in Relational Documents, in C. Brink, W. Kahl, G. Schmidt (eds.): Relational Methods in Computer Science, Springer-Verlag 1997.
• [21] R. Janicki, A. Wassyng, On Tabular Expressions, Proc. of. CASCON’2003 (13th IBM Centre for Advanced Studies Conference), Toronto, Canada 2003, pp. 38-52.
• [22] W. Kahl, Compositional Syntax and Semantics of Tables, SQRL Report No. 15, McMaster University, Hamilton, Ontario, Canada, 2003, to appear in Formal Methods in System Design.
• [23] R. Khédri, Requirements Scenarios Formalization Technique: Versions Towards One Good Version, inW. Kahl, D. L. Parnas, G. Schmidt (eds.), Relational Methods in Software, Elsevier 2001, 19-37.
• [24] L. Lamport, How to Write a Long Formula, SRC Research Report 119, DEC System Research Centre, Palo Alto, CA, 1993.
• [25] M. Lawford, J. McDougall, P. Froebel, G. Moum, Practical Application of Functional and Relational Methods for the Specification and Verification of Safety Critical Software, Proc. of AMAST’2000, Lecture Notes in Computer Science 1816, Springer 2000, pp. 73-88.
• [26] N. G. Leveson, M. P. E. Heimdahl, H. Hildreth, J. D. Reese, Requirements Specifications for Process-Control Systems, IEEE Transaction on Software Engineering, 20, 9, 1994.
• [27] J. McDougall, E. Jankowski, Procedure for the Specification of Software Requirements for Safety Critical Systems, Report CE-1001-PROC, Computer Centre of Excellence, 1995.
• [28] D. L. Parnas, A Generalized Control Structure and Its Formal Definition, Communications of the ACM, 26, 8 (1983), 572-581.
• [29] D. L. Parnas, Tabular Representation of Relations, CRL Report 260, Telecommunications Research Institute of Ontario (TRIO), McMaster University, Hamilton, Ontario, Canada, 1992.
• [30] D. L. Parnas, G. J. K. Asmis, J. D. Kendall, Reviewable Development of Safety Critical Software, International Conference on Control and Instrumentation in Nuclear Installations, Glasgow, U.K., 1990, No. 4.3.
• [31] D. L. Parnas, G. L. K. Asmis, J. Madey, Assessment of Safety-Critical Software in Nuclear Power Plants, Nuclear Safety, 32, 2 (1991), 189-198.
• [32] D. L. Parnas, J. Madey, Functional Documentation for Computer Systems Engineering, Science of Computer Programming, 25, 1 (1995), 41-61.
• [33] D. L. Parnas, J. Madey, M. Iglewski, Precise Documentation of Well-Structured Programs, IEEE Transactions on Software Engineering, 20, 12 (1994), 948-976.
• [34] G. Schmidt, T. Ströhlein, Relations and Graphs. Discrete Mathematics for Computer Science, Springer 1993.
• [35] A. J. van Schouwen, The A-7 Requirements Model: Re-examination for Real-Time Systems and an Application to Monitoring Systems, Technical Report 90-276, Queen’s University, CIS, TRIO, Kingston, Ontario, Canada, 1990.
• [36] A. J. van Schouwen, D. L. Parnas, J. Madey, Documentation of Requirements for Computer Systems, International Symposium on Requirements Engineering, IEEE Computer Society, San Diego, California, 1993, pp. 198-207.
• [37] E. Sekerinski, Exploring Tabular Verification and Refinement, Formal Aspect of Computing 15 (2003), 215-236.
• [38] SERG - Software Engineering Group, Table Tool System Developer’s Guide, CRL Report 339, TRIO, Mc-Master University, Hamilton, Ontario, Canada 1997.
• [39] A. Wassyng, GARD Research Consulting Inc., Software Requirements for AECB Project 2.314.1, 23141-DOC-4, Revision 2, 1995.
• [40] A. Wassyng, R. Janicki, Tabular Expressions in Software Engineering, Proc. of ICSSEA’03 (Intern. Conf. on Software and System Engineering), Vol. 4, Paris, France 2003, pp.1-46.
• [41] A. Wassyng, M. Lawford, Lessons Learned from a Successful Implementation of Formal Methods in an Industrial Project, Proc. of FME’03 (Formal Methods Europe), Lecture Notes in Computer Science 2805, Springer 2003, pp. 133-153.
• [42] A. J. Wilder, Recursive Tables and Effective Definition Schemes, The Journal of Logic and Algebraic Programming, 51 (2002), 101-121.
• [43] Y. Yang, R. Janicki, On Concurrency and Tabular Expressions, Proc. of SERP’2004 (Software Engineering Research and Practice), Las Vegas, USA, 2004, pp. 455 - 461.
• [44] J. Zucker, Transformations of Normal and Inverted Function Tables, Formal Aspects of Programming, 8 (1996), 679-705.