In this paper a morphological component with a limited capability to automatically interpret (and generate) derived words is presented. The system combines an extended two-level m...
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
In previous work we proposed Linear Programs as a fine grained model for imperative programs, and showed how the model checking procedure used in SLAM can be generalised to a mode...
Knowledge representation languages that combine rules with object-oriented features akin to frame systems have recently attracted a lot of research interest, and F-logic is widely ...
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...