Journal of Automated Reasoning (JAR), Volume 31

Volume 31, Number 1, 2003

• Robert Veroff:
  A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke. 1-9
  
• Lin Hai, Jigui Sun, Zhang Yimin:
  Theorem Proving Based on the Extension Rule. 11-21
  
• Geoff Sutcliffe, Christian B. Suttner:
  The CADE-18 ATP System Competition. 23-32
  
• Gilles Dowek, Thérèse Hardin, Claude Kirchner:
  Theorem Proving Modulo. 33-72
  
• Raffaella Gentilini, Carla Piazza, Alberto Policriti:
  From Bisimulation to Simulation: Coarsest Partition Problems. 73-103
  

Volume 31, Number 2, 2003

• Deepak Kapur:
  Announcement. 105-105
  
• Panagiotis Manolios, J. Strother Moore:
  Partial Functions in ACL2. 107-127
  
• Leo Bachmair, Ashish Tiwari, Laurent Vigneron:
  Abstract Congruence Closure. 129-168
  
• Peter B. Andrews:
  Herbrand Award Acceptance Speech. 169-187
  

Volume 31, Number 3-4, September 2003

• Amy P. Felty:
  Preface. 189-190
  
• Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, Zhaozhong Ni:
  A Syntactic Approach to Foundational Proof-Carrying Code. 191-229
  
• Andrew W. Appel, Neophytos G. Michael, Aaron Stump, Roberto Virga:
  A Trustworthy Proof Checker. 231-260
  
• David Aspinall, Adriana B. Compagnoni:
  Heap-Bounded Assembly Language. 261-302
  
• Eva Rose:
  Lightweight Bytecode Verification. 303-334
  
• James Riely, Matthew Hennessy:
  Trust and Partial Typing in Open Systems of Mobile Agents. 335-370