294 search results - page 50 / 59 » Formal Verification of the Implementability of Timing Requir... |
PAKM
2000
15 years 6 days ago
2000
The core of the new product development [NPD] process centers on knowledge creation, utilization and the management of knowledge. This manuscript uses a software firm case to esta...
SIROCCO
2008
15 years 8 days ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
AAAI
1993
15 years 5 days ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
ICSE
2008
IEEE-ACM
15 years 11 months ago
2008
IEEE-ACM
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
184
click to vote
POPL
2004
ACM
15 years 11 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...