Achim Jung - Publications

(most recent first)

• Kripke semantics for modal bilattice logic.
  28th Logic in Computer Science, IEEE Computer Society Press, 2013, pages 438-447, (DOI: 10.1109/LICS.2013.50).
  (Joint with U. Rivieccio.)
  BibTeX PDF

• Continuous domain theory in logical form.
  Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, Springer Lecture Notes in Computer Science, vol. 7860, 2013, pages 166-177, (DOI: 10.1007/978-3-642-38164-5_12).
  BibTeX PDF

• Convergence of preference functions.
  Theoretical Computer Science, vol. 488, 2013, pages = 66-77 (DOI: 10.1016/j.tcs.2013.03.023)
  (Joint with J. Rowe.)
  BibTeX PDF

• Priestley duality for bilattices.
  Studia Logica, vol. 100, 2012, pages 223-252 (DOI: 10.1007/s11225-012-9376-0)
  (Joint with U. Rivieccio.)
  BibTeX PDF

• A bitopological point-free approach to compactifications.
  Topology and Applications, vol. 158, 2011, pages 1551-1566 (DOI: 10.1016/j.topol.2011.05.024)
  (Joint with O. Klinke and M. Andrew Moshier.)
  BibTeX Compressed Postscript PDF

• Presenting dcpos and dcpo algebras.
  In: Proceedings of the 24th Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXIV), eds A. Bauer and M. Mislove, Electronic Notes in Theoretical Computer Science, vol. 218, 2008, pages 209-229.
  (Joint with M. Andrew Moshier and S. J. Vickers.)
  BibTeX Compressed Postscript PDF

• A Hofmann-Mislove theorem for bitopological spaces.
  Journal of Logic and Algebraic Programming, vol. 76, 2008, pages 161-174.
  (Joint with M. Andrew Moshier.)
  (Considerably revised from the MFPS version below.)
  BibTeX Compressed Postscript PDF

• A Hofmann-Mislove theorem for bitopological spaces.
  In: Proceedings of the 23rd Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXIII), eds M. Fiore and M. Mislove, Electronic Notes in Theoretical Computer Science, vol. 173, 2007, pages 159-175.
  (Joint with M. Andrew Moshier.)
  BibTeX Compressed Postscript PDF

• On the bitopological nature of Stone Duality.
  Technical Report CSR-06-13. School of Computer Science, University of Birmingham, December 2006, 110 pages.
  (Joint with M. Andrew Moshier).
  BibTeX PDF

• A Logical Approach to Stable Domains.
  Theoretical Computer Science, vol 368, 2006, pages 124-148.
  (Joint with Yi-Xiang Chen).
  BibTeX Compressed Postscript PDF

• Priestley duality for strong proximity lattices.
  In: Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programm\ing Semantics (MFPS XXII), eds S. Brookes and M. Mislove, Electronic Notes in Theoretical Computer Science, vol. 158, 2006, pages 199-217.
  (Joint with M. El-Zawawy.)
  BibTeX Compressed Postscript PDF

• The probabilistic powerdomain for stably compact spaces.
  Corrected version. Originally published as Theoretical Computer Science, vol 328, 2004, pages 221-244.
  (Joint with M. Alvarez-Manilla and K. Keimel.)
  BibTeX Compressed Postscript PDF

• Stably compact spaces and the probabilistic powerspace construction.
  In: Bellairs Workshop on Domain-theoretic Methods in Probabilistic Processes, eds. P. Panangaden and Josée Desharnais. Electronic Lecture Notes in Computer Science, vol. 87, 15 pages.
  BibTeX Compressed Postscript PDF

• A Logic for Probabilities in Semantics.
  In: Computer Science Logic, proceedings of CSL'02, ed. Julian Bradfield. Lecture Notes in Computer Science, vol. 2471, Springer Verlag, 2002, pages 216-231.
  (Joint with M. A. Moshier.)
  BibTeX Compressed Postscript PDF

• Stably Compact Spaces and Closed Relations.
  In: 17th Conference on Mathematical Foundations of Programming Semantics, Aarhus, May 2001, eds. S. Brookes and M. Mislove. Electronic Notes in Theoretical Computer Science, vol. 45, 24 pages.
  (Joint with M. Kegelmann and M. A. Moshier.)
  BibTeX Compressed Postscript PDF

• Linear Types and Approximation.
  Mathematical Structures in Computer Science, vol 10, 2000, pages 719-746.
  (Joint with M. Huth and K. Keimel.)
  BibTeX Compressed Postscript

• Multi lingual sequent calculus and coherent spaces.
  Fundamenta Informaticae, vol 37, 1999, pages 369-412.
  (Joint with M. Andrew Moshier and Mathias Kegelmann.)
  BibTeX Compressed Postscript

• The troublesome probabilistic powerdomain.
  In Third Workshop on Computation and Approximation, Proceedings.
  Electronic Notes in Theoretical Computer Science, vol 13, 1998, 23 pp.
  (Joint with R. Tix.)
  BibTeX Compressed Postscript PDF

• Berechnungsmodelle.
  In: Informatik-Handbuch, Eds. P. Rechenberg and G. Pomberger, Hanser Verlag, pages 65-75, 1997.
  3rd edition 2002, pages 73-87.
  BibTeX Publishers Note

• Logik.
  In: Informatik-Handbuch, Eds. P. Rechenberg and G. Pomberger, Hanser Verlag, pages 31-63, 1997.
  3rd edition 2002, pages 33-72.
  BibTeX Publishers Note

