4488 search results - page 806 / 898 » Properties of NP-Complete Sets |
SIGSOFT
2009
ACM
14 years 8 months ago
2009
ACM
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...
SIGSOFT
2008
ACM
14 years 8 months ago
2008
ACM
Getting the right software requirements under the right environment assumptions is a critical precondition for developing the right software. This task is intrinsically difficult....
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
SIGSOFT
2004
ACM
14 years 8 months ago
2004
ACM
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...