@inproceedings{Kahlon:2009:BVU:1606752.1607436,
    Address = {Washington, DC, USA},
    Author = {Kahlon, Vineet},
    BookTitle = {Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science},
    File = {Boundedness vs. Unboundedness of Lock Chains Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks - Kahlon (0) (0) - a - a - l.pdf},
    ISBN = {978-0-7695-3746-7},
    Keywords = {Concurrent Programs, Locks, Reachability, Dataflow analysis},
    Pages = {27--36},
    Publisher = {IEEE Computer Society},
    Series = {LICS '09},
    Title = {Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks},
    URL = {http://dx.doi.org/10.1109/LICS.2009.45},
    Year = {2009},
    acmid = {1607436},
    bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2009.45},
    date-added = {2013-11-24 12:49:53 +0000},
    date-modified = {2013-11-24 12:49:53 +0000},
    numpages = {10},
    doi = {10.1109/LICS.2009.45}
}

@inproceedings{Kahlon:2009:BVU:1606752.1607436, Address = {Washington, DC, USA}, Author = {Kahlon, Vineet}, BookTitle = {Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science}, File = {Boundedness vs. Unboundedness of Lock Chains Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks - Kahlon (0) (0) - a - a - l.pdf}, ISBN = {978-0-7695-3746-7}, Keywords = {Concurrent Programs, Locks, Reachability, Dataflow analysis}, Pages = {27--36}, Publisher = {IEEE Computer Society}, Series = {LICS '09}, Title = {Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks}, URL = {http://dx.doi.org/10.1109/LICS.2009.45}, Year = {2009}, acmid = {1607436}, bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2009.45}, date-added = {2013-11-24 12:49:53 +0000}, date-modified = {2013-11-24 12:49:53 +0000}, numpages = {10}, doi = {10.1109/LICS.2009.45} }