TVaub and Wozniakowski have dealt with the complexity of some simple partial differential equations. They chose three model problems and showed that the parabolic problem considered had significantly lower complexity than the elliptic problem, which in turn had significantly lower complexity than the hyperbolic problem considered. They asked whether this is true in general. We show that this is...

We present a new technique for automatically synthesizing the assumptions needed in compositional model checking. The compositional approach reduces the proof that a property is satisfied by the parallel composition of two processes to the simpler argument that the property is guaranteed by one process provided that the other process satisfies an assumption A. Finding A manually is a difficult ...

It is well-known that model-checking and satissability for PLTL are PSPACE-complete. By contrast, very little is known about whether there exist some interesting fragments of PLTL with a lower worst-case complexity. Such results would help understand why PLTL model-checkers are successfully used in practice. In this paper we investigate this issue and consider model-checking and satissability f...

Game theory has become an important tools for making resource allocations decision in security domains, including critical infrastructure protection. Many of these games are formulated as Stackelberg security games. We present new analysis and algorithms for a class of Stackelberg security games with identical, fully protective defender resources. The first algorithm has worst-case complexity l...

Humane-egalitarian ideals, whose aims are group justice and reducing environmental inequality and privilege, must be tested against reality, as revealed by psychology and other social sciences. Four issues are addressed: the equation between IQ and intelligence, whether group potential is determined by a group's mean IQ, whether the BlackWhite IQ gap is genetic, and the meritocratic thesis that...

We prove a new transference theorem in the geometry of numbers, giving optimal bounds relating the successive minima of a lattice with the minimal length of generating vectors of its dual. It generalizes the transference theorem due to Banaszczyk. We also prove a stronger bound for the special class of lattices possessing n-unique shortest lattice vectors. The theorems imply consequent improvem...

In this paper we introduce a framework for computing upper bounds yet accurate WCET for hardware platforms with caches and pipelines. The methodology we propose consists of 3 steps: 1) given a program to analyse, compute an equivalent (WCET-wise) abstract program; 2) build a timed game by composing this abstract program with a network of timed automata modeling the architecture; and 3) compute ...

This paper presents an approach for contextualizing an event-based decision support system for scheduling patient assessments in a hospital. To cope with unexpected delays, patient coordinators often pursue a worst case scenario when scheduling patient assessments, leading to an underutilization of human resources and equipment when the procedure went without complications. We present a context...

For delivering a precise Worst Case Execution Time (WCET), the WCET static analysers need the executable program and the target architecture. However, a prediction – even coarse – of the future WCET would be helpful at design stages where only the source code is available. We investigate the possibility of creating predictors of the WCET based on the C source code using machine-learning (work i...

In order to ensure that timing constrains are met for a RealTime Systems, a bound of the Worst-Case Execution Time (WCET) of each part of the system must be known. Current WCET computation methods are applied on whole programs which means that all the source code should be available. However, more and more, embedded software uses COTS (Components ...), often a orded only as a binary code. Parti...