We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Abstract: We propose a new system that is able to handle the entire Personal Dataspace of a user. A Personal Dataspace includes all data pertaining to a user on all his disks and o...
Jens-Peter Dittrich, Lukas Blunschi, Markus Fä...