some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

RECENTLY PUBLISHED

Refinement and Difference for Probabilistic Automata

  
Benoît Delahaye, Uli Fahrenberg, Kim G. Larsen and Axel Legay

A Concurrent Pattern Calculus

  
Thomas Given-Wilson, Daniele Gorla and Barry Jay

On Ramsey properties of classes with forbidden trees

  
Jan Foniok

Deciding Conditional Termination

  
Radu Iosif, Filip Konecny and Marius Bozga

Representations of measurable sets in computable measure theory

  
Klaus Weihrauch and Nazanin Tavana-Roshandel

Finite state verifiers with constant randomness

  
Cem Say and Abuzer Yakaryılmaz




Logical Methods in Computer Science is an open-access journal, covered by Thompson ISI , SCOPUS, DBLP, Mathematical Reviews and Zentralblatt. Impact factor: 0.443. All journal content is licensed under a Creative Commons license.