37 research outputs found
Confluence of CHR Revisited:Invariants and Modulo Equivalence
Abstract simulation of one transition system by another is introduced as a
means to simulate a potentially infinite class of similar transition sequences
within a single transition sequence. This is useful for proving confluence
under invariants of a given system, as it may reduce the number of proof cases
to consider from infinity to a finite number. The classical confluence results
for Constraint Handling Rules (CHR) can be explained in this way, using CHR as
a simulation of itself. Using an abstract simulation based on a ground
representation, we extend these results to include confluence under invariant
and modulo equivalence, which have not been done in a satisfactory way before.Comment: Pre-proceedings paper presented at the 28th International Symposium
on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), Frankfurt
am Main, Germany, 4-6 September 2018 (arXiv:1808.03326
Programming Languages and Systems
This open access book constitutes the proceedings of the 28th European Symposium on Programming, ESOP 2019, which took place in Prague, Czech Republic, in April 2019, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019
Model Checking and Model-Based Testing : Improving Their Feasibility by Lazy Techniques, Parallelization, and Other Optimizations
This thesis focuses on the lightweight formal method of model-based testing for checking safety properties, and derives a new and more feasible approach.
For liveness properties, dynamic testing is impossible, so feasibility is increased by specializing on an important class of properties, livelock freedom, and deriving a more feasible model checking algorithm for it.
All mentioned improvements are substantiated by experiments