We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
Roger T. Alexander, James M. Bieman, Sudipto Ghosh...
Tailoring solver-independent constraint instances to target solvers is an important component of automated constraint modelling. We augment the tailoring process by a set of enhan...
Andrea Rendl, Ian Miguel, Ian P. Gent, Christopher...
Semantic Analysis is a business analysis method designed to capture user requirements and represent them as text or in a graph that is called Ontology Chart. Ontology Charts can b...
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...