Abstract
We present in this paper a shallow embedding of Linear Temporal Logic in the Calculus of Inductive Constructions. Our axiomatization is based on a co-inductive representation of program executions. Temporal operators are implemented as co-inductive (respectively inductive) types when they are greatest (respectively least) fixpoints, and several generic lemmas are proved to allow elegant and efficient reasoning in practical cases. This work results in several reusable libraries in the Coq proof-assistant.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
