Journals in DBLP

J. Log. Algebr. Program.
2001, volume: 49, number: 1-2

1. Reinhard Kahle, Thomas Studer
   Formalizing non-termination of recursive programs. [Citation Graph (0, 0)][DBLP]
   J. Log. Algebr. Program., 2001, v:49, n:1-2, pp:1-14 [Journal]
   
2. Jeremy Avigad
   Algebraic proofs of cut elimination. [Citation Graph (0, 0)][DBLP]
   J. Log. Algebr. Program., 2001, v:49, n:1-2, pp:15-30 [Journal]
   
3. Jan Friso Groote, Jan Springintveld
   Focus points and convergent process operators: a proof strategy for protocol verification. [Citation Graph (0, 0)][DBLP]
   J. Log. Algebr. Program., 2001, v:49, n:1-2, pp:31-60 [Journal]
   
4. Hans Zantema, Jaco van de Pol
   A rewriting approach to binary decision diagrams. [Citation Graph (0, 0)][DBLP]
   J. Log. Algebr. Program., 2001, v:49, n:1-2, pp:61-86 [Journal]