A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
Warren A. Hunt Jr., Robert Bellarmine Krug, Sandip...
: Multi-Agent systems follow a highly abstract programming paradigm. of this abstraction level, behaviours of the participants are not always clearly reproducible for humans. In th...
The semantic web is a promising application-area for the Prolog programming language for its non-determinism and patternmatching. In this paper we outline an infrastructure for loa...
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...