3268 search results - page 453 / 654 » Structured Service Composition |
189
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
186
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
178
click to vote
ICLP
2005
Springer
16 years 13 hour ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
194
click to vote
EMSOFT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
197
click to vote
APN
1992
Springer
15 years 10 months ago
1992
Springer
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...