We demonstrate how access control models and policies can be represented by using term rewriting systems, and how rewriting may be used for evaluating access requests and for provi...
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...