231 search results - page 42 / 47 » Mu-calculus path checking |
128
Voted
EMSOFT
2003
Springer
15 years 6 months ago
2003
Springer
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
126
Voted
ETFA
2006
IEEE
15 years 4 months ago
2006
IEEE
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
141
Voted
CL
2008
Springer
15 years 1 months ago
2008
Springer
One of the most promising approaches to Java acceleration in embedded systems is a bytecode-to-C ahead-of-time compiler (AOTC). It improves the performance of a Java virtual machi...
105
Voted
OSDI
2004
ACM
16 years 1 months ago
2004
ACM
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
113
Voted
ATVA
2007
Springer
15 years 7 months ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...