Titlebook: Computer Safety, Reliability, and Security; 33rd International C Andrea Bondavalli,Felicita Di Giandomenico Conference proceedings 2014 Spr

Crayon

Debugging with Timed Automata Mutationseading to the implementation fault. The technique is implemented for Uppaal’s timed automata models and is based on a language inclusion check via bounded model checking. It adds debugging capability to our existing test-case generators. A car-alarm system serves as illustrating case study.

Oversee

魯莽

COKE

Exploiting Narrow Data-Width to Mask Soft Errors in Register Filesove the unnecessary masks without scarifying the errors coverage. Under the user-defined overhead constrain, the most cost-effective masking operations can be automatically selected. Experimental results from several benchmarks indicate that the reliability of programs have been averagely improved f

BOOST

Proving the Absence of Stack Overflowsllenge for binary-code level analyzers is to minimize the necessary amount of user interactions, e.g., for function pointer calls. To minimize user interaction, the analysis has to be precise, and the annotation mechanism has to be flexible and easy-to-use. The analyzer configuration has to be done

graphy

garrulous

coltish

陶醉

嘲弄

https://doi.org/10.1007/978-3-540-75267-7evant, so as to prevent their future uncovered faults that may lead to system failure. A new coverage model incorporating the timely coverage of the irrelevant components (in addition to the faulty components) is proposed, which opens up a cost-effective approach to improve the system reliability wi