289 search results - page 27 / 58 » Formal Verification in a Commercial Setting |
69
Voted
DAC
2003
ACM
15 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
107
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
64
Voted
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
Software construction has typically drawn on engineering metaphors like building bridges or cathedrals, which emphasize architecture, specification, central planning, and determin...
89
Voted
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
APN
2008
Springer
14 years 11 months ago
2008
Springer
Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation ...