Abstract
In this paper we present a temporal logic specification language for debugging parallel programs. We describe a partial order model of program runs over which a partial order temporal logic is defined. Furthermore we give an algorithm for proving whether a specification is satisfied by a program run. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.