Journals in DBLP

Theor. Comput. Sci.
2007, volume: 373, number: 1-2

1. 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. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:373, n:1-2, pp:1-18 [Journal]
   
2. Gerald Lüttgen, Walter Vogler
   Conjunction on processes: Full abstraction via ready-tree semantics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:373, n:1-2, pp:19-40 [Journal]
   
3. Franco Barbanera, Michele Bugliesi, Mariangiola Dezani-Ciancaglini, Vladimiro Sassone
   Space-aware ambients and processes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:373, n:1-2, pp:41-69 [Journal]
   
4. Manuel Clavel, José Meseguer, Miguel Palomino
   Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:373, n:1-2, pp:70-91 [Journal]
   
5. Yuxin Deng, Catuscia Palamidessi
   Axiomatizations for probabilistic finite-state behaviors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:373, n:1-2, pp:92-114 [Journal]
   
6. Ugo Dal Lago, Angelo Montanari, Gabriele Puppis
   Compact and tractable automaton-based representations of time granularities. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:373, n:1-2, pp:115-141 [Journal]
   
7. Isar Stubbe
   Towards "dynamic domains": Totally continuous cocomplete Q-categories. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:373, n:1-2, pp:142-160 [Journal]