Achim Jung - Publications

(most recent first)

• Continuous domains for function spaces using spectral compactification.
  Electronic Notes in Theoretical Informatics and Computer Science, vol. 4, paper 8, 20 pages, 2024, DOI:10.46298/entics.14736
  (Joint with Amin Farjudian.)
  BibTeX arXiv

• Stone duality for relations.
  Outstanding Contributions to Logic: Samson Abramsky on Logic and Structure in Computer Science and Beyond, vol. 25, chapter 5, pages 159-215, 2023, DOI:10.1007/978-3-031-24117-8_5
  (Joint with Alexander Kurz and Drew Moshier.)
  BibTeX Published book chapter

• A duality for two-sorted lattices.
  Soft Computing, (DOI:10.1007/s00500-020-05482-7), vol. 25, pages 851-868, 2021.
  (Joint with Umberto Rivieccio.)
  BibTeX PDF

• Quotients of d-frames.
  Applied categorical structures, 2019, pages 1-15, DOI:10.1007/s10485-018-09553-7
  (Joint with Tomáš Jakl and Aleš Pultr.)
  BibTeX PDF Publisher's open access

• Non-involutive twist structures.
  Logic Journal of the IGPL, (DOI:10.1093/jigpal/jzy070), 2018.
  (Joint with Umberto Rivieccio and Paulo Maia.)
  BibTeX PDF Publisher's open access

• From the Chinese Room Argument to the Church-Turing Thesis.
  In: Proceedings of the 2018 AISB Convention, 2018, pages 25-29.
  (Joint with Dean Petters.)
  BibTeX PDF

• A dichotomy result for locally compact sober dcpos.
  Houston Journal of Mathematics, vol. 45, 2019, pages 935-951.
  (Joint with Xiaodong Jia and Qingguo Li.)
  BibTeX PDF

• The Ho-Zhao problem.
  Logical Methods in Computer Science, vol. 14, 2018, pages 1-19, (DOI:10.23638/LMCS-14(1:7)2018).
  (Joint with Weng Kin Ho, Jean Goubault-Larrecq, and Xiaoyong Xi.)
  BibTeX PDF

• Diagrammatic semantics of digital circuits.
  In: Proceedings of the 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 2017, pages 24:1--24:16, (DOI: 10.4230/LIPIcs.CSL.2017.24).
  (Joint with Dan Ghica and Aliaume Lopez.)
  BibTeX PDF

• Free constructions and coproducts of d-frames.
  In: Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), ed. Leibniz International Proceedings in Informatics, vol. 72, 2017, pages 14:1-14:15, (DOI: 10.4230/LIPIcs.CALCO.2017.14).
  (Joint with Tomáš Jakl.)
  BibTeX PDF

• Categorical semantics of digital circuits.
  In: Proceedings of the 16th conference on Formal Methods in Computer-Aided Design (FMCAD 2016), 2016, pages 41-48, (DOI: doi:10.15781/T2G73766F).
  (Joint with Dan Ghica.)
  PDF

• A note on coherence of dcpos.
  Topology and Applications, vol. 209, 2016, pages 235-238, (DOI: doi:10.1016/j.topol.2016.06.011).
  (Joint with Xiaodong Jia and Qingguo Li.)
  BibTeX PDF

• Bitopology and four valued logic.
  In: Proceedings of the 32nd Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXXII), ed. L. Birkedal Electronic Notes in Theoretical Computer Science, vol. 325, 2016, pages 109-126, (DOI: 10.1016/j.entcs.2016.09.039).
  (Joint with Tomáš Jakl and Aleš Pultr.)
  BibTeX PDF

• Four-valued modal logic: Kripke semantics and duality.
  Journal of Logic and Computation, vol. 27 2015, pages 155-199, (DOI: 10.1093/logcom/exv038).
  (Joint with Umberto Rivieccio and Ramon Jansana.)
  BibTeX PDF

• All cartesian closed categories of quasicontinuous domains consist of domains.
  Theoretical Computer Science, vol. 594, August 2015, pages 143-150, (DOI: 10.1016/j.tcs.2015.05.014).
  (Joint with Xiaodong Jia, Hui Kou, Qingguo Li, Haoran Zhao.)
  BibTeX PDF

• Teaching denotational semantics.
  ACM SIGLOG News, vol. 1, nr. 2, October 2014, pages 25-37.
  (With an introduction by Mike Mislove.)
  BibTeX PDF

• On a categorical framework for coalgebraic modal logic.
  In: Proceedings of the 30th Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXX), eds B. Jacobs, M. Mislove, A. Silva, and S. Staton Electronic Notes in Theoretical Computer Science, vol. 308, 2014, pages 109-128, (DOI: 10.1016/j.entcs.2014.10.007).
  (Joint with Liang-Ting Chen.)
  BibTeX PDF

• QRB, QFS, and the probabilistic powerdomain.
  In: Proceedings of the 30th Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXX), eds B. Jacobs, M. Mislove, A. Silva, and S. Staton Electronic Notes in Theoretical Computer Science, vol. 308, 2014, pages 167-182, (DOI: 10.1016/j.entcs.2014.10.010).
  (Joint with J. Goubault-Larrecq.)
  BibTeX PDF

• 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 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 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 PDF

• 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 PDF

• 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 PDF

• 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 PDF

• 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 PDF

• 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 Errata

• 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.