Sciweavers

6608 search results - page 268 / 1322
» On the Completeness of Model Checking
Sort
View
IANDC
2007
107views more  IANDC 2007»
15 years 6 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
CASES
2005
ACM
15 years 8 months ago
Segment protection for embedded systems using run-time checks
The lack of virtual memory protection is a serious source of unreliability in many embedded systems. Without the segment-level protection it provides, these systems are subject to...
Matthew Simpson, Bhuvan Middha, Rajeev Barua
CGO
2008
IEEE
16 years 14 days ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
INFOCOM
2007
IEEE
16 years 9 days ago
Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
Mea Wang, Baochun Li
BMCBI
2004
120views more  BMCBI 2004»
15 years 5 months ago
pdb-care (PDB CArbohydrate REsidue check): a program to support annotation of complex carbohydrate structures in PDB files
Background: Carbohydrates are involved in a variety of fundamental biological processes and pathological situations. They therefore have a large pharmaceutical and diagnostic pote...
Thomas Lütteke, Claus-Wilhelm von der Lieth