3663 search results - page 496 / 733 » Problems in the ontology of computer programs |
224
click to vote
SPIN
2004
Springer
15 years 12 months ago
2004
Springer
Most approaches for model checking software are based on ration of abstract models from source code, which may greatly reduce the search space, but may also introduce errors that a...
188
click to vote
PPOPP
1999
ACM
15 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
173
click to vote
HPCA
1998
IEEE
15 years 11 months ago
1998
IEEE
Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous ...
212
click to vote
ISORC
1998
IEEE
15 years 11 months ago
1998
IEEE
Component-based software development would allow application software be largely constructed, rather than programmed. This approach would dramatically improve the productivity of ...
196
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...