• Domains and Denotational Semantics: History, Accomplishments and Open Problems.
  Bulletin of EATCS, 59:227-256, 1996.
  (Joint with M. P. Fiore, E. Moggi, P. O'Hearn, J. Riecke, G. Rosolini and I. Stark.)
  BibTeX Compressed Postscript

• Uniform approximation of topological spaces.
  Topology and Applications, vol 83, 1998, pages 23-38.
  (Joint with Philipp Sünderhauf.)
  BibTeX Compressed Postscript

• On the duality of compact vs. open.
  In Papers on General Topology and Applications: Eleventh Summer Conference at University of Southern Maine, Proceedings, Eds. S. Andima, R. C. Flagg, G. Itzkowitz, P. Misra, Y. Kong and R. Kopperman.
  Annals of the New York Academy of Sciences, 806:214-230,1996.
  (Joint with Philipp Sünderhauf.)
  BibTeX Compressed Postscript PDF

• Types, Logic, and Semantics for Nested Databases.
  In Mathematical Foundations of Programming Semantics, Proceedings.
  Electronic Notes in Theoretical Computer Science, 1995, 21 pp.
  (Joint with Hermann Puhlmann.)
  BibTeX Compressed Postscript

• Domain Theory.
  In Handbook of Logic in Computer Science, Vol. III, Clarendon Press, 1994, pages 1-168.
  (Joint with S. Abramsky.)
  BibTeX Compressed Postscript PDF

• Linear Types and Approximation. (Extended abstract.)
  Logic in Computer Science, IEEE Computer Society Press, 1994, pages 110-114.
  (Joint with M. Huth and K. Keimel.)
  BibTeX

• Mathematical Structures in the Theory of Programming Languages.
  Habilitation Thesis, Fachbereich Mathematik, Technische Hochschule Darmstadt, February 1994, 162 pp.
  BibTeX Compressed Postscript

• A New Characterization of Lambda Definability.
  In: Typed Lambda Calculi and Applications, Eds. M. Bezem and J.F. Groote, volume 664 of Lecture Notes in Computer Science, Springer-Verlag, 1993, pages 245-257.
  (Joint with J. Tiuryn.)
  BibTeX Compressed Postscript

• Studying the Fully Abstract Model of PCF within its Continuous Function Model.
  In: Typed Lambda Calculi and Applications, Eds. M. Bezem and J.F. Groote, volume 664 of Lecture Notes in Computer Science, Springer-Verlag, 1993, pages 230-244.
  (Joint with A. Stoughton.)
  BibTeX Compressed Postscript

• Decomposition of Domains.
  In Mathematical Foundations of Programming Semantics, Proceedings, Eds. S. Brookes, M. Main, A. Melton, M. Mislove and D. Schmidt.
  Lecture Notes in Computer Science, Springer-Verlag, vol 598, 1992, pages 235-258.
  (Joint with L. Libkin und H. Puhlmann.)
  BibTeX Compressed Postscript

• The Strength of the CCITT/ISO Hash Function.
  Arbeitspapiere der GMD, Gesellschaft für Mathematik und Datenverarbeitung, Sankt Augustin, vol 492, 1991, 26 pp.
  BibTeX Compressed Postscript

• Using Powerdomains to Generalize Relational Databases.
  Theoretical Computer Science, 91:23-55, 1991.
  (Joint with P. Buneman und A. Ohori.)
  BibTeX Compressed Postscript

• Bewertung von Hash-Funktionen.
  In GMD-SmartCard Workshop, Proceedings.
  Gesellschaft für Mathematik und Datenverarbeitung, 1991, 12 pp.
  BibTeX Compressed Postscript

• The Dependent Product Construction in Various Categories of Domains.
  Theoretical Computer Science, 79:359-363, 1991.

• The Classification of Continuous Domains. (Extended abstract.)
  In: Logic in Computer Science, IEEE Computer Society Press, 1990, pages 35-40.
  BibTeX Compressed Postscript

• Cartesian closed categories of algebraic CPO's.
  Theoretical Computer Science, 70:233-250, 1990.

• Coherence and Consistency in Domains.
  Journal of Pure and Applied Algebra, 63:49-66, 1989.
  (Joint with C. Gunter.)

• Cartesian Closed Categories of Domains. (Dissertation)
  Vol. 66 of CWI Tracts, Centrum voor Wiskunde en Informatica, Amsterdam 1989, 107 pp.
  BibTeX Compressed Postscript PDF

• Coherence and Consistency in Domains. (Extended abstract.)
  In: Logic in Computer Science, IEEE Computer Society Press, 1988, pages 309-319.
  (Joint with Carl Gunter.)

• Comparison of Subset Systems.
  Commentationes Mathematicae Universitatis Carolinae, 29:169-177, 1988.
  (Joint with E. Nelson, J. Adámek, J. Reiterman, A. Tarlecki.)

• New Results on Hierarchies of Domains.
  In: Mathematical Foundations of Programming Language Semantics, Eds. M. Main, A. Melton, M. Mislove and D. Schmidt, volume 298 of Lecture Notes in Computer Science, Springer-Verlag, 1988, pages 303-310.

• Implementing the RSA Cryptosystem.
  Computers & Security, 6:342-350, 1987.
  Reprinted in: Advances in Computer Security, Vol. III. Ed. R. Turn, Artech House, 1989.