Skip to main content
SpringerLink
Log in

Time for Verification

Essays in Memory of Amir Pnueli

  • Book
  • © 2010

Overview

Editors:
  1. Zohar Manna

    1. Computer Science Department, Stanford University, Stanford, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Doron A. Peled

    1. Department of Computer Science, Bar Ilan University, Ramat Gan, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

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

Access this book

Log in via an institution
eBook USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 chapters)

  1. Front Matter

    Download chapter PDF

  2. Modal and Temporal Argumentation Networks

    • Howard Barringer, Dov M. Gabbay
    Pages 1-25

  3. Knowledge Based Scheduling of Distributed Systems

    • Saddek Bensalem, Doron Peled, Joseph Sifakis
    Pages 26-41

  4. Quantitative Simulation Games

    • Pavol ÄŒerný, Thomas A. Henzinger, Arjun Radhakrishna
    Pages 42-60

  5. The Localization Reduction and Counterexample-Guided Abstraction Refinement

    • Edmund M. Clarke, Robert P. Kurshan, Helmut Veith
    Pages 61-71

  6. A Scalable Segmented Decision Tree Abstract Domain

    • Patrick Cousot, Radhia Cousot, Laurent Mauborgne
    Pages 72-95

  7. Towards Component Based Design of Hybrid Systems: Safety and Stability

    • Werner Damm, Henning Dierks, Jens Oehlerking, Amir Pnueli
    Pages 96-143

  8. Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars

    • Daniel Genkin, Nissim Francez, Michael Kaminski
    Pages 144-166

  9. Inference Rules for Proving the Equivalence of Recursive Procedures

    • Benny Godlin, Ofer Strichman
    Pages 167-184

  10. Some Thoughts on the Semantics of Biocharts

    • David Harel, Hillel Kugler
    Pages 185-194

  11. Unraveling a Card Trick

    • Tony Hoare, Natarajan Shankar
    Pages 195-201

  12. An Automata-Theoretic Approach to Infinite-State Systems

    • Orna Kupferman, Nir Piterman, Moshe Y. Vardi
    Pages 202-259

  13. On the Krohn-Rhodes Cascaded Decomposition Theorem

    • Oded Maler
    Pages 260-278

  14. Temporal Verification of Reactive Systems: Response

    • Zohar Manna, Amir Pnueli
    Pages 279-361

  15. The Arrow of Time through the Lens of Computing

    • Krishna V. Palem
    Pages 362-369

  16. What Is in a Step: New Perspectives on a Classical Question

    • Willem-Paul de Roever, Gerald Lüttgen, Michael Mendler
    Pages 370-399

  17. Back Matter

    Download chapter PDF
Back to top

Keywords

Editors and Affiliations

  • Computer Science Department, Stanford University, Stanford, USA

    Zohar Manna

  • Department of Computer Science, Bar Ilan University, Ramat Gan, Israel

    Doron A. Peled

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation