Sciweavers

5900 search results - page 63 / 1180
» Dependable Systems
Sort
View
LCTRTS
2004
Springer
15 years 9 months ago
Generating fast code from concurrent program dependence graphs
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
Jia Zeng, Cristian Soviani, Stephen A. Edwards
FTCS
1997
99views more  FTCS 1997»
15 years 5 months ago
Toward Accessibility Enhancement of Dependability Modeling Techniques and Tools
Fast turnaroundtime independabilityevaluation iscrucialfor e cient fault-tolerant system design and dependability of the resulting product since timely feedbacks will allow more i...
Ann T. Tai, Herbert Hecht, Kishor S. Trivedi, Bing...
ACL
2010
15 years 2 months ago
A Transition-Based Parser for 2-Planar Dependency Structures
Finding a class of structures that is rich enough for adequate linguistic representation yet restricted enough for efficient computational processing is an important problem for d...
Carlos Gómez-Rodríguez, Joakim Nivre
FSTTCS
2006
Springer
15 years 8 months ago
Context-Sensitive Dependency Pairs
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
Beatriz Alarcón, Raúl Gutiérr...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
16 years 5 months ago
Accurate and Efficient Inter-Transaction Dependency Tracking
A reparable database management system has the ability to automatically undo the set of transactions that are corrupted by a human error or malicious attack. The key technical chal...
Tzi-cker Chiueh, Shweta Bajpai