TBell: A mathematical tool for analyzing decision tables

This paper describes the development of mathematical theory and software to analyze specifications that are developed using decision tables. A decision table is a tabular format for specifying a complex set of rules that chooses one of a number of alternative actions. The report also describes a prototype tool, called TBell, that automates certain types of analysis

An overview of decision table literature.

The present report contains an overview of the literature on decision tables since its origin. The goal is to analyze the dissemination of decision tables in different areas of knowledge, countries and languages, especially showing these that present the most interest on decision table use. In the first part a description of the scope of the overview is given. Next, the classification results by topic are explained. An abstract and some keywords are included for each reference, normally provided by the authors. In some cases own comments are added. The purpose of these comments is to show where, how and why decision tables are used. Other examined topics are the theoretical or practical feature of each document, as well as its origin country and language. Finally, the main body of the paper consists of the ordered list of publications with abstract, classification and comments.

Modeling the Pāṇinian System of Sanskrit Grammar

The present work is a study of the Aṣṭādhyāyī of Pāṇini from a new perspective. It attempts to explore the Pāṇinian system of Sanskrit grammar from a formal point of view and investigate the possibilities of representing it in a logical, explicit and consistent manner. It puts forward an appropriate framework for such a representation. Differing from the formulation of Aṣṭādhyāyī, which is composed in an artificial yet natural language and is meant to be employed by individuals who are acquainted both with the Sanskrit language and the techniques of grammar, the present rendering aims for a non-verbal representation in terms of mathematical categories and logical relations which can be implemented in an algorithmic manner. The formal framework suggested in this work would facilitate adequate tools for postulating and evaluating hypotheses about the grammatical system. Moreover, it would furnish the basis for a computer implementation of the grammar. Both these aspects are objects of enquiry in the field of theoretical studies on Pāṇini as well as the emerging discipline of Sanskrit computational linguistics. This book takes on the ground-work in these areas.Die vorliegende Arbeit untersucht aus einer neuen Perspektive Pāṇinis Aṣṭādhyāyī. Es versucht, Pāṇinis Regelwerk der Sanskrit-Grammatik aus formaler Sicht zu erforschen und die Möglichkeiten zu untersuchen, es logisch, explizit und konsistent darzustellen. Dazu wird ein geeignetes Framework für eine solche Repräsentation vorgeschlagen. Im Unterschied zur Aṣṭādhyāyī, die in einer künstlichen, aber natürlichen Sprache verfasst ist und für Personen konzipiert war, die sowohl mit der Sanskrit-Sprache als auch mit grammatischen Techniken vertraut sind, zielt die vorliegende Darstellung auf eine nonverbale Repräsentation in Form von mathematischen Kategorien und logischen Beziehungen ab, die algorithmisch umgesetzt werden können. Der in dieser Arbeit vorgeschlagene formale Rahmen würde geeignete Werkzeuge bereitstellen, um Hypothesen zum grammatischen System zu postulieren und zu evaluieren. Darüber hinaus würde er die Grundlage für eine computergestützte Implementierung der Grammatik schaffen. Beide Aspekte sind Forschungsgegenstand im Bereich der theoretischen Studien zu Pāṇini sowie der neu entstehenden Disziplin der Sanskrit-Computerlinguistik. Dieses Buch beschäftigt sich mit der Grundlagenarbeit in diesen Bereichen

A seamless framework for formal reasoning on specifications : model derivation, verification and comparison

While formal methods have been demonstrated to be favourable to the construction of reliable systems, they also present us with several limitations. Most of the efforts regarding formal reasoning are concerned with model correctness for critical systems, while other properties, including model validity, have seen little development, especially in the context of non-critical systems. We set to advance model validation by relating a software model with the corresponding requirements it is intended to capture. This requires us to express both requirements and models in a common formal language, which in turn will enable not only model validation, but also model generation and comparison. We present a novel framework (TOMM) that integrates the formalization of class diagrams and requirements, along with a set of formal theories to validate, infer, and compare class models. We introduce SpeCNL, a controlled domain independent subset of English sentences, and a document structure named ConSpec. The combination of both allows us to express and formalize functional requirements related to class models. Our formal framework is accompanied by a proof-of-concept tool that integrates language and image processing libraries, as well as formal methods, to aid the usage and evaluation of our theories. In addition, we provide an implementation that performs partial extraction of relevant information from the graphical representations of class diagrams. Though different approaches to model validation exist, they assume the existence of formal specifications for the model to be checked. In contrast, our approach has been shown to deal with informal specifications and seamlessly validate, generate and compare class models

An incremental prototyping methodology for distributed systems based on formal specifications

This thesis presents a new incremental prototyping methodology for formally specified distributed systems. The objective of this methodology is to fill the gap which currently exists between the phase where a specification is simulated, generally using some sequential logical inference tool, and the phase where the modeled system has a reliable, efficient and maintainable distributed implementation in a main-stream object-oriented programming language. This objective is realized by application of a methodology we call Mixed Prototyping with Object-Orientation (in short: OOMP). This is an extension of an existing approach, namely Mixed Prototyping, that we have adapted to the object-oriented paradigm, of which we exploit the flexibility and inherent capability of modeling abstract entities. The OOMP process proceeds as follows. First, the source specifications are automatically translated into a class-based object-oriented language, thus providing a portable and high-level initial implementation. The generated class hierarchy is designed so that the developer may independently derive new sub-classes in order to make the prototype more efficient or to add functionalities that could not be specified with the given formalism. This prototyping process is performed incrementally in order to safely validate the modifications against the semantics of the specification. The resulting prototype can finally be considered as the end-user implementation of the specified software. The originality of our approach is that we exploit object-oriented programming techniques in the implementation of formal specifications in order to gain flexibility in the development process. Simultaneously, the object paradigm gives the means to harness this newly acquired freedom by allowing automatic generation of test routines which verify the conformance of the hand-written code with respect to the specifications. We demonstrate the generality of our prototyping scheme by applying it to a distributed collaborative diary program within the frame of CO-OPN (Concurrent Object-Oriented Petri Nets), a very powerful specification formalism which allows expressing concurrent and non-deterministic behaviours, and which provides structuring facilities such as modularity, encapsulation and genericity. An important effort has also been accomplished in the development or adaptation of distributed algorithms for cooperative symbolic resolution. These algorithms are used in the run-time support of the generated CO-OPN prototypes