1138 search results - page 107 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
CSMR
2006
IEEE
14 years 2 months ago
2006
IEEE
As size and complexity of software systems increase, preserving the design and specification of their implementation structure gains importance in order to maintain the evolvabil...
FM
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
IJISEC
2008
13 years 8 months ago
2008
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
RE
2008
Springer
13 years 7 months ago
2008
Springer
NASA spends millions designing and building spacecraft for its missions. The dependence on software is growing as spacecraft become more complex. With the increasing dependence on...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...