Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
Many diseases affect blood vessel morphology. This report analyzes vessel attributes (tortuosity, vessel density, radius, and terminal branch count) within 5 malignant gliomas as s...
Elizabeth Bullitt, Guido Gerig, Stephen R. Aylward...