128 search results - page 22 / 26 » Verifying Process Algebra Proofs in Type Theory |
133
Voted
IANDC
2006
15 years 3 months ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
241
Voted
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
151
Voted
IS
2006
15 years 3 months ago
2006
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
118
Voted
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
134
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...