Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Twenty-Fourth Annual IEEE Symposium on

Logic in Computer Science (LICS 2009)

Paper: Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of CFL-Reachability for Threads Communicating via Locks (at LICS 2009)

Authors: Vineet Kahlon

Abstract

No Abstract Available

BibTeX

  @InProceedings{Kahlon-BoundednessvsUnboun,
    author = 	 {Vineet Kahlon},
    title = 	 {Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of CFL-Reachability for Threads Communicating via Locks},
    booktitle =  {Proceedings of the Twenty-Fourth Annual IEEE Symposium on Logic in Computer Science (LICS 2009)},
    year =	 {2009},
    month =	 {August}, 
    pages =      {27--36},
    location =   {Los Angeles, California, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2017-04-0512:37
Andrzej Murawski