A Machine Verified Distributed Sorting Algorithm
暂无分享,去创建一个
[1] F. Pfenning. Logic programming in the LF logical framework , 1991 .
[2] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .
[3] Colin Stirling,et al. Modal and temporal logics , 1993, LICS 1993.
[4] K. V. S. Prasad. Programming with Broadcasts , 1993, CONCUR.
[5] Jaap van Oosten. The modified realizability topos , 1997 .
[6] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[7] Arne Skou,et al. Specification and Automated Verification of Real-Time Behaviour —A Case Study , 1996 .
[8] Thore Husfeldt,et al. A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth , 1996 .
[9] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .
[10] Luca Aceto,et al. Axiomatizing Prefix Iteration with Silent Steps , 1995, Inf. Comput..
[11] Mogens Nielsen,et al. Open Maps, Behavioural Equivalences, and Congruences , 1996, Theor. Comput. Sci..
[12] K. V. S. Prasad. A Calculus of Broadcasting Systems , 1991, Sci. Comput. Program..
[13] Luca Aceto,et al. On the Finitary Bisimulation , 1995 .
[14] Jaap van Oosten. Topological Aspects of Traces , 1995 .
[15] K. V. S. Prasad. Broadcasting with Priority , 1994, ESOP.
[16] Madhavan Mukund,et al. Determinizing Asynchronous Automata on Infinite Inputs , 1995 .