Skip to main content
  • Conference proceedings
  • © 1991

Automata, Languages and Programming

18th International Colloquium, Madrid, Spain, July 8-12, 1991. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 510)

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (60 papers)

  1. Front Matter

  2. On the semantics of logic programs

    • Maurizio Gabbrielli, Giorgio Levi
    Pages 1-19
  3. Logic programming with recurrence domains

    • Hong Chen, Jieh Hsiang
    Pages 20-34
  4. Extensional embedding of a strongly stable model of PCF

    • Antonio Bucciarelli, Thomas Ehrhard
    Pages 35-46
  5. Uniform ideals and strictness analysis

    • Christine Ernoult, Alan Mycroft
    Pages 47-59
  6. Logical and computational aspects of programming with sets/bags/lists

    • Val Breazu-Tannen, Ramesh Subrahmanyam
    Pages 60-75
  7. Safety for branching time semantics

    • A. Bouajjani, J. C. Fernandez, S. Graf, C. Rodriguez, J. Sifakis
    Pages 76-92
  8. Program composition and modular verification

    • Limor Fix, Nissim Francez, Orna Grumberg
    Pages 93-114
  9. Model-checking for probabilistic real-time systems

    • Rajeev Alur, Costas Courcoubetis, David Dill
    Pages 115-126
  10. Computing behavioural relations, logically

    • Rance Cleaveland, Bernhard Steffen
    Pages 127-138
  11. The power of reconfiguration

    • Y. Ben-Asher, D. Peleg, R. Ramaswami, A. Schuster
    Pages 139-150
  12. General resolution of tseitin formulas is hard

    • Jean-Denis Fouks
    Pages 151-162
  13. Program checkers for probability generation

    • Sampath Kannan, Andrew Yao
    Pages 163-173
  14. Running time to recognize nonregular languages by 2-way probabilistic automata

    • Jānis Kaņeps, Rūsiņš Freivalds
    Pages 174-185
  15. Statistics on random trees

    • R. Casas, J. Díaz, C. Martinez
    Pages 186-203
  16. The expressive power of implicit specifications

    • Kim Guldstrand Larsen
    Pages 204-216
  17. On confluent semi-commutations — Decidability and complexity results

    • Volker Diekert, Edward Ochmanski, Klaus Reinhardt
    Pages 229-241
  18. Lazard's factorizations of free partially commutative monoids

    • Gérard Duchamp, Daniel Krob
    Pages 242-253
  19. A Kleene theorem for infinite trace languages

    • Paul Gastin, Antoine Petit, Wieslaw Zielonka
    Pages 254-266

About this book

This volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP stands for International Colloquium on Automata, Languages, and Programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access