PROCOMET 1998: Shelter Island, NY, USA

@proceedings{DBLP:conf/procomet/1998,
  editor    = {David Gries and
               Willem P. de Roever},
  title     = {Programming Concepts and Methods, IFIP TC2/WG2.2,2.3 International
               Conference on Programming Concepts and Methods (PROCOMET '98)
               8-12 June 1998, Shelter Island, New York, USA},
  booktitle = {PROCOMET},
  publisher = {Chapman {\&} Hall},
  series    = {IFIP Conference Proceedings},
  volume    = {125},
  year      = {1998},
  isbn      = {0-412-83760-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• K. Rustan M. Leino: Extended static checking. 1-2
• Carl-Johan H. Seger: From lattices to practical formal hardware verification. 3-4
• David Scott Warren: Programming with tabling in XSB. 5-6
• Werner Damm: Verifying electronic control unit: today and tomorrow. 7-8
• David Gries: Teaching calculational logic. 9-10
• Franco Barbanera, Mariangiola Dezani-Ciancaglini, Fer-Jan de Vries: Types for trees. 11-29
• O. Bastonero, Alberto Pravato, Simona Ronchi Della Rocca: Structures for lazy semantics. 30-48
• Frank S. de Boer, Nissim Francez, M. van Hulst, Frank A. Stomp: A proof theory of asynchronously communicating sequential processes. 49-67
• Michele Boreale, Cédric Fournet, Cosimo Laneve: Bisimulations in the join-calculus. 68-86
• Edmund M. Clarke, Somesh Jha, Wilfredo R. Marrero: Using state space exploration and a natural deduction style message derivation engine to verify security protocols. 87-106
• Karl Crary: Programming language semantics in foundational type theory. 107-125
• Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinksma: An algebraic approach to the specification of stochastic systems. 126-147
• Ewen Denney: Refinement types for specification. 148-166
• A. J. M. van Gasteren, A. Bijlsma: An extension of the program derivation format. 167-185
• Ian J. Hayes, Mark Utting: Deadlines are termination. 186-204
• Wim H. Hesselink: The design of a linearization of a concurrent data object. 205-224
• Furio Honsell, Marina Lenisa, Ugo Montanari, Marco Pistore: Final semantics for the pi-calculus. 225-243
• Michael Huth, Marta Z. Kwiatkowska: Comparing CTL and PCTL on labeled Markov chains. 244-262
• Richard B. Kieburtz: Reactive functional programming. 263-284
• Josva Kleist, Davide Sangiorgi: Imperative objects and mobile processes. 285-303
• Orna Kupferman, Moshe Y. Vardi: Relating linear and branching model checking. 304-326
• Zhiming Liu, Anders P. Ravn, Xiaoshan Li: Verifying duration properties of timed transition systems. 327-345
• David A. Naumann: Towards squiggly refinement algebra. 346-365
• Paritosh K. Pandya, H.-P. Wang, Qiwen Xu: Toward a theory of sequential hybrid programs. 366-384
• Cécile Péraire, Stéphane Barbey, Didier Buchs: Test selection for object-oriented software based on formal specifications. 385-403
• Arnd Poetzsch-Heffter, Peter Müller: Logical foundations for typed object-oriented languages. 404-423
• Shaz Qadeer, Natarajan Shankar: Verifying a self-stabilizing mutual exclusion algorithm. 424-443
• Z. Qiu, C. Zhou: A combination of interval logic and linear temporal logic. 444-461
• Axel Wabenhorst: A model of real-time distributed systems. 462-482