Formal verification of parallel programs
Communications of the ACM
First-Order Dynamic Logic
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
On synchronization and its specification
CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
The Temporal Semantics of Concurrent Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Specifying and proving properties of sentinel processes
ICSE '81 Proceedings of the 5th international conference on Software engineering
Axiomatic proof techniques for parallel programs.
Axiomatic proof techniques for parallel programs.
The specification and application to programming of abstract data types.
The specification and application to programming of abstract data types.
Database system based on intensional logic
COLING '80 Proceedings of the 8th conference on Computational linguistics
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
We present in this paper a pseudo functional language and a specification language both of which are designed to describe systems of synchronized processes with shared resources. The semantics of the pseudo functional language is defined by translating its statements to the set of formulas of intensional logic. The specification language contains formulas of the logic, hence its semantics can be treated by the model theory as usual. A proof method for the program written in the language is proposed. Time dependent aspects of processes are described in terms of intensional logic. Specification of parallel systems can be described in a well structured manner in our specification language, more precisely, they are described hierarchically according to the function decomposition of the system, and at each level of the hierarchy the configuration of processes and resources and time dependent properties are separately described. Resources are defined as an abstract data type with synchronization specification. We give an example of specification and a proof of a program written in the parallel pseudo functional programming language.