2905 search results - page 324 / 581 » Formal Memetic Algorithms |
96
Voted
FATES
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper we propose an approach to automatically produce test cases allowing to check the satis ability of a linear property on a given implementation. Linear proper...
127
click to vote
FMCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Attack graphs depict ways in which an adversary exploits system vulnerabilities to achieve a desired state. System administrators use attack graphs to determine how vulne...
123
click to vote
FORMATS
2003
Springer
15 years 9 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
119
click to vote
IFL
2003
Springer
15 years 9 months ago
2003
Springer
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
125
click to vote
DEXAW
2002
IEEE
15 years 8 months ago
2002
IEEE
The latest ontology languages can be translated into a description logic (DL), thus providing them with a formal semantics and associated reasoning procedures. We introduce the or...