Not all versions given here are identical to the the associated published one. The technical contents are the same. The documents distributed by this server have been provided as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications, editorial work and selected reports by Alban Ponse

A rather complete overview can be found with Computer Science Bibliographies.


    Publications in 2008 - 2011
     
  1. I. Bethke, A. Ponse, and P.H. Rodenburg. Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday. PDF. Theoretical Computer Science, 412(28): 3033-3034, 2011.
     
  2. J.A. Bergstra and A. Ponse. Proposition Algebra. PDF. ACM Transactions on Computational Logic, 12(3), Article 21 (36 pp), 2011.
     
  3. J.A. Bergstra and A. Ponse. On Hoare-McCarthy algebras. Available at arXiv:1012.5059, 22 December 2010.
     
  4. I. Bethke, B. Diertens, and A. Ponse. Electronic publication in Dutch (course material): Webklas Informatica: Wat is een programma? Section Theory of Computer Science, University of Amsterdam, Edition December 2010.
     
  5. J.A. Bergstra and A. Ponse. Short-circuit logic. Available at arXiv:1010.3674, 18 October 2010.
     
  6. A. Ponse and S.H.P. Schroevers. In Dutch: UvA Webklas Informatica: Wat is een Programma? In F. Vodegel and M. Loots (eds.). NIOC Proceedings, Het Nationale Informatica Onderwijs Congres (NIOC) 2009, 7-8 april 2009. Utrecht. Hogeschool Utrecht, pp. 85-92, 2009. (Published in 2010.)
     
  7. J.A. Bergstra and A. Ponse. An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. Scientific Annals of Computer Science, 19:57-92, 2009. Also available at arXiv:0903.1352, November 7, 2009.
     
  8. J.A. Bergstra and A. Ponse. A progression ring for interfaces of instruction sequences, threads, and services. Available at arXiv:0909.2839, Sept. 15, 2009.
     
  9. J.A. Bergstra, A. Ponse, and M.B. van der Zwaag. Tuplix Calculus. Scientific Annals of Computer Science, 18:35-61, 2008. Also available at arXiv:0712.3423.
     
  10. A. Ponse and M.B. van der Zwaag. Risk assessment for one-counter threads. ( PDF). Theory of Computing Systems, 43:563-582, 2008.
     
  11. J.A. Bergstra and A. Ponse. An Instruction Sequence Semigroup with Repeaters. Available at arXiv:0810.1151v1, October 7, 2008.
     
  12. Karl de Leeuw and Alban Ponse. Informatics and Secondary Education in the Netherlands. A 4-page note, June 2008.
     
  13. J.A. Bergstra and A. Ponse. Differential Meadows. Available at arXiv:0804.3336, April 2008.
     
  14. J.A. Bergstra and A. Ponse. A Generic Basis Theorem for Cancellation Meadows. Available at arXiv:0803.3969, March 2008.


    Publications in 2007
     

  15. J.A. Bergstra, I. Bethke, and A. Ponse. Thread algebra and risk assessment services. (PDF). In Costas Dimitracopoulos, Ludomir Newelski, Dag Normann and John R. Steel (eds.), Proceedings Logic Colloquium 2005, pages 1-17, 2007.
     
  16. A. Ponse and M.B. van der Zwaag. Belnap's logic and conditional composition. (PDF). Theoretical Computer Science, 388(1-3):319-336, 2007.
     
  17. J.A. Bergstra and A. Ponse. Interface groups and financial transfer architectures ( PDF, PS). Electronic report PRG0702, Programming Research Group, University of Amsterdam, April 2007. Also available at arXiv:0707.1639.
     
  18. J.A. Bergstra, I. Bethke, and A. Ponse. Decision problems for pushdown threads ( PDF), Acta Informatica 44(2):75-90, 2007. Appeared earlier as Electronic report PRG0502 (PDF, PS). Programming Research Group, University of Amsterdam, June 2005. Presented by Jan Bergstra at the Logic Colloquium 2005 (ASL) in Athens. (Abstract in the Bulletin of Symbolic Logic 12(2):311-312, 2006.)
     
  19. J.A. Bergstra and A. Ponse. Execution architectures for program algebra (PDF). Journal of Applied Logic, 5(1):170-192, 2007. (See 2004, Logic Group Preprint Series 230 for an earlier version.)
     
  20. A. Ponse and M.B. van der Zwaag. A generalization of ACP using Belnaps logic (PDF). Journal of Logic and Algebraic Programming 70(2):222-235, 2007.


    Publications in 2006
     

  21. A. Ponse and M.B. van der Zwaag. A generalization of ACP using Belnaps logic: extended abstract (PDF). Electronic Notes in Theoretical Computer Science, 162:287-293, 29 September 2006.
     
  22. J.A. Bergstra and A. Ponse. Projection semantics for rigid loops. ( PDF, PS). Electronic report PRG0604, Programming Research Group, University of Amsterdam, September 2006. Also available at arXiv:0707.1059.
     
  23. J.A. Bergstra and A. Ponse. A bypass of Cohen's impossibility result - extended version on the VX Heavens site in html (and there also offered as a 12-page PDF document), used for a lecture in Security of Systems and Networks at UvA, November 2004. VX Heavens, July 2006. (See also Proceedings version.)
     
  24. J.A. Bergstra and A. Ponse. Program algebra with repeat instruction ( PDF, PS). Electronic report PRG0602, Programming Research Group, University of Amsterdam, June 2006.
     
  25. J.A. Bergstra, I. Bethke, and A. Ponse. Decision problems for pushdown threads: Abstract. Presented by Jan Bergstra at the Logic Colloquium 2005 (ASL) in Athens. The Bulletin of Symbolic Logic 12(2):311-312, June 2006. (Full report version.)
     
  26. J.A. Bergstra and A. Ponse. Interface Groups for Analytic Execution Architectures ( PDF, PS). Electronic report PRG0601, Programming Research Group, University of Amsterdam, May 2006.
     
  27. A. Ponse and M.B. van der Zwaag. An introduction to program and thread algebra (PDF). In A. Beckmann et al. (editors), Logical Approaches to Computational Barriers: Proceedings CiE 2006, LNCS 3988, pages 445-458, Springer-Verlag, 2006.


    Publications in 2005 and earlier  

  28. A. Ponse and M.B. van der Zwaag. ACP and Belnap's logic (PDF). In Luca Aceto and Andrew Gordon (editors), Algebraic Process Calculi: The First Twenty Five Years and Beyond (PA'05), BRICS Notes Series NS-05-3, pages 204-208, 2005.
     
  29. J.A. Bergstra and A. Ponse. A bypass of Cohen's impossibility result (PDF). In P.M.A. Sloot, A.G. Hoekstra, T. Priol, A. Reinefeld, M. Bubak (editors). Advances in Grid Computing - EGC 2005, LNCS 3470, pages 1097-1106. Springer-Verlag, 2005. Also appeared as Electronic report PRG0501, Programming Research Group, University of Amsterdam, 2005.
     
  30. I. Bethke and A. Ponse. In Dutch: Programma-Algebra, een Inleiding tot de Programmatuur. Amsterdam University Press, ISBN 90 5629 279 X, 2003. Preview.
     
  31. A. Ponse. Orthogonality and logic (of course in process algebra), slide reprints. In Luca Aceto, Zoltan Esik, Willem Jan Fokkink, Anna Ingolfsdottir (editors), Process Algebra: Open Problems and Future Directions (PA'03), BRICS Notes Series NS-03-3, pages 121-126, 2003.
     
  32. J.A. Bergstra, A. Ponse and M.B. van der Zwaag. Branching time and orthogonal bisimulation equivalence (PDF). Theoretical Computer Science 309 (1-3):313-355, 2003.
     
  33. A. Ponse. Program algebra with unit instruction operators (PDF). Journal of Logic and Algebraic Programming 51(2):157-174, 2002. (Special issue on Program Algebra edited by C.A. Middelburg.)
     
  34. J.A. Bergstra and A. Ponse. Combining programs and state machines (PDF). Journal of Logic and Algebraic Programming 51(2):175-192, 2002. (Special issue on Program Algebra edited by C.A. Middelburg.)
     
  35. J.A. Bergstra and A. Ponse. Register-machine based processes (PDF). Journal of the ACM 48(6):1207-1241, 2001. (Extends earlier version.)
     
  36. J.A. Bergstra and A. Ponse. Non-regular iterators in process algebra (PDF). Theoretical Computer Science 269 (1-2):203-229, 2001. (This version extends the original 1998 submission UvA Report P9808.)
     
  37. A. Ponse and Y.S. Usenko. Equivalence of recursive specifications in process algebra (Postscript, PDF). Information Processing Letters 80(1):59-65, 2001.
     
  38. J.A. Bergstra and A. Ponse. Process algebra and conditional composition (Postscript, PDF). Information Processing Letters 80(1):41-49, 2001.
     
  39. J.F. Groote, A. Ponse and Y.S. Usenko. Linearization in parallel pCRL. Journal of Logic and Algebraic Programming 48:39-70, 2001.
     
  40. J.A. Bergstra, W.J. Fokkink, and A. Ponse. Process algebra with recursive operations. In J.A. Bergstra, A. Ponse and S.A. Smolka (editors), Handbook of Process Algebra, pages 333-389, Elsevier, 2001.
     
  41. J.A. Bergstra and A. Ponse. Bochvar-McCarthy logic and process algebra (PDF). Notre Dame Journal of Formal Logic 39(4):464-484, 1998. (Issue appeared in 2000.)
     
  42. J.A. Bergstra and A. Ponse. Process algebra with four-valued logic. Journal of Applied Non-Classical Logics 10(1):27-53, 2000.
     
  43. J.A. Bergstra and A. Ponse. Process algebra with five-valued logic (PostScript, PDF). In C.S. Calude and M.J. Dinneen (editors), Combinatorics, Computation, and Logic, Proceedings of DMTCS'99 and CATS'99, Auckland, vol. 21, nr. 3 of Australian Computer Science Communications, pages 128-143. Springer-Verlag, 1999.
     
  44. J.A. Bergstra and A. Ponse. Grid protocol specifications. In B. Möller and J.V. Tucker (editors), Prospects for Hardware Foundations, vol. 1546 of Lecture Notes in Computer Science, pages 278-308. Springer-Verlag, 1998.
     
  45. J.A. Bergstra and A. Ponse. Kleene's three-valued logic and process algebra (Postscript, PDF). Information Processing Letters 67(2):95-103, 1998.
     
  46. J.A. Bergstra and A. Ponse. Process algebra primitives for file transfer. In Dat is dus heel interessant, Liber Amicorum dedicated to Paul Klint, pages 33-42, CWI, 1997. (See also UvA Report P9725.)
     
  47. J.A. Bergstra, J.A. Hillebrand, and A. Ponse. Grid protocols based on synchronous communication (PDF). Science of Computer Programming 29(1&2): 199-233, 1997.
     
  48. M.A. Bezem and A. Ponse. Two finite specifications of a queue (PDF). Theoretical Computer Science, 177(2):487-507, 1997.
     
  49. A. Ponse. Computable processes and bisimulation equivalence. (PDF). Formal Aspects of Computing 8(6):648-678, 1996.
     
  50. D.F. Bosscher and A. Ponse. Translating a process algebra with symbolic data values to linear format. In U.H. Engberg, K.G. Larsen, and A. Skou (editors), Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Aarhus 1995, BRICS Notes Series NS-95-2, pages 119-130. University of Aarhus, 1995.
     
  51. J.A. Bergstra and A. Ponse. Frame-based process logics (PDF). In A. Ponse, Y. Venema, and M. de Rijke (editors). Modal Logic and Process Algebra, a Bisimulation Perspective, vol. 53 of CSLI Lecture Notes, Stanford, pages 39-64, 1995. On-line version (PDF, 351 pp, 15 MB).
     
  52. J.A. Bergstra and A. Ponse. Frame algebra with synchronous communication. In R.J. Wieringa and R.B. Feenstra (editors), Information Systems - Correctness and Reusability (Selected papers from the IS-CORE Workshop), pages 3-15. World Scientific, 1995.
     
  53. J.F. Groote and A. Ponse. The syntax and semantics of muCRL. A. Ponse, C. Verhoef, and S.F.M. van Vlijmen (editors). Algebra of Communicating Processes, Utrecht 1994. Workshops in Computing, Springer-Verlag, pages 26-62, 1995.
     
  54. J.F. Groote and A. Ponse. Proof theory for muCRL: a language for processes with data. In D.J. Andrews, J.F. Groote, and C.A. Middelburg (editors), Proceedings IWSSL (International Workshop on Semantics of Specification Languages), pages 232-251. Workshops in Computing, Springer-Verlag, 1994. (Extended by CWI Report CS-R9138.) (Also appeared in S. Brlek (editor), Méthodes Mathématiques pour la Synthèse des Systèmes Informatiques, ACFAS 94, Publications du Laboratoire de Combinatoire et d'Informatique Mathématique 15, Université du Québec à Montréal & Centre de Recherche Informatique de Montréal, 1994.)
     
  55. J.A. Bergstra, I. Bethke, and A. Ponse. Process algebra with combinators. In E. Börger, Y. Gurevich, and K. Meinke (editors), Proceedings CSL '93, Swansea, vol. 832 of Lecture Notes in Computer Science, pages 36-65. Springer-Verlag, 1994.
     
  56. J.A. Bergstra, A. Ponse, and J.J. van Wamel. Process algebra with backtracking. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg (editors), Proceedings of the REX Symposium ``A Decade of Concurrency: Reflections and Perspectives'', vol. 803 of Lecture Notes in Computer Science, pages 46-91. Springer-Verlag, 1994.
     
  57. J.A. Bergstra, I. Bethke, and A. Ponse. Process algebra with iteration and nesting. The Computer Journal, 37(4):243-258, 1994. (Partly extended by UvA Report P9314.)
     
  58. A. Ponse. Process algebra and dynamic logic. In J. van Eijck and A. Visser (editors), Logic and Information Flow, pages 125-148. MIT Press, 1994. (PS, PDF.)
     
  59. J.F. Groote and A. Ponse. Process algebra with guards: combining Hoare logic and process algebra. Formal Aspects of Computing, 6(2):115-164, 1994. (PDF) (An extended abstract appeared in proc's CONCUR 91.)
     
  60. A. Ponse et al. Chapter 3 in R. Reed, W. Bouma, M. Dauphin, G.D. Evans, and M. Michel (editors), SPECS - Specification and Programming Environment for Communicating Software, pages 105-122. North-Holland, 1993.
     
  61. A. Ponse. Process Algebras with Data, PhD. Thesis, University of Amsterdam, 1992. Separately published were Chapters 2 (in Inform. and Comput. 95(2), 1995), 3 (in Form. Aspects of Comput. 6(2), 1994), 4 (extended abstract in proc's IWSSL, 1994, and full version as CWI Report CS-R9138), earlier version appeared as Form. Aspects of Comput. 8(6), 1996).
     
  62. J.F. Groote and A. Ponse. muCRL: A base for analysing processes with data. In E. Best and G. Rozenberg (editors), Proceedings 3rd Workshop on Concurrency and Compositionality, Goslar, GMD-Studien Nr. 191, pages 125-130. Universität Hildesheim, May 1991.
     
  63. J.F. Groote and A. Ponse. Process algebra with guards: combining Hoare logic and process algebra (extended abstract). In J.C.M. Baeten and J.F. Groote (editors), Proceedings CONCUR 91, Amsterdam, vol. 527 of Lecture Notes in Computer Science, pages 235-249. Springer-Verlag, 1991. (See also full version in Form. Aspects of Comput. 6(2), 1994.)
     
  64. A. Ponse. Process expressions and Hoare's logic. Information and Computation, 95(2):192-217, 1991.
     
  65. A. Ponse. Encoding types in the Lambek calculus. In J.F.A.K. van Benthem and E. Klein (editors), Categories, Polymorphism and Unification, pages 262-276. Centre for Cognitive Science, University of Edinburgh & Institute for Language, Logic and Information, University of Amsterdam, 1987.


     Editorial work  

  66. J.A. Bergstra, A. Ponse, and S.A. Smolka (editors). Handbook of Process Algebra, Elsevier Science, 2001.
    Review by J.V. Tucker, The Computer Journal 45(1):68-69, 2002.
     
  67. A. Ponse, C. Verhoef, and S.F.M. van Vlijmen (guest editors). Selected papers from the Workshop on Algebra of Communicating Processes, Eindhoven 1995. Theoretical Computer Science, 177(2), May 1997.
     
  68. A. Ponse, Y. Venema, and M. de Rijke (editors). Modal Logic and Process Algebra, a Bisimulation Perspective, vol. 53 of CSLI Lecture Notes, Stanford, 1995. On-line version (PDF, 351 pp, 15 MB).
     
  69. A. Ponse, C. Verhoef, and S.F.M. van Vlijmen (editors). De proceedings: ACP'95, vol. 95-14 of Computing Science Reports. Eindhoven University of Technology, 1995.
     
  70. F.S. de Boer, E.-R. Olderog, A. Ponse, and F.-J. de Vries (guest editors). Selected papers from the Workshop on Assertional Methods. Special issue of Formal Aspects of Computing, 6(6A), 1994.
     
  71. A. Ponse, C. Verhoef, and S.F.M. van Vlijmen (editors). Algebra of Communicating Processes, Utrecht 1994. Workshops in Computing, Springer-Verlag, 1995.


    Some  reports and unpublished material (see also the technical reports of the Programming Research Group, University of Amsterdam and CWI, Amsterdam).  

  72. J.A. Bergstra and A. Ponse. Execution architectures for program algebra. Logic Group Preprint Series 230, Dept. of Philosophy, Utrecht University, 2004. Revised version to appear as cited above.
     
  73. A. Ponse and M.B. van der Zwaag. The logic of ACP. Report SEN-R0207, ISSN 1386-369X, CWI, Amsterdam, 2002. Compressed PostScript and PDF.
     
  74. A. Ponse. Iteration in process algebra. In R. Backhouse, D. Kozen, B. Moeller, Applications of Kleene Algebra, Report 298, Dagstuhl Seminar No. 01081, 2001.
     
  75. J.A. Bergstra and A. Ponse. Program Algebra with Unit Instruction Operator. Reader, University of Amsterdam, 2000. Abstract, full version in PostScript and in PDF.
     
  76. J.A. Bergstra, I. Bethke, and A. Ponse. Basic multi-competence programming. Report P0001, Programming Research Group, University of Amsterdam, 2000. Abstract available.
     
  77. J.A. Bergstra and A. Ponse. Register-machine based processes, Reader, University of Amsterdam, 1999. (Extended version appeared in JACM.)
     
  78. J.A. Bergstra and A. Ponse. Two recursive generalizations of iteration in process algebra. Report P9808, Programming Research Group, University of Amsterdam, 1998. Abstract available. (Extended version appeared in Theoretical Computer Science.)
     
  79. J.A. Bergstra and A. Ponse. Process algebra primitives for file transfer. Report P9725, Programming Research Group, University of Amsterdam, 1997. Abstract available. (See also Liber Amicorum d.t. Paul Klint 1997.)
     
  80. B. Diertens and A. Ponse. New features in PSF II: iteration and nesting. Report P9425, Programming Research Group, University of Amsterdam, 1994. Abstract available.
     
  81. I. Bethke and A. Ponse. A car registration authority - a concise PSF specification. Report P9318, Programming Research Group, University of Amsterdam, 1993. Abstract available.
     
  82. J.A. Bergstra, I. Bethke, and A. Ponse. Process algebra with iteration. Report P9314, Programming Research Group, University of Amsterdam, 1993. (This report partly extends the journal version in Comp. J. 37(4), 1994.) Abstract available.
     
  83. J.J. Brunekreef and A. Ponse. An algebraic specification of a model factory - Part IV. Report P9316, Programming Research Group, University of Amsterdam, 1993. Abstract available.
     
  84. A. Ponse and J.A. Verschuren. An algebraic specification of a model factory - Part III. Report P9303, Programming Research Group, University of Amsterdam, 1993. Abstract available.
     
  85. J.A. Hillebrand and A. Ponse. An algebraic specification of a model factory - Part II. Report P9214, Programming Research Group, University of Amsterdam, 1992. Abstract available.
     
  86. J.A. Bergstra and A. Ponse. Translation of a muCRL-fragment to I-CRL. © SPECS, RACE Project no. 1046, 1991. Abstract available.
     
  87. J.F. Groote and A. Ponse. Proof theory for muCRL. Report CS-R9138, CWI, Amsterdam, 1991. (An extended abstract was published in proc's IWSSL, 1994.) Abstract available.
     
  88. A. Ponse. Process algebra and Hoare's logic. Note CS-N8802, CWI, Amsterdam, 1988. Abstract available.

<- To Alban Ponse's home page