Most prior work on specification-based testing of concurrent programs have postulated an equivalence relation between specifications and programs. However, the equivalence relation, which requires a specification and a program to encompass the same set of synchronization sequences, is not well-suited for testing concurrent programs against partial and nondeterministic specifications. In this pa...

In this report we define the semantics of a language for dynamic QoS expressions which can be evaluated at run-time for conformance. We define how expressions can be constructed from atomic expressions termed ’basic profiles’ using composition operators. Two such operators are defined: The sum ( ’+’ ) which corresponds to simple conjunction and component-sum (’⊕’) which assume that the operands...

In model-based mutation testing, a test model is mutated for test case generation. The resulting test cases are able to detect whether the faults in the mutated models have been implemented in the system under test. For this purpose, a conformance check between the original and the mutated model is required. The generated counterexamples serve as basis for the test cases. Unfortunately, conform...

Abstract Business process model and notation (BPMN) is a popular used for modelling mainly due to its high expressiveness. However, BPMN has shortcomings when dealing with specific domains (namely Hazard Analysis Critical Control Points systems), struggling activity duration, quality control points, effects monitoring nature. To tackle these limitations, the business extended expressiveness (BP...

Conformance testing in model-based development refers to the testing activity that verifies whether the code generated (manually or automatically) from the model is behaviorally equivalent to the model. Presently the adequacy of conformance testing is inferred by measuring structural coverage achieved over the model. We hypothesize that adequacy metrics for conformance testing should consider s...

The conformance model for C++ implementations and programs is defined in subclauses 1.3 [intro.compliance] and 1.4 [intro.defs]. Together, these subclauses define categories of programs (well-formed, ill-formed, having undefined behavior) and the requirements placed on implementations when presented with these various kinds of program input. As it currently stands, however, the text of these su...

To date, systematic evaluations of regeneration policies and programs for industrial sites are scarce. This is particularly the case for evaluations that aim to examine whether policy objectives are actually achieved and to what extent this was due to the implementation of that policy or program. Regeneration policies and programs for these sites usually involve public provision of infrastructu...

The torrents of event data generated by today’s systems are an important enabler for process mining. However, at the same time, the size and variability of the resulting event logs are challenging for today’s process mining techniques. This paper focuses on “conformance checking in the large” and presents a novel decomposition technique that partitions larger processes into sets of subprocesses...