2905 search results - page 358 / 581 » Formal Memetic Algorithms |
139
click to vote
CAV
2005
Springer
15 years 9 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
120
click to vote
CIE
2005
Springer
15 years 9 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
151
click to vote
ECOOP
2005
Springer
15 years 9 months ago
2005
Springer
Object-oriented scripting languages like JavaScript and Python are popular partly because of their dynamic features. These include the runtime modification of objects and classes ...
115
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
174
click to vote
CAV
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a new statistical approach to analyzing stochastic systems against specifications given in a sublogic of continuous stochastic logic (CSL). Unlike past numeri...