论文信息 - Specifying Concurrent Program Based on TLA

Specifying Concurrent Program Based on TLA

. The Temporal logic of actions TLA is a logic for specifying and reasoning about concurrent systems, which make systems and their properties are expressed in the same logic. In this paper, we introduce the concurrent programming languages and behavior semantics, mainly describe safety properties and liveness properties in TLA and take NeedhamSchroeder symmetric key protocol as an example to illustrate how to specify these properties in concurrent program by TLA.

Rui Chen | Shi Gong Long

[1] Leslie Lamport,et al. Specifying Concurrent Program Modules , 1983, TOPL.

[2] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.

[3] Viktor Vafeiadis,et al. Modular Safety Checking for Fine-Grained Concurrency , 2007, SAS.

[4] Michael Kaminski,et al. The Expressive Power of Temporal Logic of Actions (Extended Abstract) , 1999, CONCUR.

[5] Wolfgang Reif,et al. Interactive Verification of Concurrent Systems using Symbolic Execution , 2010, LPAR Workshops.

[6] Michael Kaminski,et al. The Expressive Power of Temporal Logic of Actions , 2002, J. Log. Comput..

[7] Swarat Chaudhuri,et al. Symbolic pruning of concurrent program executions , 2009, ESEC/FSE '09.

[8] Martín Abadi,et al. Analyzing security protocols with secrecy types and logic programs , 2002, POPL '02.