276 search results - page 43 / 56 » From Model-Checking to Temporal Logic Constraint Solving |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
105
click to vote
CONSTRAINTS
2007
15 years 1 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
140
click to vote
JUCS
2006
15 years 1 months ago
2006
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
128
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...