Formal Aspects of Computing, Volume 6

Volume 6, Number 1, 1994

• John Staples, Peter J. Robinson, Daniel Hazel: A Functional Logic for Higher Level Reasoning About Computation. 1-38
• Peter Nickolas: The Completeness of Functional Logic. 39-59 J. Strother Moore: A Formal Model of Asynchronous Communication and its Use in Mechanically Verifying a Biphase Mark Protocol. 60-91
• Glenn Bruns, Stuart Anderson: The Formalization and Analysis of a Communications Protocol. 92-112

Volume 6, Number 2, 1994

• Jan Friso Groote, Alban Ponse: Process Algebra with Guards: Combining Hoare Logic with Process Algebra. 115-164
• Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: A Theory of Processes with Localities. 165-200
• Luca Aceto: A Static View of Localities. 201-222
• Grigoris Antoniou: The Verification of Modules. 223-244

Volume 6, Number 3, 1994

• Jos C. M. Baeten, Jan A. Bergstra: On Sequential Compoisiton, Action Prefixes and Process Prefixes. 250-268
• Pierre America, Frank S. de Boer: Reasoning about Dynamically Evolving Process Structures. 269-316
• Bard Bloom: When is Partial Trace Equivalence Adequate? 317-338
• Chris Brink, Katarina Britz, Renate A. Schmidt: Peirce Algebras. 339-358

Volume 6, Number 4, 1994

• David M. Russinoff: A Mechanically Verified Incremental Garbage Collector. 359-390
• Karl J. Lieberherr, Walter L. Hürsch, Cun Xiao: Object-Extending Class Transformations. 391-416
• J. P. Wray, A. Stewart: Correct Translation of Data Parallel Assignment onto Array Processors. 417-439
• Peter Dybjer: Inductive Families. 440-465
• I. S. W. B. Prasetya: Error in the UNITY Rule for Subscripted Operators (Short Communication). 466-470

Volume 6, Number 5, 1994

• David H. Pitt, Paddy Byers: The Rest Says Unchanged (Concurrency and State-Based Specification). 471-494
• A. Prasad Sistla: Safety, Liveness and Fairness in Temporal Logic. 495-512
• Hans Hansson, Bengt Jonsson: A Logic for Reasoning about Time and Reliability. 512-535
• Chris M. N. Tofts: Processes with Probablities, Priority and Time. 536-564
• Peter Gorm Larsen: Repsonse to ``The Formal Specification of Safety Requirements for Storing Explosives'' (Short Communication). 565-568
• Iain S. C. Houston, Mark B. Josephs: Specifying Distributed CICS in Z: Accessing Local and Remote Resources (Short Communication). 569-579
• Leslie Lamport: How to Write a Long Formula (Short Communication). 580-584

Volume 6, Number 6, 1994

• Peter Gorm Larsen, Nico Plat, Hans Toetenel: A Formal Semantics of Data Flow Diagrams. 586-606
• K. Mani Chandy: Properties of Concurrent Programs. 607-619
• Arnon Avron, Nada Sasson: Stability, Sequentiality and Demand Driven Evaluation in Dataflow. 620-642
• Jifeng He, Jonathan P. Bowen: Specification, Verification and Prototyping of an Optimized Compiler. 643-658
• Yasuhiko Minamide: Sharing Analysis Based on Type Interface. 659-675
• Paola Inverardi, Corrado Priami, Daniel Yankelevich: Automatizing Parametric Reasoning on Distributed Concurrent Systems. 676-695
• Mike Stannett: Infinite Concurrent Systems-I. The Relationship between Metric and Order Convergence. 696-715
• Frank A. Stomp, Willem P. de Roever: A Principle for Sequential Reasoning about Distributed Algorithms. 716-737 , electronic supplement: full length version

Volume 6, Number 6A, 1994

• Krzysztof R. Apt, Elena Marchiori: Reasoning About Prolog Programs: From Modes Through Types to Assertions. 743-765
• Jan van Eijck: Presupposition Failure-A Comedy of Errors. 766-787
• Marcello M. Bonsangue, Joost N. Kok: The Weakest Precondition Calculus: Recursion and Duality. 788-800 , electronic supplement: full length version
• Jozef Hooman: Extending Hoare Logic to Real-Time. 801-826
• Michael R. Hansen: Model-Checking Discrete Duration Calculus. 826-845