K
[KF09] Lars Kuhtz and Bernd Finkbeiner. LTL Path Checking is Efficiently Parallelizable. In ICALP'09, Lecture Notes in Computer Science 5556, pages 235-246. Springer-Verlag, July 2009.
@inproceedings{icalp2009-KF,
  author =              {Kuhtz, Lars and Finkbeiner, Bernd},
  title =               {{LTL} Path Checking is Efficiently Parallelizable},
  editor =              {Albers, Susanne and Marchetti{-}Spaccamela Alberto
                         and Matias, Yossi and Nikoletseas, Sotiris and
                         Thomas, Wolfgang},
  booktitle =           {{P}roceedings of the 36th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'09)~-- Part~{II}},
  acronym =             {{ICALP}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5556},
  pages =               {235-246},
  year =                {2009},
  month =               jul,
}
List of authors