Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Current aspect-oriented programming (AOP) enhances maintainability and comprehensibility by modularizing concerns crosscutting multiple components but lacks the support for the hie...
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Research performed in the field of computer vision has steadily ignored recent advances in programming tools and techniques, relying on well-established traditional methods, such ...
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...