1981
[BH81] Arthur J. Bernstein et Jr. Harter. Proving Real-Time Properties of Programs with Temporal Logic. In SOSP'81, Operating System Review 15(5), pages 1-11. ACM Press, décembre 1981. 
@inproceedings{sosp1981-BH,
  author =              {Bernstein, Arthur J. and Harter, Paul K., Jr.},
  title =               {Proving Real-Time Properties of Programs with
                         Temporal Logic},
  booktitle =           {{P}roceedings of the 8th {ACM} {S}ymposium on
                         {O}perating {S}ystems {P}rinciples ({SOSP}'81)},
  acronym =             {{SOSP}'81},
  publisher =           {ACM Press},
  series =              {Operating System Review},
  volume =              {15},
  number =              {5},
  pages =               {1-11},
  year =                {1981},
  month =               dec,
}
[BPM81] Mordechai Ben-Ari, Amir Pnueli et Zohar Manna. The Temporal Logic of Branching Time. In POPL'81, pages 164-176. ACM Press, janvier 1981. 
@inproceedings{popl1981-BPM,
  author =              {Ben{-}Ari, Mordechai and Pnueli, Amir and Manna,
                         Zohar},
  title =               {The Temporal Logic of Branching Time},
  booktitle =           {Conference Record of the 8th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'81)},
  acronym =             {{POPL}'81},
  publisher =           {ACM Press},
  pages =               {164-176},
  year =                {1981},
  month =               jan,
}
[CKS81] Ashok K. Chandra, Dexter C. Kozen et Larry J. Stockmeyer. Alternation. Journal of the ACM 28(1):114-133. ACM Press, janvier 1981. 
@article{jacm28(1)-CKS,
  author =              {Chandra, Ashok K. and Kozen, Dexter C. and
                         Stockmeyer, Larry J.},
  title =               {Alternation},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {28},
  number =              {1},
  pages =               {114-133},
  year =                {1981},
  month =               jan,
}
[Gab81] Dov M. Gabbay. Expressive Functional Completeness in Tense Logic. In Aspects of Philosophical Logic, Synthese Library 147, pages 91-117. Springer-Verlag, décembre 1981. 
@inproceedings{apl1977-Gab,
  author =              {Gabbay, Dov M.},
  title =               {Expressive Functional Completeness in Tense Logic},
  editor =              {M{\"o}nnich, Uwe},
  booktitle =           {Aspects of Philosophical Logic},
  publisher =           {Springer-Verlag},
  series =              {Synthese Library},
  volume =              {147},
  pages =               {91-117},
  year =                {1981},
  month =               dec,
  confyear =            {1977},
}
[Imm81] Neil Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences 22(3):384-406. Academic Press, juin 1981. 
@article{jcss22(3)-Imm,
  author =              {Immerman, Neil},
  title =               {Number of quantifiers is better than number of tape
                         cells},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {22},
  number =              {3},
  pages =               {384-406},
  year =                {1981},
  month =               jun,
  doi =                 {10.1016/0022-0000(81)90039-8},
}
[Lei81] Ernst Leiss. Succinct representation of regular languages by boolean automata. Theoretical Computer Science 13(3):323-330. Elsevier, 1981. 
@article{tcs13(3)-Lei,
  author =              {Leiss, Ernst},
  title =               {Succinct representation of regular languages by
                         boolean automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {13},
  number =              {3},
  pages =               {323-330},
  year =                {1981},
}
[Par81] David Michael Ritchie Park. Concurrency and Automata on Infinite Sequences. In TCS'81, Lecture Notes in Computer Science 104, pages 167-183. Springer-Verlag, mars 1981. 
@inproceedings{gitcs1981-Park,
  author =              {Park, David Michael Ritchie},
  title =               {Concurrency and Automata on Infinite Sequences},
  editor =              {Deussen, Peter},
  booktitle =           {{P}roceedings of the 5th {GI}-{C}onference on
                         {T}heoretical {C}omputer {S}cience ({TCS}'81)},
  acronym =             {{TCS}'81},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {104},
  pages =               {167-183},
  year =                {1981},
  month =               mar,
}
[Pnu81] Amir Pnueli. The Temporal Semantics of Concurrent Programs. Theoretical Computer Science 13:45-60. Elsevier, 1981. 
@article{tcs13()-Pnu,
  author =              {Pnueli, Amir},
  title =               {The Temporal Semantics of Concurrent Programs},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {13},
  pages =               {45-60},
  year =                {1981},
}
[Ruz81] Walter L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences 22(3):365-383. Academic Press, juin 1981. 
@article{jcss22(3)-Ruz,
  author =              {Ruzzo, Walter L.},
  title =               {On uniform circuit complexity},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {22},
  number =              {3},
  pages =               {365-383},
  year =                {1981},
  month =               jun,
  doi =                 {10.1016/0022-0000(81)90038-6},
}
Liste des auteurs