Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Propositional Dynamic Logic of looping and converse
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Propositional algorithmic logic PAL is a propositional counterpart of algorithmic logics. It investigates properties of program connectives: begin...end, while...do, if..then..else, or .... PAL supplies tools for reasoning about programs constructed from program variables by means of program connectives and about their algorithmic properties. Sound rules of inference and tautologies of PAL are as important in analysis of programs (e.g. verification) as tautologies of classical propositional calculus. On the other hand propositional algorithmic theories are of highest interest, since they can capture properties of data structures and also algorithmic properties of behaviours of concurrent systems. We proved that the semantical and the syntactical consequence operations coincide (completeness property) and that the model existence theorem holds.