We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea...
Abstract. We develop a language-based approach for modeling and verifying aspects of privacy policies. Our approach relies on information-flow control. Concretely, we use the prog...
Relational OLAP tools and other database applications generate sequences of SQL statements that are sent to the database server as result of a single information request issued by...
As Grids are emerging as the next-generation computing platform, the need for Web-based portals that hide low level details of accessing Grid services for deployment and execution ...