The must preorder revisited: an algebraic theory for web services contracts
暂无分享,去创建一个
[1] Matthew Hennessy,et al. Acceptance trees , 1985, JACM.
[2] Dorothea Beringer,et al. Using CDL in a UDDI Registry 1.0: UDDI Working Draft Best Practices Document , 2001 .
[3] Matthew Hennessy,et al. Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.
[4] Rocco De Nicola,et al. Testing Equivalences for Processes , 1984, Theor. Comput. Sci..
[5] Simon J. Gay,et al. Subtyping for session types in the pi calculus , 2005, Acta Informatica.
[6] Sagar Chaki,et al. Types as models: model checking message-passing programs , 2002, POPL '02.
[7] Rocco De Nicola,et al. CCS without tau's , 1987, TAPSOFT, Vol.1.
[8] Flemming Nielson,et al. Higher-order concurrent programs with finite communication topology (extended abstract) , 1994, POPL '94.
[9] Nobuko Yoshida,et al. Structured Communication-Centred Programming for Web Services , 2007, ESOP.
[10] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[11] Cosimo Laneve,et al. A Formal Account of Contracts for Web Services , 2006, WS-FM.
[12] Roberto Chinnici,et al. Web Services Description Language (WSDL) Version 2.0 Part 1: Core Language , 2007 .
[13] Mario Bravetti,et al. Towards a Unifying Theory for Choreography Conformance and Contract Compliance , 2007, SC@ETAPS.
[14] Francisco Curbera,et al. Web Services Business Process Execution Language Version 2.0 , 2007 .