M. Frey, Andreas Weininger
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.>
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.>
Key concepts: Debugging, Programming language, Computer science, Temporal logic, Algorithmic program debugging, Order (exchange), Theoretical computer science, Finance