A Generic Theorem Prover of CSP Refinement

@inproceedings{Isobe2005AGT,
  title={A Generic Theorem Prover of CSP Refinement},
  author={Yoshinao Isobe and Markus Roggenbach},
  booktitle={TACAS},
  year={2005}
}
We describe a new tool called CSP-Prover which is an interactive theorem prover dedicated to refinement proofs within the process algebra CSP. It aims specifically at proofs for infinite state systems, which may also involve infinite non-determinism. Semantically, Csp-Prover supports both the theory of complete metric spaces as well as the theory of complete partial orders. Both these theories are implemented for infinite product spaces. Technically, Csp-Prover is based on the theorem prover… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 39 CITATIONS

Translation Validation of High-Level Synthesis

  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2008
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Automated refinement checking of concurrent systems

  • 2007 IEEE/ACM International Conference on Computer-Aided Design
  • 2007
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

CSP Revisited

VIEW 13 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.