We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
Parameterized heuristics abound in computer aided design and verification, and manual tuning of the respective parameters is difficult and time-consuming. Very recent results from ...
Frank Hutter, Domagoj Babic, Holger H. Hoos, Alan ...
Abstract: Functions that map boolean vectors into the integers are important for the design and verication of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
We present an accurate, interactive silhouette extraction mechanism for texture-based volume rendering. Compared to previous approaches, our system guarantees silhouettes of a use...