We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
There has been much work on developing techniques for estimating the capacity and the available bandwidth of network paths based on end-point measurements. The focus has primarily...
Karthik Lakshminarayanan, Venkata N. Padmanabhan, ...
This paper presents a new compile-time analysis that enables a testing methodology for white-box coverage testing of error recovery code (i.e., exception handlers) in Java web ser...
Chen Fu, Barbara G. Ryder, Ana Milanova, David Won...
Abstract. Web Services and Web Service composition languages for Web Service choreography are becoming more and more important in the area for inter-enterprise application and proc...
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...