Extending Ina Jo with temporal logic
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 15 (2), 181-197
- https://doi.org/10.1109/32.21744
Abstract
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.Keywords
This publication has 22 references indexed in Scilit:
- Proving precedence properties: The temporal wayPublished by Springer Nature ,2006
- Specifying graceful degradation in distributed systemsPublished by Association for Computing Machinery (ACM) ,1987
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- ASSPEGIQUE: An integrated environment for algebraic specificationsLecture Notes in Computer Science, 1985
- Formal Verification of a Secure Network with End-to-End EncryptionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- The modal logic of programsLecture Notes in Computer Science, 1979
- Verifying properties of parallel programsCommunications of the ACM, 1976
- An axiomatic basis for computer programmingCommunications of the ACM, 1969