1985
[Bab85] László Babai. Trading Group Theory for Randomness. In STOC'85, pages 421-429. ACM Press, mai 1985. 
@inproceedings{stoc1985-Bab,
  author =              {Babai, L{\'a}szl{\'o}},
  title =               {Trading Group Theory for Randomness},
  booktitle =           {{P}roceedings of the 17th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'85)},
  acronym =             {{STOC}'85},
  publisher =           {ACM Press},
  pages =               {421-429},
  year =                {1985},
  month =               may,
}
[BG85] John P. Burgess et Yuri Gurevich. The Decision Problem for Linear Temporal Logic. Notre Dame Journal of Formal Logic 26(2):115-128. Avril 1985. 
@article{ndjfl26(2)-BG,
  author =              {Burgess,John P. and Gurevich, Yuri},
  title =               {The Decision Problem for Linear Temporal Logic},
  journal =             {Notre Dame Journal of Formal Logic},
  volume =              {26},
  number =              {2},
  pages =               {115-128},
  year =                {1985},
  month =               apr,
}
[Coo85] Stephen A. Cook. A Taxonomy of Problems with Fast Parallel Algorithms. Information and Control 64(1-3):2-22. Academic Press, 1985. 
@article{icont64(1-3)-cook,
  author =              {Cook, Stephen A.},
  title =               {A Taxonomy of Problems with Fast Parallel
                         Algorithms},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {64},
  number =              {1-3},
  pages =               {2-22},
  year =                {1985},
}
[EH85] E. Allen Emerson et Joseph Y. Halpern. Decision Procedures and Expressiveness in the Temporal Logic of Branching Time. Journal of Computer and System Sciences 30(1):1-24. Academic Press, février 1985. 
@article{jcss30(1)-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {Decision Procedures and Expressiveness in the
                         Temporal Logic of Branching Time},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {30},
  number =              {1},
  pages =               {1-24},
  year =                {1985},
  month =               feb,
}
[Har85] David Harel. Recurring Dominoes: Making the Highly Undecidable Highly Understandable. Annals of Discrete Mathematics 24:51-72. North-Holland, 1985. 
@article{adm24()-Har,
  author =              {Harel, David},
  title =               {Recurring Dominoes: Making the Highly Undecidable
                         Highly Understandable},
  publisher =           {North-Holland},
  journal =             {Annals of Discrete Mathematics},
  volume =              {24},
  pages =               {51-72},
  year =                {1985},
}
[HM85] Matthew C. B. Hennessy et Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1). ACM Press, janvier 1985. 
@article{jacm32(1)-HM,
  author =              {Hennessy, Matthew C. B. and Milner, Robin},
  title =               {Algebraic laws for nondeterminism and concurrency},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {32},
  number =              {1},
  year =                {1985},
  month =               jan,
}
[HP85] David Harel et David Peleg. Process Logic with Regular Formulas. Theoretical Computer Science 38:307-322. Elsevier, 1985. 
@article{tcs38()-HP,
  author =              {Harel, David and Peleg, David},
  title =               {Process Logic with Regular Formulas},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {38},
  pages =               {307-322},
  year =                {1985},
}
[LP85] Orna Lichtenstein et Amir Pnueli. Checking that Finite State Concurrent Programs Satisfy their Linear Specifiction. In POPL'85, pages 97-107. ACM Press, janvier 1985. 
@inproceedings{popl1985-LP,
  author =              {Lichtenstein, Orna and Pnueli, Amir},
  title =               {Checking that Finite State Concurrent Programs
                         Satisfy their Linear Specifiction},
  booktitle =           {Conference Record of the 12th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'85)},
  acronym =             {{POPL}'85},
  publisher =           {ACM Press},
  pages =               {97-107},
  year =                {1985},
  month =               jan,
}
[LPZ85] Orna Lichtenstein, Amir Pnueli et Lenore D. Zuck. The Glory of the Past. In CLP'85, Lecture Notes in Computer Science 193, pages 413-424. Springer-Verlag, juin 1985. 
@inproceedings{clp1985-LPZ,
  author =              {Lichtenstein, Orna and Pnueli, Amir and Zuck, Lenore
                         D.},
  title =               {The Glory of the Past},
  editor =              {Parikh, Rohit},
  booktitle =           {Proceedings of the Conference on Logics of Programs
                         ({CLP}'85)},
  acronym =             {{CLP}'85},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {193},
  pages =               {413-424},
  year =                {1985},
  month =               jun,
}
[MS85] David E. Muller et Paul E. Schupp. Alternating automata on infinite objects, determinacy and Rabin's theorem. In EPIT'84, Lecture Notes in Computer Science 192, pages 99-107. Springer-Verlag, 1985. 
@inproceedings{epit1984-MS,
  author =              {Muller, David E. and Schupp, Paul E.},
  title =               {Alternating automata on infinite objects,
                         determinacy and {R}abin's theorem},
  editor =              {Nivat, Maurice and Perrin, Dominique},
  booktitle =           {{A}utomata on {I}nfinite {W}ords~-- {{\'E}}cole de
                         {P}rintemps d'{I}nformatique {T}h{\'e}orique
                         ({EPIT}'84)},
  acronym =             {{EPIT}'84},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {192},
  pages =               {99-107},
  year =                {1985},
  confyear =            {1984},
  confmonth =           {5},
  doi =                 {10.1007/3-540-15641-0_27},
}
[SC85] A. Prasad Sistla et Edmund M. Clarke. The Complexity of Propositional Linear Temporal Logics. Journal of the ACM 32(3):733-749. ACM Press, juillet 1985. 
@article{jacm32(3)-SC,
  author =              {Sistla, A. Prasad and Clarke, Edmund M.},
  title =               {The Complexity of Propositional Linear Temporal
                         Logics},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {32},
  number =              {3},
  pages =               {733-749},
  year =                {1985},
  month =               jul,
  doi =                 {10.1145/3828.3837},
}
[ST85] Daniel Dominic Sleator et Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM 32(3):652-686. ACM Press, juillet 1985. 
@article{jacm32(3)-ST,
  author =              {Sleator, Daniel Dominic and Tarjan, Robert Endre},
  title =               {Self-adjusting binary search trees},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {32},
  number =              {3},
  pages =               {652-686},
  year =                {1985},
  month =               jul,
  doi =                 {10.1145/3828.3835},
}
[SVW85] A. Prasad Sistla, Moshe Y. Vardi et Pierre Wolper. The Complementation Problem for Büchi Automata, with Applications to Temporal Logic. In ICALP'85, Lecture Notes in Computer Science 194, pages 465-474. Springer-Verlag, juillet 1985. 
@inproceedings{icalp1985-SVW,
  author =              {Sistla, A. Prasad and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {The Complementation Problem for {B}{\"u}chi
                         Automata, with Applications to Temporal Logic},
  editor =              {Brauer, Wilfried},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'85)},
  acronym =             {{ICALP}'85},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {194},
  pages =               {465-474},
  year =                {1985},
  month =               jul,
}
[Var85] Moshe Y. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In FOCS'85, pages 327-338. IEEE Comp. Soc. Press, octobre 1985. 
@inproceedings{focs1985-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Automatic Verification of Probabilistic Concurrent
                         Finite-State Programs},
  booktitle =           {{P}roceedings of the 26th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'85)},
  acronym =             {{FOCS}'85},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {327-338},
  year =                {1985},
  month =               oct,
  doi =                 {10.1109/SFCS.1985.12},
}
[VS85] Moshe Y. Vardi et Larry J. Stockmeyer. Improved Upper and Lower Bounds for Modal Logics of Programs. In STOC'85, pages 240-251. ACM Press, mai 1985. 
@inproceedings{stoc1985-VS,
  author =              {Vardi, Moshe Y. and Stockmeyer, Larry J.},
  title =               {Improved Upper and Lower Bounds for Modal Logics of
                         Programs},
  booktitle =           {{P}roceedings of the 17th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'85)},
  acronym =             {{STOC}'85},
  publisher =           {ACM Press},
  pages =               {240-251},
  year =                {1985},
  month =               may,
}
Liste des auteurs