The integration of a rule representation in ontology languages enhances the developer’s abilities in the expression of knowledge. Likewise the integration creates new challenges for the design process of these knowledge bases. Thus, evaluation approaches have to cope with the merged methods. We introduce extensions to existing verification techniques to support the implementation of ontologies ...

Currently, the introduction of an appropriate rule representation layer for the semantic web stack is discussed. However, with the inclusion of rule-based knowledge new verification issues for rule-augmented ontologies arise. In this paper we investigate the detection of anomalies as an important subtask of verification. We extend and revise existing approaches for the syntactic verification of...

Handling changes to programs and specifications efficiently is a particular challenge in formal software verification. Change impact analysis is an approach to this challenge where the effects of changes made to a document (such as a program or specification) are described in terms of rules on a semantic representation of the document. This allows to describe and delimit the effects of syntacti...

Verification is an important process in the development of Erlang systems. A recent strand of work has studied the verification of Erlang applications using the process algebra μCRL. The general idea is that Erlang programs are translated into a μCRL specification, upon which the standard model checkers can be applied for checking the system’s properties. In this paper, we pull together some of...

We present VeriMAP, a tool for the verification of C programs based on the transformation of constraint logic programs, also called constrained Horn clauses. VeriMAP makes use of Constraint Logic Programming (CLP) as a metalanguage for representing: (i) the operational semantics of the C language, (ii) the program, and (iii) the property to be verified. Satisfiability preserving transformations...

Hardware verification and sequential test generation are aspects of the same problem, namely to prove the equal behavior determined by two circuit descriptions. During test generation, this attempt succeeds for the faulty and fault free circuit if redundancy exists, and during verification it succeeds, if the implementation is correct with regard to its specification. This observation can be us...

We define the notion of inductive invariants for continuous dynamical systems and use it to present inference rules for safety verification of polynomial continuous dynamical systems. We present two different sound and complete inference rules, but neither of these rules can be effectively applied. We then present several simpler and practical inference rules that are sound and relatively compl...

An algorithm to generate a class of Boolean classification rules is described. The algorithm is implemented in search partition analysis software (SPAN), a program designed to find an optimal binary data partition. Some comments on the relationship of the procedure with tree-based search procedures are discussed.

Traditional software testing techniques have been adapted to deal with the verification of model transformations. Black-box techniques have the benefit of simplicity as well as the advantage of being independent of the implementation language, and thus compatible with any model transformation language. Although this is important, the inherent complexity of metamodels may result in a significant...

Another component in Pattern-Oriented and Model-Driven Architecture (POMA) is the concept of model generation. The generation code of models is the process of creating a source code from a model using generation rules. In this paper, we present the generation rules that are used to support the automated code generator of POMA architecture to generate the source code of the entire interactive sy...