238 search results - page 19 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
AAAI
2007
14 years 12 months ago
2007
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 ...
180
Voted
POPL
2009
ACM
15 years 10 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
109
click to vote
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
TACAS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
SEMWEB
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...