We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
Today’s development and provision of commercially used Web services has shifted from providing static and predefined functionality to highly configurable services that can be ...
Benjamin Blau, Dirk Neumann, Christof Weinhardt, S...
The recent emergence of web mash-ups and open source software is driving the development of new practices in software and systems development. In this paper we explore novel pract...
Ingbert R. Floyd, M. Cameron Jones, Dinesh Rathi, ...
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...