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

Authors:
Boutheina Chetali;Barbara Heyd
Affiliations:
-;-
Venue:
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Year:
1997

Citing 0
Cited 3

Formal Verification of Concurrent Programs Using the Larch Prover

IEEE Transactions on Software Engineering
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract