923 search results - page 101 / 185 » Proving the value of formal methods |
149
click to vote
SAS
2007
Springer
16 years 11 days ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
159
click to vote
FM
2001
Springer
15 years 10 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
183
click to vote
ICFCA
2007
Springer
15 years 10 months ago
2007
Springer
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
181
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
190
click to vote
FMICS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present experiences from a case study where a model-based approach to black-box testing is applied to verify that a Wireless Application Protocol (WAP) gateway conform...