some image logo

HOME

SEARCH

REGULAR ISSUES

SPECIAL ISSUES

CURRENT ISSUE

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

CONTACT

RECENTLY PUBLISHED

Formalising the pi-calculus using nominal logic

  
Jesper Bengtson and Joachim Parrow

Explicit fairness in testing semantics

  
Flavio Corradini, Diletta Cacciagrano and Catuscia Palamidessi

Polygraphic programs and polynomial-time functions

  
Guillaume Bonfante and Yves Guiraud

Universal Structures and the logic of Forbidden Patterns

  
Florent R. Madelaine

Simulating reachability using first-order logic with applications to verification of linked data structures

  
Tal Lev-Ami, Neil Immerman, Thomas W Reps, Mooly Sagiv, Siddharth Srivastava and Greta Yorsh

Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi

  
Jose Espirito Santo, Ralph Matthes and Luis Pinto




Logical Methods in Computer Science is an open-access journal. All journal content is licensed under a Creative Commons license.