Abstract. Following the translation validation approach to highassurance compilation, we describe a new algorithm for validating a posteriori the results of a run of register alloc...
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
The ever increasing sizes of on-chip caches and the growing domination of wire delay necessitate significant changes to cache hierarchy design methodologies. Many recent proposal...
Previous parametric representations of smooth genus-zero surfaces require a collection of abutting patches (e.g. splines, NURBS, recursively subdivided polygons). We introduce a s...
Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe D...