1983
[BM83] Bernard Berthomieu et Miguel Menasche. An Enumerative Approach for Analyzing Time Petri Nets. In WCC'83, pages 41-46. North-Holland/IFIP, septembre 1983. 
@inproceedings{ifipwcc1983-BM,
  author =              {Berthomieu, Bernard and Menasche, Miguel},
  title =               {An Enumerative Approach for Analyzing Time {P}etri
                         Nets},
  editor =              {Mason, R. E. A.},
  booktitle =           {{I}nformation {P}rocessing~83~-- {P}roceedings of
                         the 9th {IFIP} {W}orld {C}omputer {C}ongress
                         ({WCC}'83)},
  acronym =             {{WCC}'83},
  publisher =           {North-Holland/IFIP},
  pages =               {41-46},
  year =                {1983},
  month =               sep,
}
[BPM83] Mordechai Ben-Ari, Amir Pnueli et Zohar Manna. The Temporal Logic of Branching Time. Acta Informatica 20:207-226. Springer-Verlag, 1983. 
@article{acta20()-BPM,
  author =              {Ben{-}Ari, Mordechai and Pnueli, Amir and Manna,
                         Zohar},
  title =               {The Temporal Logic of Branching Time},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {20},
  pages =               {207-226},
  year =                {1983},
}
[CES83] Edmund M. Clarke, E. Allen Emerson et A. Prasad Sistla. Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications: A Practical Approach. In POPL'83, pages 117-126. ACM Press, janvier 1983. 
@inproceedings{popl1983-CES,
  author =              {Clarke, Edmund M. and Emerson, E. Allen and Sistla,
                         A. Prasad},
  title =               {Automatic Verification of Finite-State Concurrent
                         Systems using Temporal Logic Specifications: A
                         Practical Approach},
  booktitle =           {Conference Record of the 10th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'83)},
  acronym =             {{POPL}'83},
  publisher =           {ACM Press},
  pages =               {117-126},
  year =                {1983},
  month =               jan,
}
[EH83] E. Allen Emerson et Joseph Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time. In POPL'83, pages 127-140. ACM Press, janvier 1983. 
@inproceedings{popl1983-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {{"}{S}ometimes{"} and {"}Not Never{"} Revisited:
                         On~Branching versus Linear Time},
  booktitle =           {Conference Record of the 10th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'83)},
  acronym =             {{POPL}'83},
  publisher =           {ACM Press},
  pages =               {127-140},
  year =                {1983},
  month =               jan,
}
[Gra83] Susanne Graf. On Lamport's Comparison between Linear and Branching Time Logic. Research Report 348, Lab. Informatique et Mathématiques Apppliquées de Grenoble, France, janvier 1983. 
@techreport{imag348-Gra,
  author =              {Graf, Susanne},
  title =               {On {L}amport's Comparison between Linear and
                         Branching Time Logic},
  number =              {348},
  year =                {1983},
  month =               jan,
  institution =         {Lab.~Informatique et Math{\'e}matiques Apppliqu\'ees
                         de Grenoble, France},
  type =                {Research Report},
}
[Joh83] David S. Johnson. TheNP-Completeness Column: An Ongoing Guide. Journal of Algorithms 4(4):397-411. Elsevier, décembre 1983. 
@article{ja4(4)-joh,
  author =              {Johnson, David S.},
  title =               {The{NP}-Completeness Column: An Ongoing Guide},
  publisher =           {Elsevier},
  journal =             {Journal of Algorithms},
  volume =              {4},
  number =              {4},
  pages =               {397-411},
  year =                {1983},
  month =               dec,
}
[Koz83] Dexter C. Kozen. Results on the Propositional μ-calculus. Theoretical Computer Science 27:333-354. Elsevier, 1983. 
@article{tcs27()-Koz,
  author =              {Kozen, Dexter C.},
  title =               {Results on the Propositional {\(\mu\)}-calculus},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {27},
  pages =               {333-354},
  year =                {1983},
}
[KS83] Paris C. Kanellakis et Scott A. Smolka. CCS expressions finite state processes, and three problems of equivalence. In PODC'83, pages 228-240. ACM Press, août 1983. 
@inproceedings{podc1983-KS,
  author =              {Kanellakis, Paris C. and Smolka, Scott A.},
  title =               {{CCS} expressions finite state processes, and three
                         problems of equivalence},
  booktitle =           {{P}roceedings of the 2nd {ACM} {S}ymposium on
                         {P}rinciples of {D}istributed {C}omputing
                         ({PODC}'83)},
  acronym =             {{PODC}'83},
  publisher =           {ACM Press},
  pages =               {228-240},
  year =                {1983},
  month =               aug,
}
[Lam83] Leslie Lamport. What good is Temporal Logic?. In WCC'83, pages 657-668. North-Holland/IFIP, septembre 1983. 
@inproceedings{ifipwcc1983-Lam,
  author =              {Lamport, Leslie},
  title =               {What good is Temporal Logic?},
  editor =              {Mason, R. E. A.},
  booktitle =           {{I}nformation {P}rocessing~83~-- {P}roceedings of
                         the 9th {IFIP} {W}orld {C}omputer {C}ongress
                         ({WCC}'83)},
  acronym =             {{WCC}'83},
  publisher =           {North-Holland/IFIP},
  pages =               {657-668},
  year =                {1983},
  month =               sep,
}
[Pin83] Jean-Éric Pin. On two combinatorial problems arising from automata theory. In ICGTC'81, North-Holland Mathematics Studies 75, pages 535-548. Elsevier, 1983. 
@inproceedings{icgtc1981-Pin,
  author =              {Pin, Jean-{\'E}ric},
  title =               {On two combinatorial problems arising from automata
                         theory},
  booktitle =           {{P}roceedings of the {I}nternational {C}olloquium on
                         {G}raph {T}heory and {C}ombinatorics ({ICGTC}'81)},
  acronym =             {{ICGTC}'81},
  publisher =           {Elsevier},
  series =              {North-Holland Mathematics Studies},
  volume =              {75},
  pages =               {535-548},
  year =                {1983},
  confyear =            {1981},
  confmonth =           {6},
  doi =                 {10.1016/S0304-0208(08)73432-7},
}
[Rys83] Igor K. Rystsov. Polynomial-complete problems in automata theory. Information Processing Letters 16(1):147-151. Elsevier, avril 1983. 
@article{ipl16(3)-Rys,
  author =              {Rystsov, Igor K.},
  title =               {Polynomial-complete problems in automata theory},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {16},
  number =              {1},
  pages =               {147-151},
  year =                {1983},
  month =               apr,
  doi =                 {10.1016/0020-0190(83)90067-4},
}
[Sis83] A. Prasad Sistla. Theoretical Issues in the Design and Verification of Distributed Systems. PhD thesis, Harvard University, 1983. 
@phdthesis{phd-sistla,
  author =              {Sistla, A. Prasad},
  title =               {Theoretical Issues in the Design and Verification of
                         Distributed Systems},
  year =                {1983},
  school =              {Harvard University},
}
[Tar83] Robert Endre Tarjan. Data structures and network algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics 44. Society for Industrial and Applied Math., 1983. 
@book{Tar83-DSNA,
  author =              {Tarjan, Robert Endre},
  title =               {Data structures and network algorithms},
  publisher =           {Society for Industrial and Applied Math.},
  series =              {CBMS-NSF Regional Conference Series in Applied
                         Mathematics},
  volume =              {44},
  year =                {1983},
}
[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},
}
[WVS83] Pierre Wolper, Moshe Y. Vardi et A. Prasad Sistla. Reasoning about Infinite Computation Paths. In FOCS'83, pages 185-194. IEEE Comp. Soc. Press, novembre 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,
}
Liste des auteurs