Extending Ina Jo with Temporal Logic

The authors give both informal and formal descriptions of both the current Ina Jo specification language and Ina Jo enhanced with temporal logic. They include details of a simple example to demonstrate the use of the proof system and details of an extended example to demonstrate the expressiveness of the enhanced language. The authors discuss their language design goals, decisions, and their implications. >

[1]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[2]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1 , 1985, EATCS Monographs on Theoretical Computer Science.

[3]  Maurice Herlihy,et al.  Specifying Graceful Degradation , 1991, IEEE Trans. Parallel Distributed Syst..

[4]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[5]  Donald I. Good,et al.  Principles of proving concurrent programs in Gypsy , 1979, POPL '79.

[6]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[7]  Brent Hailpern.  Verifying Concurrent Processes Using Temporal Logic , 1982, Lecture Notes in Computer Science.

[8]  Zohar Manna,et al.  The Modal Logic of Programs , 1979, ICALP.

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10]  Dines Bjørner,et al.  A Formal Model of a Generalized CSP-like Language , 1980, IFIP Congress.

[11]  Zohar Manna,et al.  Proving Precedence Properties: The Temporal Way , 1983, ICALP.

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

[13]  Lawrence Robinson,et al.  SPECIAL - A Specification and Assertion Language. , 1976 .

[14]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[15]  Maurice Herlihy,et al.  Specifying graceful degradation in distributed systems , 1987, PODC '87.

[16]  Christine Choppy,et al.  ASSPEGIQUE: An Integrated Environment for Algebraic Specifications , 1985, TAPSOFT, Vol.2.

[17]  Edmund M. Clarke,et al.  Automatic Verification of Sequential Circuits Using Temporal Logic , 1986, IEEE Transactions on Computers.

[18]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

[19]  James J. Horning,et al.  The Larch Family of Specification Languages , 1985, IEEE Software.

[20]  Flaviu Cristian.  A Rigorous Approach to Fault-Tolerant System Development (Extended Abstract) , 1983, Logic of Programs.

[21]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[22]  Mary Shaw,et al.  Specifying reliability as a software attribute , 1982 .

[23]  Reiji Nakajima,et al.  The IOTA Programming System , 1983, Lecture Notes in Computer Science.

[24]  Ben C. Moszkowski,et al.  A Temporal Logic for Multi-Level Reasoning About Hardware, , 1982 .

[25]  P. M. Melliar-Smith,et al.  Formal Specification and Mechanical Verification of SIFT: A Fault-Tolerant Flight Control System , 1982, IEEE Transactions on Computers.

[26]  Manfred Broy,et al.  Specification and Top Down Design of Distributed Systems , 1985, TAPSOFT, Vol.1.

[27]  Pamela Zave,et al.  An Operational Approach to Requirements Specification for Embedded Systems , 1982, IEEE Transactions on Software Engineering.

[28]  D. E. Britton.  Formal Verification of a Secure Network with End-to-End Encryption , 1984, 1984 IEEE Symposium on Security and Privacy.

[29]  David R. Musser,et al.  Abstract Data Type Specification in the Affirm System , 1980, IEEE Transactions on Software Engineering.