In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
Carlos Olarte, Catuscia Palamidessi, Frank Valenci...
Most software applications use a relational database for data management and storage. Interaction with such a database is often done by letting the program construct strings with ...
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
To improve the performance of a single application on Chip Multiprocessors (CMPs), the application must be split into threads which execute concurrently on multiple cores. In mult...
M. Aater Suleman, Onur Mutlu, Moinuddin K. Qureshi...