557 search results - page 48 / 112 » Calculi for Service-Oriented Computing |
ISMVL
1994
IEEE
14 years 1 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
CCS
2009
ACM
14 years 3 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
TOPLAS
2010
13 years 7 months ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
RELMICS
1997
Springer
14 years 1 months ago
1997
Springer
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
FOSAD
2000
Springer
14 years 20 days ago
2000
Springer
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...