6. AMAST 1997: Sydney, Australia

@proceedings{DBLP:conf/amast/1997,
  editor    = {Michael Johnson},
  title     = {Algebraic Methodology and Software Technology, 6th International
               Conference, AMAST '97, Sydney, Australia, December 13-17, 1997,
               Proceedings},
  booktitle = {AMAST},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1349},
  year      = {1997},
  isbn      = {3-540-63888-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Slim Ben Lamine, John Plaice:
  Software Configuration with Information Systems. 1-15
  
• Yves Bertot:
  Head-Tactics Simplification. 16-29
  
• Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes:
  Iteration 2-Theories: Extended Abstract. 30-44
  
• Glenn Bruns, Ian Sutherland:
  Model Checking and Fault Tolerance. 45-59
  
• Bettina Buth, Michel Kouvaras, Jan Peleska, Hui Shi:
  Deadlock Analysis for a Fault-Tolerant System. 60-74
  
• Pietro Cenciarelli, Alexander Knapp, Bernhard Reus, Martin Wirsing:
  From Sequential to Multi-Threaded Java: An Event-Based Operational Semantics. 75-90
  
• Maura Cerioli, Anne Elisabeth Haxthausen, Bernd Krieg-Brückner, Till Mossakowski:
  Permissive Subsorted Partial Logic in CASL. 91-107
  
• Antonio Cerone, George J. Milne:
  Specification of Timing Constraints within the Circal Process Algebra. 108-122
  
• Xiao Jun Chen, Flavio Corradini:
  On the Specification and Verification of Performance Properties for a Timed Process Algebra. 123-137
  
• Patrick Cousot, Radhia Cousot:
  Abstract Interpretation of Algebraic Polynomial Systems (Extended Abstract). 138-154
  
• Martin de Groot, Ken Robinson:
  Modular Refinement and Model Building. 155-169
  
• Grit Denker, Jaime Ramos, Carlos Caleiro, Amílcar Sernadas:
  A Linear Temporal Logic Approach to Objects with Transactions. 170-184
  
• Xiaoqun Du, Kevin T. McDonnell, Evangelos Nanos, Y. S. Ramakrishna, Scott A. Smolka:
  Software Design, Specification, and Verification: Lessons Learned from the Rether Case Study. 185-198
  
• Colin J. Fidge:
  Refinement Rules for Real-Time Multi-tasking Programs. 199-215
  
• Robert B. France, Jean-Michel Bruel, Maria M. Larrondo-Petrie, Emanuel S. Grant:
  Rigorous Object-Oriented Modeling: Integrating Formal and Informal Notations. 216-230
  
• Roberto Giacobazzi, Francesco Ranzato:
  Completeness in Abstract Interpretation: A Domain Perspective. 231-245
  
• John Harrison:
  Floating Point Verification in HOL Light: The Exponential Function. 246-260
  
• Jozef Hooman:
  Verification of Distributed Real-Time and Fault-Tolerant Protocols. 261-275
  
• Bart Jacobs:
  Invariants, Bisimulations and the Correctness of Coalgebraic Refinements. 276-291
  
• Tomasz Janowski:
  On Bisimulation, Fault-Monotonicity and Provable Fault-Tolerance. 292-306
  
• Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
  Span(Graph): A Categorial Algebra of Transition Systems. 307-321
  
• Piergiulio Katis, Nicoletta Sabadini, Robert F. C. Walters:
  Representing Place/Transition Nets in Span(Graph). 322-336
  
• David Lesens:
  Invariants of Parameterized Binary Tree Networks as Greatest Fixpoints. 337-350
  
• Nicole Lévy, Jeanine Souquières:
  Modelling Specification Construction by Successive Approximations. 351-364
  
• Sébastien Limet, Frédéric Saubion:
  On Partial Validation of Logic Programs. 365-379
  
• Antónia Lopes, José Luiz Fiadeiro:
  Preservation and Reflection in Specification. 380-394
  
• Richard F. Paige:
  Case Studies in Using a Meta-Method for Formal Method Integration. 395-408
  
• Joachim Parrow, Björn Victor:
  The Update Calculus (Extended Abstract). 409-423
  
• Frank Piessens, Eric Steegmans:
  Selective Attribute Elimination for Categorial Data Specifications. 424-436
  
• Sreeranga P. Rajan, Masahiro Fujita:
  ATM Switch Design: Parametric High-Level Modeling and Formal Verification. 437-450
  
• Arno Schönegge:
  The Hidden Function Question Revisited. 451-464
  
• Amílcar Sernadas, Cristina Sernadas, Carlos Caleiro:
  Synchronization of Logics with Mixed Rules: Completeness Preservation. 465-478
  
• Carron Shankland, Muffy Thomas:
  Symbolic Bisimulation for Full LOTOS. 479-493
  
• Martin Simons, Michel Sintzoff:
  Algebraic Composition and Refinement of Proofs. 494-508
  
• Alastair Telford, David Turner:
  Ensuring Streams Flow. 509-523
  
• Irek Ulidowski, Shoji Yuen:
  Extending Process Languages with Time. 524-538
  
• Farn Wang, Pao-Ann Hsiung:
  Parametric Analysis of Computer Systems. 539-553
  

Systems and Tools Demonstrations

• José João Almeida, Luís Soares Barbosa, F. L. Neves, José Nuno Oliveira:
  CAMILA: Prototyping and Refinement of Constructive Specifications. 554-559
  
• Bettina Buth:
  PAMELA + PVS. 560-562
  
• Antonio Cerone, Alex J. Cowie, George J. Milne:
  The Circal System. 563-564
  
• Rowan Davies:
  Refinement-Type Checker for Standard ML. 565-566
  
• Jim Grundy, Thomas Långbacka:
  Recording HOL Proofs in a Structured Browsable Format. 567-571
  
• C. K. Low:
  Analysing Multi-Agent System Traces with IDaF. 572-573
  
• Maris A. Ozols, Katherine A. Eastaughffe, Anthony Cant:
  DOVE: A Tool for Design Oriented Verification and Evaluation. 574-575
  
• Ken Robinson:
  The B Method and the B Toolkit. 576-580
  
• Teodor Rus, Tom Halverson, Eric Van Wyk, Robert Kooima:
  An Algebraic Language Processing Environment. 581-585
  
• Owen Traynor, Daniel Hazel, Peter Kearney, Andrew Martin, Ray Nickson, Luke Wildman:
  The Cogito Development System. 586-591
  

Last update Mon Feb 13 04:18:46 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page