A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
Clare Dixon, Michael Fisher, Boris Konev, Alexei L...
Abstract—Property-based synthesis has become a more prominent topic during the last years, being used in multiple areas like e.g. formal verification and design automation. We w...
Shao and Wang have proposed a cognitive complexity measure[8] as a metric that can be used for estimating the comprehension effort for understanding software written in imperative...