2905 search results - page 279 / 581 » Formal Memetic Algorithms |
134
click to vote
EMSOFT
2006
Springer
15 years 4 months ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...
107
Voted
FMCAD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
102
click to vote
FMCAD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
SAS
2000
Springer
15 years 4 months ago
2000
Springer
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...
139
Voted
LPNMR
1995
Springer
15 years 4 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...