In this paper we describe a system for detection and correction of lexical and syntactic errors in a French text. The lexical level uses several techniques (keys, phonetics and morphological generation). The aim of the syntactic level is verification of the structure of a sentence and of relations between words (e.g. agreement). It proceeds by unification of the decorations on the nodes of a de...

This paper compares implicit and explicit based segmentation techniques for off-line cursive handwriting recognition. Firstly, limitations in conventional implicit based approaches are handled by imposing sequence of heuristic rules to locate prospective segmentation points. However, fine segmentation delayed until character recognition. Additionally, for character hypothesis generation, forwar...

The development of large grammars is inherently complex and can hardly be achieved using standard text editors. Although, e.g., emacs can be programmed to support this task to a certain extent, special-purpose functionalities are indispensable. Otherwise the increasing effort for the development and maintenance of large grammars may severely limit their applicability. To avoid this pitfall in t...

HOL-TestGen is a test environment for specification-based unit testing built upon the proof assistant Isabelle/HOL. While there is considerable skepticism with regard to interactive theorem provers in testing communities, we argue that they are a natural choice for (automated) symbolic computations underlying systematic tests. This holds in particular for the development of non-trivial formal t...

When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. Reduction rules can be used to abstract from certain transitions and places in a large net and thus could cut down the size of the net used for verification. Petri nets have been proposed to model and analyse workflows and Petri nets ...

Database administrators need to compute closure of functional dependencies (FDs) for normalization of database systems and enforcing integrity rules. Colored Petri net (CPN) is a powerful formal method for modelling and verification of various systems. In this paper, we modelled Armstrong's axioms for automatic proof generation of a new FD rule from initial FD rules using CPN. For this purpose,...

Schematic Kleene algebra with tests (SKAT) supports the equational verification of flowchart scheme equivalence and captures simple while-programs with assignment statements. We formalise SKAT in Isabelle/HOL, using the quotient type package to reason equationally in this algebra. We apply this formalisation to a complex flowchart transformation proof from the literature. We extend SKAT with as...

This paper presents an ontology-driven approach that aims at supporting semantic verification of semi-formal process models. Despite the widespread use of these models in research and practice, the verification of process model information is still a challenging issue. We suggest an ontology-driven approach making use of background knowledge encoded in formal ontologies and rules. In the first ...