64. Birthday: Zohar Manna, 2003

@proceedings{DBLP:conf/birthday/2003manna,
  editor    = {Nachum Dershowitz},
  title     = {Verification: Theory and Practice, Essays Dedicated to Zohar
               Manna on the Occasion of His 64th Birthday},
  booktitle = {Verification: Theory and Practice},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2772},
  year      = {2003},
  isbn      = {3-540-21002-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Frontispiece: Zohar Manna

• Nachum Dershowitz:
  Pæan to Zohar Manna. 1-10
  

Technical Papers

• Martín Abadi, K. Rustan M. Leino:
  A Logic of Object-Oriented Programs. 11-41
  
• Rajeev Alur:
  Formal Analysis of Hierarchical State Machines. 42-66
  
• Saddek Bensalem, Susanne Graf, Yassine Lakhnech:
  Abstraction as the Key for Invariant Verification. 67-99
  
• Dines Bjørner:
  Domain Engineering: a "Radical Innovation" for Software and Systems Engineering? A Biased Account. 100-144
  
• Egon Börger:
  The ASM Ground Model Method as a Foundation for Requirements Engineering. 145-160
  
• Manfred Broy:
  A Functional Calculus for Specification and Verification of Nondeterministic Interactive Systems. 161-181
  
• Domenico Cantone, Eugenio G. Omodeo, Jacob T. Schwartz, Pietro Ursino:
  Notes from the Logbook of a Proof-Checker's Project. 182-207
  
• Edmund M. Clarke, Helmut Veith:
  Counterexamples Revisited: Principles, Algorithms, Applications. 208-224
  
• Hubert Comon-Lundh, Ralf Treinen:
  Easy Intruder Deductions. 225-242
  
• Patrick Cousot:
  Verification by Abstract Interpretation. 243-268
  
• Luca de Alfaro:
  Game Models for Open Systems. 269-289
  
• Erika Ábrahám, Frank S. de Boer, Willem P. de Roever, Martin Steffen:
  A Compositional Operational Semantics for Java_MT. 290-303
  
• Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park:
  Bounded Fairness. 304-317
  
• Alfredo Ferro, Rosalba Giugno, Alfredo Pulvirenti:
  Efficient Boundary Values Generation in General Metric Spaces for Software Component Testing. 318-331
  
• Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Marco A. A. Sanvido:
  Extreme Model Checking. 332-358
  
• Gérard P. Huet:
  Automata Mista. 359-372
  
• Shmuel Katz, Marcelo Sihman:
  Aspect Validation Using Model Checking. 373-394
  
• Vijay Chandru, Jean-Louis Lassez:
  Qualitative Theorem Proving in Linear Constraints. 395-406
  
• Nazareno Aguirre, T. S. E. Maibaum:
  Some Institutional Requirements for Temporal Reasoning on Dynamic Reconfiguration of Component Based Systems. 407-435
  
• Rocco De Nicola, Gian Luigi Ferrari, Ugo Montanari, Rosario Pugliese, Emilio Tuosto:
  A Formal Basis for Reasoning on Programmable QoS. 436-479
  
• Ben C. Moszkowski:
  A Hierarchical Completeness Proof for Propositional Temporal Logic. 480-523
  
• Krishna V. Palem:
  Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective. 524-547
  
• Elsa L. Gunter, Doron Peled:
  Unit Checking: Symbolic Model Checking for a Unit of Code. 548-567
  
• Dusko Pavlovic, Peter Pepper, Douglas R. Smith:
  Colimits for Concurrent Collectors. 568-597
  
• Amir Pnueli, Tamarah Arons:
  TLPVS: A PVS-Based LTL Verification System. 598-625
  
• Enrico Marzano, Angelo Montanari, Alberto Policriti:
  Binary Extensions of S1S and the Composition Method. 626-644
  
• John H. Reif, William L. Scherlis:
  Deriving Effcient Graph Algorithms. 645-681
  
• Sriram Sankaranarayanan, Henny Sipma, Zohar Manna:
  Petri Net Analysis Using Invariant Generation. 682-701
  
• Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
  Fair Equivalence Relations. 702-732
  
• Jean Vuillemin:
  Digital Algebra and Circuits. 733-746
  
• Richard J. Waldinger, Peter Jarvis, Jennifer L. Dungan:
  Program Synthesis for Multi-agent Question Answering. 747-761
  
• Calogero G. Zarba:
  Combining Sets with Elements. 762-782