1163 search results - page 43 / 233 » Concurrent Subspaces Analysis |
RTSS
2009
IEEE
15 years 4 months ago
2009
IEEE
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
SPIN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
100
click to vote
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...
LCPC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we present an implementation of May Happen in Parallel analysis for Java that attempts to address some of the practical implementation concerns of the origi...
EMSOFT
2005
Springer
15 years 3 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...