2896 search results - page 388 / 580 » Curricula Modeling and Checking |
171
click to vote
DNA
2005
Springer
16 years 2 days ago
2005
Springer
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
184
click to vote
TACAS
2005
Springer
16 years 19 hour ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
161
click to vote
PASTE
2004
ACM
15 years 12 months ago
2004
ACM
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
170
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
144
click to vote
TACAS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...