Sciweavers

1024 search results - page 56 / 205
» Compositional Methods for Probabilistic Systems
Sort
View
LCPC
1992
Springer
14 years 3 days ago
A Calculus of Gamma Programs
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...
Chris Hankin, Daniel Le Métayer, David Sand...
ICSE
1997
IEEE-ACM
14 years 6 days ago
A Theory of Probabilistic Functional Testing
We propose a framework for “probabilistic functional testing.” The success of a test data set generated according to our method guarantees a certain level of confidence into ...
Gilles Bernot, Laurent Bouaziz, Pascale Le Gall
AAAI
2007
13 years 10 months ago
Making the Difference in Semantic Web Service Composition
Automation of Web service composition is one of the most interesting challenges facing the Semantic Web today. In this paper we propose a mean of performing automated Web service ...
Freddy Lécué, Alexandre Delteil
PODC
1994
ACM
14 years 4 days ago
Open Systems in TLA
We describe a method for writing assumption/guarantee specifications of concurrent systems. We also provide a proof rule for reasoning about the composition of these systems. Spec...
Martín Abadi, Leslie Lamport
CCS
2003
ACM
14 years 1 months ago
Secure protocol composition
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
Anupam Datta, Ante Derek, John C. Mitchell, Dusko ...