## Theoretical Aspects of Computing -- ICTAC 2011: 8th International Colloquium, Johannesburg, South Africa, August 31 -- September 2, 2011, ProceedingsAntonio Cerone, Pekka Pihlajasaari This book constitutes the refereed proceedings of the 8th International Colloquium on Theoretical Aspects of Computing, ICTAC 2011 held in Johannesburg, South Africa, in August/September 2011. The 14 revised full papers presented together with the abstracts of three keynote talks were carefully reviewed and selected from 44 submissions. The papers address various theoretical aspects and methodological issues of computing and are organized in topical sections on grammars, semantics, modelling, the special track on formal aspects of software testing and grand challenge in verified software, on logics, as well as algorithms and types. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Virtual Time and Timeout in ClientServer Networks | 1 |

The Use of Mathematics in Software Development | 4 |

Infinitely Often Testing | 6 |

Axiomatizing Weak Ready Simulation Semantics over BCCSP | 7 |

Symbolic Worst Case Execution Times | 25 |

Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand | 45 |

On Characterization Definabilityand omega Saturated Models | 62 |

On the Complexity of Szilard Languages of Regulated Grammars | 77 |

Modal Interface Theories for CommunicationSafe Component Assemblies | 135 |

WP Semantics and Behavioral Subtyping | 154 |

Computing Preconditions and Postconditions of While Loops | 173 |

A Framework for Instantiating Pedagogic mLearning Objects Applications | 194 |

Emulating Primality with Multiset Representations of Natural Numbers | 218 |

Formal Verification of a LockFree Stack with Hazard Pointers | 239 |

Ambiguity of Unary Symmetric Difference NFAs | 256 |

267 | |

Energy Games in Multiweighted Automata | 95 |

Intersection Types for the Resource Control Lambda Calculi | 116 |

### Other editions - View all

### Common terms and phrases

algorithm assembly automata automaton axiomatizations behavioral subtyping behaviour bisimulation cactus graph calculus consider deﬁned Deﬁnition denote derivation dimensions edge encoding energy games ﬁrst function graph G ground-complete hazard pointer Heidelberg Hence in)equational input interface invariant relations isomorphisms L-simulations labels lambda calculus language learners Lemma linearizability LNCS lock-free logic longest path loop loop-bound Mertens function mLearning objects mobile devices mobile phones modal modal logic models MoLODUF MPrimes mprod mset multiset natural numbers node nonterminal notion object invariant operation path weights Petri net Pihlajasaari polynomial postcondition printItem problem proof properties Proposition ranging vector RCGs refinement regulated rewriting rule sentential form sequence simulation preorder simulation semantics specification Springer strongest postcondition sub-dimension superset SZLs Theorem transition traversed typable ultraproducts unary NFA upper bound variables verification VRPSD weak ready simulation weak simulation weakest precondition WP semantics