With the increased use of network enabled applications and server hosted software systems, scalability with respect to network connectivity is becoming an increasingly important s...
110 views102 votes15 years 2 months ago ISSRE 2007»
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
174 views106 votes15 years 1 months ago ENTCS 2007»
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. ...
258 views107 votes14 years 8 months ago SIAMJO 2011»
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
146 views119 votes15 years 6 months ago SIGCSE 2005»
As Computer Science educators, we know that students learn more from projects that are fun and challenging, that seem “real” to them, and that allow them to be creative in des...
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major a...
136 views201 votes16 years 1 months ago POPL 2007»
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
113 views198 votes16 years 1 months ago POPL 2007»
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
122 views170 votes16 years 1 months ago POPL 2001»
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...