Theoretical Computer Science, Volume 118

Volume 118, Number 1 1993

Selected Papers of the 15th International Symposium on Mathematical Foundations of Computer Science (MFCS'90), Banska Bystria, Czechoslovakia

Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier: Feasibility Problems for Recurring Tasks on one Processor. 3-20
Philippe Darondeau, Pierpaolo Degano: Refinement of Actions in Event Structures and Causal Trees. 21-48
Viliam Geffert: A Speed-Up Theorem Without Tape Compression. 49-79
Igor Walukiewicz: Gentzen-Type Axiomatization for PAL. 67-79
Ingo Wegener: BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small). 81-98

Pierre Deransart: Proof Methods of Declarative Properties of Definite Programs. 99-166
Hubert Comon: Complete Axiomatizations of Some Quotient Term Algebras. 167-191
Iain A. Stewart: Methods for Proving Completeness via Logical Reductions. 193-229
M. Draghicescu, S. Purushothaman: A Uniform Treatment of Order of Evalaution and Aggregate Update. 231-262
Jan Friso Groote: Transition System Specifications with Negative Premises. 263-299
Alex K. Simpson: A Characterisation of the Least-Fixed-Point Operator by Dinaturality. 301-314