Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
an Abstract Syntax and Direct-Model Theoretic Semantics for RuleML . 45 Adrian Giurca and Gerd Wagner A Semantic Web Framework for Interleaving Policy Reasoning and External Servic...
A communication trace is a detailed record of the communication between two entities. Communication traces are vital for research in computer networks and protocols in many domain...
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...