Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages f...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
With the popularity of model-driven methodologies, and the abundance of modelling languages, a major question for a requirements engineer is: which language is suitable for modell...
Shahram Esmaeilsabzali, Nancy A. Day, Joanne M. At...
Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on complex logical representation...
Roy Bar-Haim, Ido Dagan, Iddo Greental, Eyal Shnar...