Computer Science Logic

    Journal Publications

  1. B.Mahr and J.A.Makowsky,
    Characterizing specification languages which admit initial semantics,
    (full version) TCS 31 (1984) pp.49-60, (MR \# 85h:68044, ZB 536:68011).
    Extended abstract in:
    Proceedings of the 8th CAAP 1983, LNCS 159 (1983) pp.300-316, (MR \# 85e:68058, ZB 522: 68026). (Also: TR \# 232).
  2. J.A.Makowsky,
    Model theoretic issues in theoretical computer science, part I: Relational Data Bases and Abstract Data Types, in:
    Logic Colloquium '82, Proceedings of the Colloquium held in Florence 23-28 August 1982, G. Lolli et al. eds., North Holland 1984, pp. 303-343 (MR \# 86c:68056, ZB 553:68028). (Also: TR \# 270)
  3. M.Tiomkin and J.A.Makowsky,
    Propositional dynamic logic with local assignments,
    TCS vol. 36.1 (March 1985) pp.71-87. (Also: TR \# 234)
  4. O.Grumberg, N.Francez, J.A.Makowsky and W.de Roever,
    A proof rule for fair termination of guarded commands,
    Information and Control, vol. 66.1-2 (1986) pp.83-102.
    First version published in:
    Algorithmic languages, de Bakker ed., Amsterdam 1981,pp 399-416, (MR \# 83h:68024). (Also:TR \# 197)
  5. J.A.Makowsky and I.Sain,
    Weak second order characterizations of various program verification systems,
    TCS vol. 66 (1989), pp. 299-321. (Also: TR\# 457)
    First version published as:
    On the equivalence of weak second order and nonstandard time semantics for Floyd-Hoare logic, Proceedings of the First IEEE Symposium on Logic in Computer Science, Cambridge, Mass. 1986, pp.293-300 (Also: TR\# 395).
  6. M.Tiomkin and J.A.Makowsky,
    Decidability of finite probabilistic propositional dynamic logic,
    Information and Computation, vol. 94.2 (1991), pp. 180-203.
  7. Y. Bargury and J.A.Makowsky, The expressive power of transitive closure and 2-way multihead automata, Computer Science Logic,
    refereed papers from CSL'91, LNCS vol. 626 (1992) pp. 1-14.
  8. J.A. Makowsky and Y.B. Pnueli, Oracles and Quantifiers.
    Computer Science Logic, Refereed papers from CSL'93, LNCS, vol. 832, 1994, pp. 189-222.
  9. J.A. Makowsky and Y.B. Pnueli, Arity vs. Alternation in Second Order Logic.
    to appear in Annals of Pure and Applied Logic, 1995
    Conference version in: Logical Foundations of Computer Science-St. Petersburg 1994, LNCS, vol. 813, 1994, pp. 240-252.

    Invited Addresses

  10. J.A. Makowsky,
    The impact of model theory on computer science,
    Proceedings of the IX Congress of Logic, Methodology and Philosophy of Science, Uppsala 1991, D. Prawitz et al. eds., North Holland 1994, pp. 239-262.
  11. J.A. Makowsky,
    Capturing Complexity Classes with Lindstrom Quantifiers,
    Proceedings of the 19th International Symposium, MFCS'94 Kosice, Slovakia, LNCS vol. 841, 1994, pp. 68-71.

    Refereed conferences only

  12. J.A.Makowsky,
    Measuring the expressive power of dynamic logics: An application of abstract model theory,
    ICALP 1980, Lecture Notes in Computer Science vol.85, pp.409-421 (MR 82c \# 03022, ZB 465.68012).
    Erratum to "Measuring the expressive power of dynamic logic."
    ICALP 1981, Lecture Notes in Computer Science vol.115. (MR 82j \# 03021, ZB 465.68013).
  13. A. Calo and J.A. Makowsky,
    Ehrenfeucht-Fraisse games for transitive closure,
    Logical Foundations of Computer Science-Tver '92, LNCS vol. 620, 1992, pp. 57-69.
  14. J.A. Makowsky and E. Ravve,
    Incremental model checking for decomposable structures,
    Accepted for MFCS'95, Prague, August 1995. Preprint

    Submitted

  15. J.A. Makowsky and E. Ravve,
    Incremental model checking for safety properties on decomposable structures, Preprint
    submitted, January 1995.
  16. J.A. Makowsky and Y. Pnueli , Oracles and Lindstrom Quantifiers on Ordered Structures, journal version of CSL93 and LCC94 papers, submitted to Information and Computation.