509 search results - page 2 / 102 » On the completeness of compositional reasoning methods |
BMCBI
2008
13 years 5 months ago
2008
Background: Historically, two categories of computational algorithms (alignment-based and alignment-free) have been applied to sequence comparison
LICS
1998
IEEE
13 years 8 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
CC
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
ICWS
2003
IEEE
13 years 6 months ago
2003
IEEE
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
TVLSI
2008
13 years 5 months ago
2008
Abstract--We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifica...