On Noetherian spaces

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 453-462

  Goubault Larrecq, Jean ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN THEORY; INFINITE TRANSITION SYSTEMS; ORDERED SET; PREIMAGES; QUASI-ORDERING; STABLY COMPACT SPACES; TECHNICAL DEVELOPMENT; TOPOLOGICAL SPACES;

TOPOLOGY;

COMPUTATION THEORY;

EID: 70449129312     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.34     Document Type: Conference Paper

References (25)

1. P. Abdulla, A. Bouajjani, and J. d'Orso. Deciding monotonic games. In Comp. Science Logic & K. Gödel Colloquium'03, pages 1-14. Springer Verlag LNCS 2803, 2003.
2. P. A. Abdulla, K. Čerāns, B. Jonsson, and T. Yih-Kuen. Algorithmic analysis of programs with well quasi-ordered domains. Inf. and Computation, 160(1/2):109-127, 2000.
3. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. In 8th LICS, pages 160-170, 1993. (Pubitemid 23688810)
4. P. A. Abdulla and B. Jonsson. Ensuring completeness of symbolic verification methods for infinite-state systems. Th. Comp. Sci., 256(1-2):145-167, 2001. (Pubitemid 32666105)
5. P. A. Abdulla and A. Nylén. Better is better than well: On efficient verification of infinite-state systems. In 14th LICS, pages 132-140, 2000.
6. P. A. Abdulla and A. Nylén. Timed Petri nets and bqos. In 22nd Int. Conf. Applications and Theory of Petri Nets (ICATPN), pages 53-70. Springer Verlag LNCS 2075, 2001. (Pubitemid 33297930)
7. S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science, volume 3, pages 1-168. Oxford U. Press, 1994.
8. B. Buchberger and R. Loos. Algebraic simplification. In B. Buchberger, G. E. Collins, R. Loos, and R. Albrecht, editors, Computer Algebra, Symbolic and Algebraic Computation. Springer Verlag, 1982-83.
9. L. de Alfaro, T. A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In 12th CONCUR, pages 536-550. Springer Verlag LNCS 2154, 2001. (Pubitemid 33326679)
10. M. Escardó, J. Lawson, and A. Simpson. Comparing cartesian closed categories of (core) compactly generated spaces. Topology and Its Applications, 143(1-3):105-146, 2004.
11. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Th. Comp. Sci., 256(1-2):63-92, 2001. (Pubitemid 32666102)
12. G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. A Compendium of Continuous Lattices. Springer Verlag, 1980.
13. A. Grothendieck. Éléments de géométrie algébrique (rédigés avec la collaboration de Jean Dieudonné): I. Le langage des schémas, volume 4. Publications mathématiques de l'I.H.É.S., 1960. pages 5-228.
14. T. A. Henzinger, R. Majumdar, and J.-F. Raskin. A classification of symbolic transition systems. ACM Trans. Comp. Logic, 6(1):1-32, 2005. (Pubitemid 40080280)
15. J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Th. Comp. Sci., 8:135-159, 1979.
16. P. Jančar. A note on well quasi-orderings for powersets. Inf. Proc. Letters, 72(5-6):155-160, 1999.
17. A. Jung. Cartesian Closed Categories of Domains. PhD thesis, Tech. Hochschule Darmstadt, July 1998.
18. A. Jung. Stably compact spaces and the probabilistic powerspace construction. In Domain-theoretic Methods in Probabilistic Processes, volume 87 of ENTCS. Elsevier, 2004.
19. A. Marcone. Foundations of bqo theory. Trans. AMS, 345(2):641-660, 1994.
20. M. Mislove. Algebraic posets, algebraic cpo's and models of concurrency. In G. Reed, A. Roscoe, and R. Wachter, editors, Topology and Category Theory in Computer Science, pages 75-109. Clarendon Press, 1981.
21. M. Mislove. Topology, domain theory and theoretical computer science. Topology and Its Applications, 89:3-59, 1998. (Pubitemid 128653877)
22. M. Müller-Olm and H. Seidl. Polynomial constants are decidable. In M. V. Hermenegildo and G. Puebla, editors, Proc. 9th Intl. Symp. Static Analysis, pages 4-19. SpringerVerlag LNCS 2477, 2002.
23. C. S.-J. A. Nash-Williams. On better-quasi-ordering transfinite sequences. Proc. Camb. Phil. Soc., 64:273-290, 1968.
24. R. Rado. Partial well-ordering of sets of vectors. Mathematika, 1:89-95, 1954.
25. O. Zariski. A new proof of Hilbert's Nullstellensatz. Bull. Amer. Math. Soc., LIII:362-368, 1947.