Logical analysis of demonic nondeterministic programs

Theoretical Computer Science

Volumn 166, Issue 1-2, 1996, Pages 173-202

  Demri, Stéphane ^a   Orłowska, Ewa ^b,c  

^a INPG IMAG   (France)

^b POLISH ACADEMY OF SCIENCES   (Poland)

^c NONE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; STATE SPACE METHODS; THEOREM PROVING;

DEMONIC NONDETERMINISTIC PROGRAMS; HILBERT STYLE PROOF SYSTEM; LOGICAL ANALYSIS; RELATIONAL LOGIC;

COMPUTER SOFTWARE;

EID: 0030258706     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00190-5     Document Type: Article

References (20)

1. R. Berghammer and H. Zierer, Relational algebraic semantics of deterministic and nondeterministic programs, Theoret. Comput. Sci. 43 (1986) 123-147.
2. M. Fischer and R. Ladner, Propositional dynamic logic of regular programs, J. Comput System Sci. 18 (1979) 194-211.
3. D. Gabbay, A general filtration method for modal logics, J. Philos. Logic 1 (1972) 29-34.
4. R.I. Goldblatt, Logics of Time and Computation, Lecture Notes, Vol. 7 (CSLI, Standford, 2nd ed., 1992).
5. G. Hughes and M. Cresswell, A Companion to Modal Logic (Methuen, London, 1984).
6. C. Hoare, I.J. Hayes, He Jifeng, C.C. Morgan, A.W. Roscoe, J.W. Sanders, I.H. Sorensen, J.M. Spivey and B.A. Sufrin, Laws of programming, Comm. ACM 30 (1987) 672-686.
7. D. Makinson, On some completeness theorems in modal logic, J. Symbolic Logic 12 (1966) 379-384.
8. G. Mirkowska, Algorithmic logic and its application in the theory of programs (I), Ann. Soc. Math. Polonae. Ser. IV: Fundamenta Informaticae I, (1977) 1-17.
9. G. Mirkowska, Algorithmic logic and its application in the theory of programs (II), Ann. Soc. Math. Polonae. Ser. IV: Fundamenta Informaticae I. (1977) 147-165.
10. T. Nguyen, A relational model of demonic nondeterministic programs, Internat. J. Foundation of Comput. Sci. 2(2) (1991) 101-131.
11. T. Nguyen, The connection between predicate logic and demonic relation calculus, in: Schloss Dagstuhl International Seminar 9403 on Relational Methods in Computer Science (1993).
12. E. Orłowska, Relational interpretation of modal logics, in: H. Andreka, D. Monk and I. Nemeti, eds., Algebraic logic. Colloquia Mathematica Societatis Janos Bolyai 54 (North Holland, Amsterdam, 1988) 443-471.
13. E. Orłowska, Algebraic aspects of the relational knowledge representation: modal relation algebras, in: D. Pearce and H. Wansing, eds., Nonclassical Logics and Information Processing, Lecture Notes in Artificial Intelligence, Vol. 619 (Springer, Verlag, Berlin, 1990).
14. E. Orłowska, Relational proof systems for some AI logics, in: Ph. Jorrand and J. Kelemen, eds., FAIR'91, Lecture Notes in Artificial Intelligence, Vol. 535 (Springer, Verlag, Berlin, 1991) 33-47.
15. E. Orłowska, Dynamic logic with program specifications and its relational proof system, Internat. J. Appl. Non-Classical Logics (1992).
16. V.R. Pratt, Semantical considerations on Floyd-Hoare logic, in: Proc. 17th IEEE Symp. Foundations of Comput. Sci. (1976) 109-121.
17. H. Rasiowa and R. Sikorski, The Mathematics of Metamathematics (PWN - Polish Scientific Publishers, Warsaw, 1963).
18. A. Salwicki, Formalized algorithmic languages, Bull Polish Acad. Sci. Math. 18 (1970) 227-232.
19. K. Segerberg, A completeness theorem in the modal logic of programs, in: T. Traczyk, ed., Universal Algebra and Applications, Banach Center Publications, Vol. 9 (PWN - Polish Scientific Publishers, Warsaw, 1982).
20. J. van Benthem, Correspondence Theory, in: D.M. Gabbay and F. Guenthner, eds., Handbook of Philosophical Logic, Vol. II (Reidel, Dordrecht, 1984) 167-247.