default search action
Theoretical Computer Science, Volume 365
Volume 365, Numbers 1-2, November 2006
- Frank S. de Boer, Marcello M. Bonsangue:
Preface. 1
- Luís Soares Barbosa, José Nuno Oliveira:
Transposing partial components - An exercise on coalgebraic refinement. 2-22 - Einar Broch Johnsen, Olaf Owe, Ingrid Chieh Yu:
Creol: A type-safe object-oriented model for distributed concurrent systems. 23-66 - Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski:
Games with secure equilibria. 67-82 - Ling Cheung, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager:
Switched PIOA: Parallel composition via distributed scheduling. 83-108 - Jifeng He, Xiaoshan Li, Zhiming Liu:
rCOS: A refinement calculus of object systems. 109-142 - David A. Naumann, Michael Barnett:
Towards imperative modules: Reasoning about invariants and sharing of mutable state. 143-168
Volume 365, Number 3, November 2006
- Ralph Kopperman, Prakash Panangaden, Michael B. Smyth, Dieter Spreen, Julian Webster:
Foreword. 169-170
- Samy Abbes, Klaus Keimel:
Projective topology on bifinite domains and applications. 171-183 - Kinetsu Abe, Justin Bisceglio, David R. Ferguson, Thomas J. Peters, Alexander Russell, Takis Sakkalis:
Computational topology for isotopic surface reconstruction. 184-198 - Lisbeth Fajstrup:
Cubical local partial orders on cubically subdivided spaces - Existence and construction. 199-205 - Jonathan Gratus, Timothy Porter:
A spatial view of information. 206-215 - Göran Hamrin, Viggo Stoltenberg-Hansen:
Two categories of effective continuous cpos. 216-236 - Hans-Peter A. Künzi, Homeira Pajoohesh, Michel P. Schellekens:
Partial quasi-metrics. 237-246 - Martin Raußen:
Deadlocks and dihomotopy in mutual exclusion models. 247-257 - Victor L. Selivanov:
Towards a descriptive set theory for domain-like structures. 258-282
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.