509 search results - page 4 / 102 » On the completeness of compositional reasoning methods |
79
Voted
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
CADE
1994
Springer
15 years 1 months ago
1994
Springer
We present a completion-based method for handling a new version of E-unification, called "mixed" E-unification, that is a combination of the classical "universal&quo...
108
click to vote
COMPOS
1997
Springer
15 years 1 months ago
1997
Springer
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parall...
67
Voted
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
15 years 1 months ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
85
Voted
FMCO
2009
Springer
14 years 7 months ago
2009
Springer
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing wor...