Sciweavers

8 search results - page 1 / 2
» The complexity of model checking concurrent programs against...
Sort
View
ATAL
2006
Springer
13 years 7 months ago
The complexity of model checking concurrent programs against CTLK specifications
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
Alessio Lomuscio, Franco Raimondi
TCAD
2010
121views more  TCAD 2010»
12 years 10 months ago
Translation Validation of High-Level Synthesis
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta
OSDI
2002
ACM
14 years 3 months ago
Using Model Checking to Debug Device Firmware
Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult t...
Sanjeev Kumar, Kai Li
IJFCS
2006
119views more  IJFCS 2006»
13 years 3 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
13 years 1 months ago
Efficient Detection of Errors in Java Components Using Random Environment and Restarts
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
Pavel Parizek, Tomás Kalibera