We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
er presents an abstraction of Hoare logic to traced symmetric monoidal categories, a eral framework for the theory of systems. Our abstraction is based on a traced monoidal functor...
Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paul...
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
In this paper, we present our approach to a visual refactoring tool, the Type Access Analyzer (TAA), which uses program analysis to detect code smells and for suggesting and perfo...
Philip Mayer, Andreas Meissner, Friedrich Steimann