Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Simulating the Behavior of Software Modules by Trace Rewriting
IEEE Transactions on Software Engineering
Precise Documentation of Well-Structured Programs
IEEE Transactions on Software Engineering
Functional documents for computer systems
Science of Computer Programming
Towards a formal semantics of Parnas tables
Proceedings of the 17th international conference on Software engineering
Tabular representations in relational documents
Relational methods in computer science
Using Test Oracles Generated from Program Documentation
IEEE Transactions on Software Engineering
On a formal semantics of tabular expressions
Science of Computer Programming
Interpretation of tabular expressions using arrays of relations
Relational methods for computer science applications
Software fundamentals: collected papers by David L. Parnas
Software fundamentals: collected papers by David L. Parnas
Requirements-Based Monitors for Real-Time Systems
IEEE Transactions on Software Engineering
Predicate Logic for Software Engineering
IEEE Transactions on Software Engineering
An Easily Extensible Toolset for Tabular Mathematical Expressions
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Abstract types defined as classes of variables
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Disciplined Methods of Software Specification: A Case Study
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
Specification of Software Component Requirements Using the Trace Function Method
ICSEA '06 Proceedings of the International Conference on Software Engineering Advances
Specifying Software Requirements for Complex Systems: New Techniques and Their Application
IEEE Transactions on Software Engineering
A new model for automated table layout
Proceedings of the 10th ACM symposium on Document engineering
From Requirements to Architecture
Proceedings of the 2010 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the 9th SoMeT_10
A tabular expression toolbox for matlab/simulink
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Building table formatting tools
Proceedings of the 11th ACM symposium on Document engineering
The use of mathematics in software quality assurance
Frontiers of Computer Science in China
An event-b approach to timing issues applied to the generic insulin infusion pump
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Hi-index | 0.00 |
Mathematical expressions in tabular form (also called ''tabular expressions'' or ''tables'') have been shown to be useful for documenting and analysing software systems. They are usually easier to read than conventional mathematical expressions but are no less precise. They can be used wherever mathematical expressions are used. To avoid misunderstandings, and to support users with trustworthy tools, the meaning of these expressions must be fully defined. This paper presents a new method for defining the meaning of tabular expressions. Each definition of an expression type names the expression's constituents, and provides a restriction schema and one or more evaluation schemas. The restriction schema defines the class of well-formed expressions of the type. An evaluation schema maps a well-formed tabular expression of the type to a mathematical expression of a previously defined type. Since the meaning of conventional mathematical expressions is well known, describing an equivalent expression fully defines the meaning of a tabular expression. In this approach, indexation is used to decouple the appearance of a tabular expression from its semantics. A tabular expression is an indexed set of grids; a grid is an indexed set of expressions. The expressions in a grid can be either conventional expressions or tabular expressions of a previously defined type. Defining the meaning of a tabular expression in this way facilitates the building of tools that faithfully implement the semantics. The decoupling of syntax and semantics by means of indices overcomes some limitations of older approaches. The method presented in the paper is illustrated by defining several previously known types of tabular expressions and some new ones. The use of the new model to build a suite of tools for the input, presentation, validation, evaluation, simplification, conversion and composition of tabular expressions is discussed.