W
[Wag87] Klaus W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science 51:53-80. Elsevier, 1987.
@article{tcs51()-Wag,
  author =              {Wagner, Klaus W.},
  title =               {More complicated questions about maxima and minima,
                         and some closures of~{NP}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {51},
  pages =               {53-80},
  year =                {1987},
}
[Wag88] Klaus W. Wagner. On Restricting the Access to an NP-Oracle. In ICALP'88, Lecture Notes in Computer Science 317, pages 682-696. Springer-Verlag, July 1988.
@inproceedings{icalp1988-Wag,
  author =              {Wagner, Klaus W.},
  title =               {On Restricting the Access to an NP-Oracle},
  editor =              {Lepist{\"o}, Timo and Salomaa, Arto},
  booktitle =           {{P}roceedings of the 15th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'88)},
  acronym =             {{ICALP}'88},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {317},
  pages =               {682-696},
  year =                {1988},
  month =               jul,
}
[Wag90] Klaus W. Wagner. Bounded Query Classes. SIAM Journal on Computing 19(5):833-846. Society for Industrial and Applied Math., October 1990.
@article{siamjcomp19(5)-Wag,
  author =              {Wagner, Klaus W.},
  title =               {Bounded Query Classes},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {19},
  number =              {5},
  pages =               {833-846},
  year =                {1990},
  month =               oct,
}
[Wal96] Igor Walukiewicz. Pushdown Processes: Games and Model Checking. In CAV'96, Lecture Notes in Computer Science 1102, pages 234-263. Springer-Verlag, July 1996.
@inproceedings{cav1996-Wal,
  author =              {Walukiewicz, Igor},
  title =               {Pushdown Processes: Games and Model Checking},
  editor =              {Alur, Rajeev and Henzinger, Thomas A.},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'96)},
  acronym =             {{CAV}'96},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1102},
  pages =               {234-263},
  year =                {1996},
  month =               jul,
}
[Wal00] Igor Walukiewicz. Model Checking CTL Properties of Pushdown Systems. In FSTTCS'00, Lecture Notes in Computer Science 1974, pages 127-138. Springer-Verlag, December 2000.
@inproceedings{fsttcs2000-Wal,
  author =              {Walukiewicz, Igor},
  title =               {Model Checking {CTL} Properties of Pushdown Systems},
  editor =              {Kapoor, Sanjiv and Prasad, Sanjiva},
  booktitle =           {{P}roceedings of the 20th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'00)},
  acronym =             {{FSTTCS}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1974},
  pages =               {127-138},
  year =                {2000},
  month =               dec,
}
[Wal01] Dan S. Wallach. Copy Protection Technology is Doomed. IEEE Computer 34(10):48-49. IEEE Comp. Soc. Press, October 2001.
@article{ieeecomp34(10)-Wal,
  author =              {Wallach, Dan S.},
  title =               {Copy Protection Technology is Doomed},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Computer},
  volume =              {34},
  number =              {10},
  pages =               {48-49},
  year =                {2001},
  month =               oct,
}
[Wal02] Igor Walukiewicz. Monadic second order logic on tree-like structures. Theoretical Computer Science 275(1-2):311-346. Elsevier, March 2002.
@article{tcs275(1-2)-Wal,
  author =              {Walukiewicz, Igor},
  title =               {Monadic second order logic on tree-like structures},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {275},
  number =              {1-2},
  pages =               {311-346},
  year =                {2002},
  month =               mar,
}
[Wal04] Igor Walukiewicz. A Landscape with Games in the Background. In LICS'04, pages 356-366. IEEE Comp. Soc. Press, July 2004.
@inproceedings{lics2004-Wal,
  author =              {Walukiewicz, Igor},
  title =               {A Landscape with Games in the Background},
  booktitle =           {{P}roceedings of the 19th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'04)},
  acronym =             {{LICS}'04},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {356-366},
  year =                {2004},
  month =               jul,
}
[Wan01] Farn Wang. Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram. In FORTE'01, IFIP Conference Proceedings 197, pages 235-250. Chapman & Hall, August 2001.
@inproceedings{forte2001-Wan,
  author =              {Wang, Farn},
  title =               {Symbolic Verification of Complex Real-Time Systems
                         with Clock-Restriction Diagram},
  editor =              {Kim, Myungchul and Chin, Byoungmoon and Kang,
                         Sungwon and Lee, Danhyung},
  booktitle =           {{P}roceedings of the 21st {IFIP} {TC6/WG6.1}
                         {I}nternational {C}onference on {F}ormal
                         {T}echniques for {N}etworked and {D}istributed
                         {S}ystems ({FORTE}'01)},
  acronym =             {{FORTE}'01},
  publisher =           {Chapman \& Hall},
  series =              {IFIP Conference Proceedings},
  volume =              {197},
  pages =               {235-250},
  year =                {2001},
  month =               aug,
}
[Wan04] Farn Wang. Efficient verification of timed automata with BDD-like data structures. International Journal on Software Tools for Technology Transfer 6(1):77-97. Springer-Verlag, July 2004.
@article{sttt6(1)-Wan,
  author =              {Wang, Farn},
  title =               {Efficient verification of timed automata with
                         {BDD}-like data structures},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {6},
  number =              {1},
  pages =               {77-97},
  year =                {2004},
  month =               jul,
  doi =                 {10.1007/s10009-003-0135-4},
}
[Wan04] Farn Wang. Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions. In AMAST'04, Lecture Notes in Computer Science 3116, pages 553-567. Springer-Verlag, July 2004.
@inproceedings{amast2004-Wan,
  author =              {Wang, Farn},
  title =               {Model-Checking Distributed Real-Time Systems with
                         States, Events, and Multiple Fairness Assumptions},
  editor =              {Rattray, Charles and Maharaj, Savi and Shankland,
                         Carron},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {A}lgebraic {M}ethodology and
                         {S}oftware {T}echnology ({AMAST}'04)},
  acronym =             {{AMAST}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3116},
  pages =               {553-567},
  year =                {2004},
  month =               jul,
}
[Wan08] Farn Wang. Efficient Model-Checking of Dense-Time Systems with Time-Convexity Analysis. In RTSS'08, pages 195-205. IEEE Comp. Soc. Press, November 2008.
@inproceedings{rts2008-Wan,
  author =              {Wang, Farn},
  title =               {Efficient Model-Checking of Dense-Time Systems with
                         Time-Convexity Analysis},
  booktitle =           {{P}roceedings of the 29th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'08)},
  acronym =             {{RTSS}'08},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {195-205},
  year =                {2008},
  month =               nov,
  doi =                 {10.1109/RTSS.2008.53},
}
[Wan13] Farn Wang. Efficient Model-Checking of Dense-Time Systems with Time-Convexity Analysis. Theoretical Computer Science 467:89-108. Elsevier, January 2013.
@article{tcs467-Wan,
  author =              {Wang, Farn},
  title =               {Efficient Model-Checking of Dense-Time Systems with
                         Time-Convexity Analysis},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {467},
  pages =               {89-108},
  year =                {2013},
  month =               jan,
  doi =                 {10.1016/j.tcs.2012.09.019},
}
[War62] Stephen Warshall. A Theorem on Boolean Matrices. Journal of the ACM 9(1):11-12. ACM Press, January 1962.
@article{jacm9(1)-War,
  author =              {Warshall, Stephen},
  title =               {A~Theorem on Boolean Matrices},
  publisher =           {ACM Press},
  journal =             {Journal of the ACM},
  volume =              {9},
  number =              {1},
  pages =               {11-12},
  year =                {1962},
  month =               jan,
  doi =                 {10.1145/321105.321107},
}
[WBB+10] Ralf Wimmer, Bettina Braitling, Bernd Becker, Pepijn Crouzen, Holger Hermanns, Abhishek Dhama, and Oliver E. Theel. Symblicit calculation of long-run averages for concurrent probabilistic systems. In QEST'10, pages 27-36. IEEE Comp. Soc. Press, September 2010.
@inproceedings{qest2010-WBBHCHDT,
  author =              {Wimmer, Ralf and Braitling, Bettina and Becker,
                         Bernd and Crouzen, Pepijn and Hermanns, Holger and
                         Dhama, Abhishek and Theel, Oliver E.},
  title =               {Symblicit calculation of long-run averages for
                         concurrent probabilistic systems},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {Q}uantitative {E}valuation of
                         {S}ystems ({QEST}'10)},
  acronym =             {{QEST}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {27-36},
  year =                {2010},
  month =               sep,
}
[WBE08] Thomas Wahl, Nicolas Blanc, and E. Allen Emerson. SVISS: Symbolic Verification of Symmetric Systems. In TACAS'08, Lecture Notes in Computer Science 4963, pages 459-462. Springer-Verlag, March 2008.
@inproceedings{tacas2008-WBE,
  author =              {Wahl, Thomas and Blanc, Nicolas and Emerson, E.
                         Allen},
  title =               {{SVISS}: Symbolic Verification of Symmetric Systems},
  editor =              {Ramakrishnan, C. R. and Rehof, Jakob},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'08)},
  acronym =             {{TACAS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4963},
  pages =               {459-462},
  year =                {2008},
  month =               mar,
  doi =                 {10.1007/978-3-540-78800-3_34},
}
[WD04] Michael Wooldridge and Paul E. Dunne. On the Computational Complexity of Qualitative Coalition Games. Artificial Intelligence 158(1):27-73. Elsevier, September 2004.
@article{ai158(1)-WD,
  author =              {Wooldridge, Michael and Dunne, Paul E.},
  title =               {On the Computational Complexity of Qualitative
                         Coalition Games},
  publisher =           {Elsevier},
  journal =             {Artificial Intelligence},
  volume =              {158},
  number =              {1},
  pages =               {27-73},
  year =                {2004},
  month =               sep,
  doi =                 {10.1016/j.artint.2004.04.002},
}
[Web09] Michael Weber. On the Complexity of Branching-Time Logics. In CSL'09, Lecture Notes in Computer Science 5771, pages 530-545. Springer-Verlag, September 2009.
@inproceedings{csl2009-Web,
  author =              {Weber, Michael},
  title =               {On the Complexity of Branching-Time Logics},
  editor =              {Gr{\"a}del, Erich and Kahle, Reinhard},
  booktitle =           {{P}roceedings of the 23rd {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'09)},
  acronym =             {{CSL}'09},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5771},
  pages =               {530-545},
  year =                {2009},
  month =               sep,
}
[Wee05] Hoeteck Wee. On Obfuscating Point Functions. In STOC'05, pages 523-532. ACM Press, May 2005.
@inproceedings{stoc2005-Wee,
  author =              {Wee, Hoeteck},
  title =               {On Obfuscating Point Functions},
  editor =              {Gabow, Harold N. and Fagin, Ronald},
  booktitle =           {{P}roceedings of the 37th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'05)},
  acronym =             {{STOC}'05},
  publisher =           {ACM Press},
  pages =               {523-532},
  year =                {2005},
  month =               may,
}
[Wei97] Volker Weispfenning. Complexity and Uhiformity of Elimination in Presburger Arithmetic. In ISSAC'97, pages 48-53. ACM Press, July 1997.
@inproceedings{issac1997-Wei,
  author =              {Weispfenning, Volker},
  title =               {Complexity and Uhiformity of Elimination in
                         {P}resburger Arithmetic},
  editor =              {K{\"u}chlin, Wolfgang},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {S}ymposium on {S}ymbolic and {A}lgebraic
                         {C}omputation ({ISSAC}'97)},
  acronym =             {{ISSAC}'97},
  publisher =           {ACM Press},
  pages =               {48-53},
  year =                {1997},
  month =               jul,
}
[Wei99] Volker Weispfenning. Mixed Real-Integer Linear Quantifier Elimination. In ISSAC'99, pages 129-136. ACM Press, July 1999.
@inproceedings{issac1999-Wei,
  author =              {Weispfenning, Volker},
  title =               {Mixed Real-Integer Linear Quantifier Elimination},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {S}ymposium on {S}ymbolic and {A}lgebraic
                         {C}omputation ({ISSAC}'99)},
  acronym =             {{ISSAC}'99},
  publisher =           {ACM Press},
  pages =               {129-136},
  year =                {1999},
  month =               jul,
}
[Wei04] Pascal Weil. Algebraic Recognizability of Languages. In MFCS'04, Lecture Notes in Computer Science 3153, pages 149-175. Springer-Verlag, August 2004.
@inproceedings{mfcs2004-Wei,
  author =              {Weil, Pascal},
  title =               {Algebraic Recognizability of Languages},
  editor =              {Fiala, Ji{ r}{\'\i} and Koubek, V{\'a}clav and
                         Kratoch{\'\i}l, Jan},
  booktitle =           {{P}roceedings of the 29th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'04)},
  acronym =             {{MFCS}'04},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3153},
  pages =               {149-175},
  year =                {2004},
  month =               aug,
}
[WH91] Howard Wong-Toi and Gérard Hoffmann. The Control of Dense Real-Time Discrete Event Systems. In CDC'91, pages 1527-1528. IEEE Comp. Soc. Press, December 1991.
@inproceedings{cdc1991-WH,
  author =              {Wong{-}Toi, Howard and Hoffmann, G{\'e}rard},
  title =               {The Control of Dense Real-Time Discrete Event
                         Systems},
  booktitle =           {{P}roceedings of the 30th {IEEE} {C}onference on
                         {D}ecision and {C}ontrol ({CDC}'91)},
  acronym =             {{CDC}'91},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {1527-1528},
  year =                {1991},
  month =               dec,
}
[WH08] Libor Waszniowski and Zdeněk Hanzálek. Formal verification of multitasking applications based on timed automata model. Real-Time Systems 38(1):39-65. Kluwer Academic, January 2008.
@article{rts38(1)-WH,
  author =              {Waszniowski, Libor and Hanz{\'a}lek, Zden{{e}}k},
  title =               {Formal verification of multitasking applications
                         based on timed automata model},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {38},
  number =              {1},
  pages =               {39-65},
  year =                {2008},
  month =               jan,
}
[WvdH+07] Dirk Walther, Wiebe van der Hoek, and Michael Wooldridge. Alternating-time Temporal Logic with Explicit Strategies. In TARK'07, pages 269-278. June 2007.
@inproceedings{tark2007-WHW,
  author =              {Walther, Dirk and van der Hoek, Wiebe and
                         Wooldridge, Michael},
  title =               {Alternating-time Temporal Logic with Explicit
                         Strategies},
  editor =              {Samet, Dov},
  booktitle =           {{P}roceedings of the 11th {C}onference on
                         {T}heoretical {A}spects of {R}ationality and
                         {K}nowledge ({TARK}'07)},
  acronym =             {{TARK}'07},
  pages =               {269-278},
  year =                {2007},
  month =               jun,
  doi =                 {10.1145/1324249.1324285},
}
[WHY06] Farn Wang, Geng-Dian Huang, and Fang Yu. TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering. IEEE Transactions on Software Engineering 32(7):510-526. IEEE Comp. Soc. Press, July 2006.
@article{tse32(7)-WHY,
  author =              {Wang, Farn and Huang, Geng-Dian and Yu, Fang},
  title =               {{TCTL} Inevitability Analysis of Dense-Time Systems:
                         From Theory to Engineering},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {32},
  number =              {7},
  pages =               {510-526},
  year =                {2006},
  month =               jul,
}
[WHY11] Farn Wang, Chung-Hao Huang, and Fang Yu. A Temporal Logic for the Interaction of Strategies. In CONCUR'11, Lecture Notes in Computer Science 6901, pages 466-481. Springer-Verlag, September 2011.
@inproceedings{concur2011-WHY,
  author =              {Wang, Farn and Huang, Chung-Hao and Yu, Fang},
  title =               {A~Temporal Logic for the Interaction of Strategies},
  editor =              {Katoen, Joost-Pieter and K{\"o}nig, Barbara},
  booktitle =           {{P}roceedings of the 22nd {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'11)},
  acronym =             {{CONCUR}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6901},
  pages =               {466-481},
  year =                {2011},
  month =               sep,
}
[Wig92] Avi Wigderson. The Complexity of Graph Connectivity. In MFCS'92, Lecture Notes in Computer Science 629, pages 112-132. Springer-Verlag, August 1992.
@inproceedings{mfcs1992-Wig,
  author =              {Wigderson, Avi},
  title =               {The Complexity of Graph Connectivity},
  editor =              {Havel, Ivan M. and Koubek, V{\'a}clav},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'92)},
  acronym =             {{MFCS}'92},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {629},
  pages =               {112-132},
  year =                {1992},
  month =               aug,
}
[Wil94] Thomas Wilke. Specifying Timed State Sequence in Powerful Decidable Logics and Timed Automata (Extended Abstract). In FTRTFT'94, Lecture Notes in Computer Science 863, pages 694-715. Springer-Verlag, September 1994.
@inproceedings{ftrtft1994-Wil,
  author =              {Wilke, Thomas},
  title =               {Specifying Timed State Sequence in Powerful
                         Decidable Logics and Timed Automata (Extended
                         Abstract)},
  editor =              {Langmaack, Hans and de Roever, Willem-Paul and
                         Vytopil, Jan},
  booktitle =           {{P}roceedings of the 3rd {F}ormal {T}echniques in
                         {R}eal-Time and {F}ault-Tolerant {S}ystems
                         ({FTRTFT}'94)},
  acronym =             {{FTRTFT}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {863},
  pages =               {694-715},
  year =                {1994},
  month =               sep,
}
[Wil99] Thomas Wilke. CTL+ is exponentially more succinct than CTL. In FSTTCS'99, Lecture Notes in Computer Science 1738, pages 110-121. Springer-Verlag, December 1999.
@inproceedings{fsttcs1999-Wil,
  author =              {Wilke, Thomas},
  title =               {{CTL}{\(^+\)} is exponentially more succinct
                         than~{CTL}},
  editor =              {Rangan, C. Pandu and Raman, Venkatesh and Ramanujam,
                         R.},
  booktitle =           {{P}roceedings of the 19th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'99)},
  acronym =             {{FSTTCS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1738},
  pages =               {110-121},
  year =                {1999},
  month =               dec,
}
[Wil99] Thomas Wilke. Classifying Discrete Temporal Properties. In STACS'99, Lecture Notes in Computer Science 1563, pages 32-46. Springer-Verlag, March 1999.
@inproceedings{stacs1999-Wil,
  author =              {Wilke, Thomas},
  title =               {Classifying Discrete Temporal Properties},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {32-46},
  year =                {1999},
  month =               mar,
}
[Wil01] Thomas Wilke. Alternating tree automata, parity games, and modal μ-calculus. Bulletin of the Belgian Mathematical Society – Simon Stevin 8(2):359-391. Belgian Mathematical Society, 2001.
@article{bbms8(2)-Wil,
  author =              {Wilke, Thomas},
  title =               {Alternating tree automata, parity games, and modal
                         {{\(\mu\)}}-calculus},
  publisher =           {Belgian Mathematical Society},
  journal =             {Bulletin of the Belgian Mathematical Society~--
                         Simon Stevin},
  volume =              {8},
  number =              {2},
  pages =               {359-391},
  year =                {2001},
}
[Win04] Aaron Windsor. A Simple Proof that Finding a Macimal Independent Set in a Graph is in NC. Information Processing Letters 92(4):185-187. Elsevier, November 2004.
@article{ipl92(4)-Win,
  author =              {Windsor, Aaron},
  title =               {A Simple Proof that Finding a Macimal Independent
                         Set in a Graph is in~{\(\mathcal{NC}\)}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {92},
  number =              {4},
  pages =               {185-187},
  year =                {2004},
  month =               nov,
}
[WL69] Richard J. Waldinger and Richard C. T. Lee. PROW: a step towards automatic program writing. In IJCAI'69, pages 241-252. William Kaufmann Inc., May 1969.
@inproceedings{ijcai1969-WL,
  author =              {Waldinger, Richard J. and Lee, Richard C. T.},
  title =               {{PROW}: a~step towards automatic program writing},
  editor =              {Walker, Donald E. and Norton, Lewis M.},
  booktitle =           {{P}roceedings of the 1st {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'69)},
  acronym =             {{IJCAI}'69},
  publisher =           {William Kaufmann Inc.},
  pages =               {241-252},
  year =                {1969},
  month =               may,
}
[WL90] Pierre Wolper and Vinciane Lovinfosse. Verifying Properties of Large Sets of Processes with Network Invariants. In CAV'89, Lecture Notes in Computer Science 407, pages 68-80. Springer-Verlag, 1990.
@inproceedings{cav1989-WL,
  author =              {Wolper, Pierre and Lovinfosse, Vinciane},
  title =               {Verifying Properties of Large Sets of Processes with
                         Network Invariants},
  editor =              {Sifakis, Joseph},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {A}utomatic {V}erification {M}ethods for {F}inite
                         {S}tate {S}ystems ({CAV}'89)},
  acronym =             {{CAV}'89},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {407},
  pages =               {68-80},
  year =                {1990},
  confyear =            {1989},
  confmonth =           {6},
}
[WLT11] Matthias Woehrle, Kai Lampka, and Lothar Thiele. Segmented State Space Traversal for Conformance Testing of Cyber-Physical Systems. In FORMATS'11, Lecture Notes in Computer Science 6919, pages 193-208. Springer-Verlag, September 2011.
@inproceedings{formats2011-WLT,
  author =              {Woehrle, Matthias and Lampka, Kai and Thiele,
                         Lothar},
  title =               {Segmented State Space Traversal for Conformance
                         Testing of Cyber-Physical Systems},
  editor =              {Fahrenberg, Uli and Tripakis, Stavros},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'11)},
  acronym =             {{FORMATS}'11},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6919},
  pages =               {193-208},
  year =                {2011},
  month =               sep,
}
[WLW+06] Dirk Walther, Carsten Lutz, Frank Wolter, and Michael Wooldridge. ATL Satisfiability is Indeed EXPTIME-Complete. Journal of Logic and Computation 16(6):765-787. Oxford University Press, December 2006.
@article{jlc16(6)-WLWW,
  author =              {Walther, Dirk and Lutz, Carsten and Wolter, Frank
                         and Wooldridge, Michael},
  title =               {{ATL} Satisfiability is Indeed {EXPTIME}-Complete},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {16},
  number =              {6},
  pages =               {765-787},
  year =                {2006},
  month =               dec,
  doi =                 {10.1093/logcom/exl009},
}
[Wol83] Pierre Wolper. Temporal Logic Can Be More Expressive. Information and Control 56(1-2):72-99. Academic Press, 1983.
@article{icont56(1-2)-Wol,
  author =              {Wolper, Pierre},
  title =               {Temporal Logic Can Be More Expressive},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {56},
  number =              {1-2},
  pages =               {72-99},
  year =                {1983},
}
[Wol00] Pierre Wolper. Constructing Automata from Temporal Logic Formulas: A Tutorial. In Lectures on Formal Methods and Performance Analysis – Revised Lectures of the 1st EEF/Euro Summer School on Trends in Computer Science, Lecture Notes in Computer Science 2090, pages 261-277. Springer-Verlag, July 2000.
@inproceedings{eef2000-Wol,
  author =              {Wolper, Pierre},
  title =               {Constructing Automata from Temporal Logic Formulas:
                         A Tutorial},
  editor =              {Brinksma, Ed and Hermanns, Holger and Katoen,
                         Joost-Pieter},
  booktitle =           {{L}ectures on {F}ormal {M}ethods and {P}erformance
                         {A}nalysis~-- {R}evised {L}ectures of the 1st
                         {EEF}/{E}uro {S}ummer {S}chool on {T}rends in
                         {C}omputer {S}cience},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2090},
  pages =               {261-277},
  year =                {2000},
  month =               jul,
}
[Wra76] Celia Wrathall. Complete Sets and the Polynomial-Time Hierarchy. Theoretical Computer Science 3(1):23-33. Elsevier, 1976.
@article{tcs3(1)-Wra,
  author =              {Wrathall, Celia},
  title =               {Complete Sets and the Polynomial-Time Hierarchy},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {3},
  number =              {1},
  pages =               {23-33},
  year =                {1976},
}
[WS07] Volker Weber and Thomas Schwentick. Dynamic Complexity Theory Revisited. Theory of Computing Systems 40(4):355-377. Springer-Verlag, June 2007.
@article{tcsyst40(4)-WS,
  author =              {Weber, Volker and Schwentick, Thomas},
  title =               {Dynamic Complexity Theory Revisited},
  publisher =           {Springer-Verlag},
  journal =             {Theory of Computing Systems},
  volume =              {40},
  number =              {4},
  pages =               {355-377},
  year =                {2007},
  month =               jun,
}
[WSH15] Farn Wang, Sven Schewe, and Chung-Hao Huang. An extension of ATL with Strategy Interaction. ACM Transactions on Programming Languages and Systems 37(3). ACM Press, June 2015.
@article{toplas37(3)-WSH,
  author =              {Wang, Farn and Schewe, Sven and Huang, Chung-Hao},
  title =               {An~extension of~{ATL} with Strategy Interaction},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Programming Languages and
                         Systems},
  volume =              {37},
  number =              {3},
  year =                {2015},
  month =               jun,
  doi =                 {10.1145/2734117},
}
[WVS83] Pierre Wolper, Moshe Y. Vardi, and A. Prasad Sistla. Reasoning about Infinite Computation Paths. In FOCS'83, pages 185-194. IEEE Comp. Soc. Press, November 1983.
@inproceedings{focs1983-WVS,
  author =              {Wolper, Pierre and Vardi, Moshe Y. and Sistla, A.
                         Prasad},
  title =               {Reasoning about Infinite Computation Paths},
  booktitle =           {{P}roceedings of the 24th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'83)},
  acronym =             {{FOCS}'83},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {185-194},
  year =                {1983},
  month =               nov,
}
[WYY11] Farn Wang, Li-Wei Yao, and Ya-Lan Yang. Efficient verification of distributed real-time systems with broadcasting behaviors. Real-Time Systems 47(4):285-318. Kluwer Academic, July 2011.
@article{rts47(4)-WYY,
  author =              {Wang, Farn and Yao, Li-Wei and Yang, Ya-Lan},
  title =               {Efficient verification of distributed real-time
                         systems with broadcasting behaviors},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {47},
  number =              {4},
  pages =               {285-318},
  year =                {2011},
  month =               jul,
}