


default search action
Theoretical Computer Science, Volume 373
Volume 373, Numbers 1-2, March 2007
- Sebastian Danicic, Mark Harman
, Robert M. Hierons
, John Howroyd, Michael R. Laurence:
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. 1-18 - Gerald Lüttgen, Walter Vogler:
Conjunction on processes: Full abstraction via ready-tree semantics. 19-40 - Franco Barbanera, Michele Bugliesi
, Mariangiola Dezani-Ciancaglini
, Vladimiro Sassone:
Space-aware ambients and processes. 41-69 - Manuel Clavel, José Meseguer, Miguel Palomino
:
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic. 70-91 - Yuxin Deng
, Catuscia Palamidessi
:
Axiomatizations for probabilistic finite-state behaviors. 92-114 - Ugo Dal Lago
, Angelo Montanari, Gabriele Puppis
:
Compact and tractable automaton-based representations of time granularities. 115-141 - Isar Stubbe
:
Towards "dynamic domains": Totally continuous cocomplete Q-categories. 142-160
Volume 373, Number 3, April 2007
- Peter D. Mosses
, Irek Ulidowski
:
Preface. 161-162
- Oana Andrei
, Gabriel Ciobanu
, Dorel Lucanu:
A rewriting logic framework for operational semantics of membrane systems. 163-181 - Samuel Hym, Matthew Hennessy:
Adding recursion to Dpi. 182-212 - José Meseguer, Grigore Rosu:
The rewriting logic semantics project. 213-237 - Mohammad Reza Mousavi
, Michel A. Reniers, Jan Friso Groote
:
SOS formats and meta-theory: 20 years after. 238-272 - Ando Saabas, Tarmo Uustalu
:
A compositional natural semantics and Hoare logic for low-level languages. 273-302

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.