Journals in DBLP

Theor. Comput. Sci.
2003, volume: 290, number: 1

1. Marios Mavronicolas, Nikos Papadakis
   Trade-off results for connection management. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:1-57 [Journal]
   
2. Frank A. Stomp
   Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:59-78 [Journal]
   
3. Didier Caucal
   On infinite transition graphs having a decidable monadic theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:79-115 [Journal]
   
4. Marco Bernardo, Mario Bravetti
   Performance measure sensitive congruences for Markovian process algebras. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:117-160 [Journal]
   
5. Olivier Laurent
   Polarized proof-nets and lambda-µ-calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:161-188 [Journal]
   
6. Silvio Valentini
   A cartesian closed category in Martin-Löf's intuitionistic type theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:189-219 [Journal]
   
7. Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni
   Bounded time-stamping in message-passing systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:221-239 [Journal]
   
8. Parosh Aziz Abdulla, Bengt Jonsson
   Model checking of systems with many identical timed processes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:241-264 [Journal]
   
9. Dorel Lucanu
   Relaxed models for rewriting logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:290, n:1, pp:265-289 [Journal]
   
10. Cesare Tinelli, Christophe Ringeissen
    Unions of non-disjoint theories and combinations of satisfiability procedures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:291-353 [Journal]
    
11. Mario Bravetti, Alessandro Aldini
    Discrete time generative-reactive probabilistic processes with different advancing speeds. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:355-406 [Journal]
    
12. Franco Barbanera, Stefano Berardi
    A full continuous model of polymorphism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:407-428 [Journal]
    
13. Koji Nakazawa
    Confluency and strong normalizability of call-by-value lambda-µ-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:429-463 [Journal]
    
14. Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini
    A comparison of Statecharts step semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:465-498 [Journal]
    
15. Carlos Iván Chesñevar, Jürgen Dix, Frieder Stolzenburg, Guillermo Ricardo Simari
    Relating defeasible and normal logic programming through transformation properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:499-529 [Journal]
    
16. Patrick Cousot, Radhia Cousot
    Parsing as abstract interpretation of grammar semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:531-544 [Journal]
    
17. Zhaohui Zhu, Bin Li, Xian Xiao, Shifu Chen, Wujia Zhu
    A representation theorem for recovering contraction relations satisfying wci. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:545-564 [Journal]
    
18. Luca de Alfaro, Arjun Kapur
    Hybrid diagrams. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:565-597 [Journal]
    
19. Fabio Alessi, Paolo Baldan, Furio Honsell
    A category of compositional domain-models for separable Stone spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:599-635 [Journal]
    
20. Luca Bernardinello, Carlo Ferigato, Lucia Pomello
    An algebraic model of observable properties in distributed systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:637-668 [Journal]
    
21. Toon Calders, Jan Paredaens
    Axiomatization of frequent itemsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:669-693 [Journal]
    
22. Roberto M. Amadio, Denis Lugiez, Vincent Vanackère
    On the symbolic reduction of processes with cryptographic functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:695-740 [Journal]
    
23. Cosimo Laneve
    A type system for JVM threads. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:741-778 [Journal]
    
24. Yuxi Fu, Zhenrong Yang
    Understanding the mismatch combinator in chi calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:779-830 [Journal]
    
25. Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd
    Equivalence of conservative, free, linear program schemas is decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:831-862 [Journal]
    
26. Roberta Gori
    An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:863-936 [Journal]
    
27. Mauno Rönkkö, Anders P. Ravn, Kaisa Sere
    Hybrid action systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:937-973 [Journal]
    
28. Steffen van Bakel, Maribel Fernández
    Normalization, approximation, and semantics for combinator systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:975-1019 [Journal]
    
29. Reinhard Pichler
    Explicit versus implicit representations of subsets of the Herbrand universe. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:1021-1056 [Journal]
    
30. Fabio Martinelli
    Analysis of security protocols as open systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:1057-1106 [Journal]
    
31. Thierry Coquand
    A syntactical proof of the Marriage Lemma. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:1107-1113 [Journal]