The paper presents work-in-progress aiming at deploying runtime verification techniques to observe whether state changes in a database system conform with temporal business rules. A high level language for tailoring enterprise database systems with temporal business rules is defined. Furthermore we present an algorithmic framework for checking temporal business rules at runtime, i.e. we recomme...

Verification of models and model processing programs are fundamental issues and are inevitable in model-based software development in order to apply them in realworld solutions. Verification concerns the analysis of non-functional and functional properties as well. Model transformation developers are interested in offline methods for the verification process. Offline analysis means that only th...

A methodolggy for ttre validation and verification (V&V) of decision making rules is proposed. The methodology addresses the general problem of deiecting problematic ases in a set of rules. The rules are expressed as statements in formal logic. The definition of decision rules in formal logic makes the problem general in tems of application domains, and also provides an analytical-base foi defi...

This report describes the definitions, rules, setup, procedure, and results of the 1st International Competition on Software Verification. The verification community has performed competitions in various areas in the past, and SV-COMP’12 is the first competition of verification tools that take software programs as input and run a fully automatic verification of a given safety property. This yea...

In this paper the development of an analysis tool for verification and validation of temporal business rules is described. The formalism for expressing the business rules is the Conceptual Rule Language developed as part for the ESPRIT II project TEMPORA.

In this paper, we propose a Petri nets formalism for the verification of rule based systems. Typical structural errors in a rule based system are redundancy, inconsistency, incompleteness, and circularity. Since our verification is based on Petri nets and their incidence matrix, so we need to transform rules into a Petri net first, then derive an incidence matrix from the net. In order to let a...

A reduction rule can transform a large net into a smaller and simple net while preserving certain interesting properties and it is usually applied before verification to reduce the complexity and to prevent state space explosion. Reset nets have been proposed to formally describe workflows with cancellation behaviour. In our previous work, we have presented a set of reduction rules for Reset Wo...

MOTIVATION The bindings between transcription factors (TFs) and transcription factor binding sites (TFBSs) are fundamental protein-DNA interactions in transcriptional regulation. Extensive efforts have been made to better understand the protein-DNA interactions. Recent mining on exact TF-TFBS-associated sequence patterns (rules) has shown great potentials and achieved very promising results. Ho...