Formal Verification of Concurrent Programs in LP and in COQ: A Comparative Analysis

Boutheina Chetali, Barbara Heyd. Formal Verification of Concurrent Programs in LP and in COQ: A Comparative Analysis. In Elsa L. Gunter, Amy P. Felty, editors, Theorem Proving in Higher Order Logics, 10th International Conference, TPHOLs 97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings. Volume 1275 of Lecture Notes in Computer Science, pages 69-85, Springer, 1997.

@inproceedings{ChetaliH97,
  title = {Formal Verification of Concurrent Programs in LP and in COQ: A Comparative Analysis},
  author = {Boutheina Chetali and Barbara Heyd},
  year = {1997},
  tags = {program analysis, program verification, analysis},
  researchr = {https://researchr.org/publication/ChetaliH97},
  cites = {0},
  citedby = {0},
  pages = {69-85},
  booktitle = {Theorem Proving in Higher Order Logics, 10th International Conference, TPHOLs 97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings},
  editor = {Elsa L. Gunter and Amy P. Felty},
  volume = {1275},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-63379-0},
}