1980 | |
---|---|
[AN80] | André Arnold et
Maurice Nivat.
The metric space of infinite trees. Algebraic and
topological properties.
Fundamenta Informaticae 3(4):445-476. IOS Press, 1980.
|
[Ang80] | Dana Angluin.
On Counting Problems and the Polynomial Hierarchy.
Theoretical Computer Science 12:161-173. Elsevier, 1980.
|
[Bur80] | John P. Burgess.
Decidability for Branching Time.
Studia Logica 39(2-3):203-218. Kluwer Academic, 1980.
|
[CE80] | Edmund M. Clarke et
E. Allen Emerson.
Characterizing properties of parallel programs as
fixpoints.
In ICALP'80,
Lecture Notes in Computer Science 85, pages 169-181. Springer-Verlag, juillet 1980.
|
[EC80] | E. Allen Emerson et
Edmund M. Clarke.
Characterizing Correctness Properties of Parallel
Programs Using Fixpoints.
In ICALP'80,
Lecture Notes in Computer Science 85, pages 169-181. Springer-Verlag, juillet 1980.
|
[Gol80] | Leslie M. Goldschlager.
A Space Efficient Algorithm for the Monotone Planar
Circuit Value Problem.
Information Processing Letters 10(1):25-27. Elsevier, février 1980.
|
[GPS+80] | Dov M. Gabbay,
Amir Pnueli,
Saharon Shelah et
Jonathan Stavi.
On the Temporal Analysis of Fairness.
In POPL'80,
pages 163-173.
ACM Press, janvier 1980.
|
[Hoa80] | Charles Antony Richard Hoare.
A Model for Communicating Sequential Processes.
In R. M. McKeag et
A. M. MacNaghten (eds.),
On the Construction of Programs – An advanced
course.
Cambridge University Press, 1980.
|
[Kun80] | Kenneth Kunen. Set Theory. Elsevier, 1980. |
[Lam80] | Leslie Lamport.
``Sometimes'' is sometimes ``Not Never''.
In POPL'80,
pages 174-185.
ACM Press, janvier 1980.
|
[Mad80] | Roger Maddux. The equational theory of CA3 is undecidable. Journal of Symbolic Logic 45(2):311-316. Association for Symbolic Logic, juin 1980. |
[Mil80] | Robin Milner.
A Calculus of Communicating Systems.
Lecture Notes in Computer Science 92.
Springer-Verlag, 1980.
|
[ON80] | Hiroakira Ono et Akira Nakamura. On the Size of Refutation Kripke Models for Some Linear Modal and Tense Logics. Studia Logica 39(4):325-333. Kluwer Academic, 1980. |
[Sip80] | Michael Sipser.
Halting Space-bounded Computations.
Theoretical Computer Science 10(3):335-338. Elsevier, 1980.
|
Sélectionner
14 correspondances trouvéesListe des auteurs
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1