Photographer: onbekend

dr. A. (Alban) Ponse


  • Faculty of Science
    Informatics Institute
  • Visiting address
    Science Park A
    Science Park 904  Room number: C2.114
  • Postal address:
    Postbus  94323
    1090 GH  Amsterdam
  • A.Ponse@uva.nl
    T: 0205257592

2018

2017

  • Bergstra, J. A., & Ponse, A. (2017). Probability Functions in the Context of Signed Involutive Meadows: (Extended Abstract). In P. James, & M. Roggenbach (Eds.), Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Gregynog, UK, September 21–24, 2016 : revised selected papers (pp. 73–87). (Lecture Notes in Computer Science; Vol. 10644). Cham: Springer. DOI: 10.1007/978-3-319-72044-9_6  [details] 

2016

2015

  • Bergstra, J. A., & Ponse, A. (2015). Division by zero in common meadows. In R. De Nicola, & R. Hennicker (Eds.), Software, Services, and Systems: essays dedicated to Martin Wirsing on the occasion of his retirement from the Chair of Programming and Software Engineering (pp. 46-61). (Lecture Notes in Computer Science; No. 8950). Cham: Springer. DOI: 10.1007/978-3-319-15545-6_6  [details] 
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2015). Equations for formally real meadows. Journal of Applied Logic, 13(2, B), 1-23. DOI: 10.1016/j.jal.2015.01.004  [details] 

2013

  • Bergstra, J. A., Bethke, I., & Ponse, A. (2013). Cancellation meadows: a generic basis theorem and some applications. Computer Journal, 56(1), 3-14. DOI: 10.1093/comjnl/bxs028  [details] 

2012

  • Bergstra, J. A., & Ponse, A. (2012). Proposition algebra and short-circuit logic. In F. Arbab, & M. Sirjani (Eds.), Fundamentals of Software Engineering: 4th IPM International Conference, FSEN 2011, Tehran, Iran, April 20-22 2011: revised selected papers (pp. 15-31). (Lecture Notes in Computer Science; Vol. 7141). Heidelberg: Springer. DOI: 10.1007/978-3-642-29320-7_2  [details] 

2011

2009

  • Bergstra, J. A., & Ponse, A. (2009). An instruction sequence semigroup with involutive anti-automorphisms. Scientific Annals of Computer Science, 19, 57-92. [details] 

2008

  • Bergstra, J. A., Ponse, A., & van der Zwaag, M. B. (2008). Tuplix calculus. Scientific Annals of Computer Science, 18, 35-61. [details] 
  • Ponse, A., & van der Zwaag, M. B. (2008). Risk assessment for one-counter threads. Theory of Computing Systems, 43(3-4), 563-582. DOI: 10.1007/s00224-007-9034-5  [details] 

2007

  • Bergstra, J. A., & Ponse, A. (2007). Execution architectures for program algebra. Journal of Applied Logic, 5, 170-192. [details] 
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2007). Decision problems for pushdown threads. Acta Informatica, 44, 75-90. DOI: 10.1007/s00236-007-0040-5  [details] 
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2007). Thread algebra and risk assessment services. In C. Dimitracopoulos, L. Newelski, & D. Normann (Eds.), Proceedings Logic Colloquium 2005 (Vol. 28, pp. 1-17). Cambridge University Press. [details] 
  • Ponse, A., & van der Zwaag, M. B. (2007). A generalization of ACP using Belnaps logic. The Journal of Logic and Algebraic Programming, 70, 222-235. DOI: 10.1016/j.jlap.2006.08.006  [details] 
  • Ponse, A., & van der Zwaag, M. B. (2007). Belnap's logic and conditional composition. Theoretical Computer Science, 388, 319-336. DOI: 10.1016/j.tcs.2007.09.027  [details] 

2006

  • Ponse, A., & van der Zwaag, M. B. (2006). An Introduction to Program and Thread Algebra. Lecture Notes in Computer Science, 3988, 445-458. DOI: 10.1007/11780342_46  [details] 

2005

  • Bergstra, J. A., & Ponse, A. (2005). A bypass of Cohen's impossibility result. Lecture Notes in Computer Science, 3470, 1097-1106. [details] 
  • Ponse, A., & van der Zwaag, M. B. (2005). ACP and Belnap's logic. Algebraic Process Calculi: The First Twenty Five Years and Beyond, 05-3, 204-208. [details] 

2003

  • Bergstra, J. A., Ponse, A., & van der Zwaag, M. B. (2003). Branching Time and Orthogonal Bisimulation Equivalence. Theoretical Computer Science, 309(1-3), 313-355. DOI: 10.1016/S0304-3975(03)00277-9  [details] 

2002

2001

  • Bergstra, J. A., & Ponse, A. (2001). Non-regular iterators in process algebra. Theoretical Computer Science, 269(1-2), 203-229. DOI: 10.1016/S0304-3975(00)00413-8  [details] 
  • Bergstra, J. A., & Ponse, A. (2001). Process algebra and conditional composition. Information Processing Letters, 80(1), 41-49. DOI: 10.1016/S0020-0190(01)00216-2  [details] 
  • Bergstra, J. A., & Ponse, A. (2001). Register-machine based processes. Journal of the Association for Computing Machinery, 48(6), 1207-1241. DOI: 10.1145/504794.504799  [details] 
  • Bergstra, J. A., Fokkink, W. J., & Ponse, A. (2001). Process algebra with recursive operations. In J. A. Bergstra, A. Ponse, & S. A. Smolka (Eds.), Handbook of Process Algebra (pp. 333-389). Elsevier. [details] 
  • Ponse, A., & Usenko, Y. S. (2001). Equivalence of recursive specifications in process algebra. Information Processing Letters, 80(1), 59-65. DOI: 10.1016/S0020-0190(01)00218-6  [details] 
  • Groote, J. F., Ponse, A., & Usenko, Y. S. (2001). Linearization in parallel pCRL. The Journal of Logic and Algebraic Programming, 48, 39-70. DOI: 10.1016/S1567-8326(01)00005-4  [details] 

2000

  • Bergstra, J. A., & Ponse, A. (2000). Bochvar-McCarthy logic and process algebra. Notre Dame Journal of Formal Logic, 39(4), 464-484. [details] 
  • Bergstra, J. A., & Ponse, A. (2000). Process algebra with four-valued logic. Journal of Applied Non-Classical Logics, 10(1), 27-53. [details] 

1999

  • Bergstra, J. A., & Ponse, A. (1999). Process algebra with five-valued logic. Australian Computer Science Communications, 21, 128-143. [details] 

1998

  • Bergstra, J. A., & Ponse, A. (1998). Grid protocol specifications. In Propects for hardware foundations (pp. 278-309). (LNCS; No. 1546). Springer Verlag GmbH. [details] 
  • Bergstra, J. A., & Ponse, A. (1998). Kleene's tree-valued logic and process algebra. Information Processing Letters, 67, 95-103. DOI: 10.1016/S0020-0190(98)00083-0  [details] 

1997

1996

  • Ponse, A. (1996). Computable Processes and Bisimulation Equivalence. Formal Aspects of Computing, 8(6), 648-678. [details] 

1994

  • Bergstra, J. A., Bethke, I., & Ponse, A. (1994). Process algebra with combinators. Lecture Notes in Computer Science, 832, 36-65.
  • Bergstra, J. A., Bethke, I., & Ponse, A. (1994). Process algebra with iteration and nesting. Computer Journal, 37(4), 243-258. DOI: 10.1093/comjnl/37.4.243  [details] 
  • Bergstra, J. A., Ponse, A., & van Wamel, J. J. (1994). Process Algebra with Backtracking. In W. P. Roever, J. W. de Bakker, & G. Rozenberg (Eds.), Proceedings of the REX Symposium `A Decade of Concurrency: Reflections and Perspectives' (pp. 46-91). (Lecture Notes in Computer Science). Berlin: Springer Verlag. [details] 
  • Groote, J. F., & Ponse, A. (1994). Process Algebra with Guards. Combining Hoare Logic and Process Algebra. Formal Aspects of Computing, 6, 115-164. [details] 
  • Groote, J. F., & Ponse, A. (1994). Proof Theory for mCRL: a Language for Processes with Data. In J. F. Groote, D. J. Andrews, & C. A. Middelburg (Eds.), Proceedings of the International Workshop on Semantics of Specification Languages (pp. 232-251). (Workshops in Computing). Berlin: Springer-Verlag. [details] 
  • Groote, J. F., & Ponse, A. (1994). The Syntax and Semantics of mCRL. In C. Verhoef, A. Ponse, & S. F. M. Vlijmen (Eds.), Algebra of Communicating Processes, Utrecht 1994 (pp. 26-62). (Workshops in Computing). Berlin: Springer Verlag. [details] 

1991

  • Ponse, A. (1991). Process expressions and Hoare's logic. Information and Computation, 95(2), 192-217. DOI: 10.1016/0890-5401(91)90044-3 
  • Groote, J. F., & Ponse, A. (1991). Process algebra with guards: combining Hoare logic and process algebra (extended abstract). Lecture Notes in Computer Science, 527, 235-249.
  • Groote, J. F., & Ponse, A. (1991). muCRL: A base for analysing processes with data. In E. Best, & G. Rozenberg (Eds.), Proceedings 3rd Workshop on Concurrency and Compositionality, Goslar, GMD-Studien Nr. 191 (pp. 125-139). Hildesheim: Universität Hildesheim.

1987

  • Ponse, A. (1987). Encoding types in the Lambek calculus. In E. Klein, & J. F. A. K. van Benthem (Eds.), Categories, Polymorphism and Unification (pp. 262-276). Edinburgh: Centre for Cognitive Science, University of Edinburgh & Institute for Language, Logic and Information, University of Amsterdam.

2017

  • Ponse, A., & Staudt, D. J. C. (2017). An independent axiomatization for free short-circuit logic. Ithaca N.Y.: arXiv.org.

2016

  • Bergstra, J. A., & Ponse, A. (2016). Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view. arXiv.org.

2014

  • Bergstra, J. A., & Ponse, A. (2014). Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. Ithaca, NY: arXiv.org.

2010

2009

  • Bergstra, J. A., & Ponse, A. (2009). A progression ring for interfaces of instruction sequences, threads, and services. Ithaca, NY: arXiv.org. [details] 

2008

  • Bergstra, J. A., & Ponse, A. (2008). A generic basis theorem for cancellation meadows. Ithaca, NY: arXiv.org. [details] 
  • Bergstra, J. A., & Ponse, A. (2008). An instruction sequence semigroup with repeaters. Ithaca, NY: arXiv.org. [details] 
  • Bergstra, J. A., & Ponse, A. (2008). Differential meadows. Ithaca, NY: arXiv.org. [details] 
  • Bergstra, J. A., & Ponse, A. (2008). Proposition algebra with projective limits. Ithaca, NY: arXiv.org. [details] 

2007

  • Bergstra, J. A., & Ponse, A. (2007). Interface Groups and Financial Transfer Architectures. (PRG technical report). Ithaca, NY: arXiv.org. [details] 
  • Bergstra, J. A., Ponse, A., & van der Zwaag, M. B. (2007). Tuplix Calculus. (PRG technical report). Ithaca, NY: arXiv.org. [details] 

2006

  • Bergstra, J. A., & Ponse, A. (2006). Interface Groups for Analytic Execution Architectures. Amsterdam: Programming Research Group, UvA. [details] 
  • Bergstra, J. A., & Ponse, A. (2006). Program Algebra with Repeat Instruction. Amsterdam: Programming Research Group, UvA. [details] 
  • Bergstra, J. A., & Ponse, A. (2006). Projection Semantics for Rigid Loops. Amsterdam: Programming Research Group, UvA. [details] 
  • Bergstra, J. A., & Ponse, A. (2006). A bypass of Cohen's impossibility result: Extended version (in html). VX Heaven, Library. [details] 
  • Ponse, A., & van der Zwaag, M. B. (2006). Risk Assessment for One-Counter Threads. Amsterdam: Programming Research Group, UvA. [details] 

2005

  • Bergstra, J. A., & Ponse, A. (2005). A Bypass of Cohen's Impossibility Result. (PRG; No. 0501). Amsterdam: Informatics Institute. [details] 
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2005). Decision Problems for Pushdown Threads. (PRG0502). Amsterdam: Informatics Institute. [details] 

2001

  • Bergstra, J. A., Ponse, A., & Smolka, S. A. (2001). Handbook of Process Algebra. Amsterdam: Elsevier Science. [details] 
  • Ponse, A. (2001). Iteration in process algebra. In R. Backhouse, D. Kozen, & B. Moeller (Eds.), Applications of Kleene Algebra, Report 298 (Report; No. 298). Dagstuhl Seminar no. 01081. [details] 
  • Ponse, A., & Usenko, Y. S. (2001). Equivalence of recursive specifications in process algebra. (Report; No. SEN-R0107). onbekend: CWI. [details] 

2000

  • Bergstra, J. A., Bethke, I., & Ponse, A. (2000). Basic Multi-Competence Programming. (Report P0001). Amsterdam: Informatics Institute. [details] 
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2000). Data flow networks in Java. In J. A. Bergstra (Ed.), Objects, classes, molecules and threads Amsterdam: Faculteit der Natuurwetenschappen, Wiskunde en Informatica. [details] 
  • Bergstra, J. A., Ponse, A., & van der Zwaag, M. B. (2000). Branching Time and Orthogonal Bisimulation Equivalence. (Report SEN; No. R0035). Nederland: CWI. [details] 
  • Groote, J. F., Ponse, A., & Usenko, Y. S. (2000). Linearization in parallel pCRL. (Report SEN; No. Roo19). Nederland: CWI. [details] 

1997

  • Bergstra, J. A., & Ponse, A. (1997). Bochvar-McCarthy Logic and Process Algebra. (Technical Report; No. P9722). onbekend: onbekend (FdL). [details] 
  • Bergstra, J. A., & Ponse, A. (1997). Grid Protocol Specifications. (Technical Report; No. P9726). onbekend: onbekend (FdL). [details] 
  • Bergstra, J. A., & Ponse, A. (1997). Kleene's Three-Valued Logic and Process Algebra. (Technical Report; No. P9723). onbekend: onbekend (FdL). [details] 
  • Bergstra, J. A., & Ponse, A. (1997). Process Algebra Primitives for File Transfer. (Technical Report; No. P9725). onbekend: onbekend (FdL). [details] 
  • Bergstra, J. A., & Ponse, A. (1997). Process Algebra with Four-Valued Logic. (Technical Report; No. P9724). onbekend: onbekend (FdL). [details] 

1995

  • Bergstra, J. A., & Ponse, A. (1995). Frame algebra with synchronous communication. In R. B. Feenstra, & R. J. Wieringa (Eds.), Information Systems - Correctness and Reusability (Selected papers from the ISCORE Workshop) (pp. 3-15). World Scientific. [details] 
  • Bergstra, J. A., & Ponse, A. (1995). Frame-based process logics. In M. de Rijke, A. Ponse, & Y. Venema (Eds.), Modal Logic and Process Algebra (pp. 39-63). (CSLI Lecture Notes; No. 53). Stanford: CSLI Publications. [details] 
  • Bergstra, J. A., Hillebrand, J. A., & Ponse, A. (1995). Grid protocols based on synchronous communication: specification and correctness. (Technical Report; No. P9511). onbekend: onbekend (FdL). [details] 
  • Ponse, A., Verhoef, C., & van Vlijmen, S. F. M. (1995). Algebra of Communicating Processes. (Workshops in Computing). Berlin: Springer. [details] 
  • Ponse, A., Verhoef, C., & van Vlijmen, S. F. M. (1995). De proceedings: ACP'95. (Computing Science Reports; No. 95-14). Eindhoven: Eindhoven University of Technology. [details] 
  • Ponse, A., de Rijke, M., & Venema, Y. (1995). Modal Logic and Process Algebra. (CSLI Lecture Notes; No. 53). Stanford: CSLI Publications. [details] 
  • Ponse, A., de Rijke, M., & Venema, Y. (1995). Preface. In A. Ponse, M. de Rijke, & Y. Venema (Eds.), Modal logic and process algebra: a bisimulation perspective (pp. vii-xi). (CSLI lecture notes; No. 53). Stanford, CA: CSLI Publications. [details] 
  • Bezem, M. A., & Ponse, A. (1995). Two finite specifications of a queue. In C. Verhoef, S. F. M. van Vlijmen, & A. Ponse (Eds.), De proceedings: ACP'95 (pp. 121-137) [details] 
  • Bosscher, D. F., & Ponse, A. (1995). Translating a process algebra with symbolic data values to linear format. In U. H. Engberg, K. G. Larsen, & A. Skou (Eds.), Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (pp. 119-130). BRICS Notes Series, University of Aarhus. [details] 

1994

  • Ponse, A. (1994). Process Algebra and Dynamic Logic. In A. Visser, & J. van Eijck (Eds.), Logic and Information Flow (pp. 125-148). Cambridge Mass.: MIT Press.

1993

  • Bethke, I., & Ponse, A. (1993). A car registration authority, a concise PSF specification. (P9318). Amsterdam: University of Amsterdam, Informatics Institute.

2014

  • Bergstra, J. A., Bethke, I., & Ponse, A. (2014). Rekenen-Informatica. (TCS Electronic Report series; No. 1412). Amsterdam: University of Amsterdam, Theory of Computer Science. [details] 

2010

  • Ponse, A., & Schroevers, S. (2010). UvA Webklas Informatica: Wat is een programma? In F. Vodegel, & M. Loots (Eds.), NIOC Proceedings: 7 en 8 april 2009, Utrecht (pp. 85-92). Utrecht: Hogeschool Utrecht. [details] 

2003

  • Bethke, I., & Ponse, A. (2003). Programma-Algebra, een inleiding tot de Programmatuur. Amsterdam: Vossiuspers UvA. [details] 

1998

  • Bergstra, J. A., & Ponse, A. (1998). Two recursive generalisations of iteration in process algebra. Amsterdam: WINS (oud WINS). [details] 

2004

Journal editor

  • de Boer, F. S. (editor), Olderog, E. R. (editor), Ponse, A. (editor) & de Vries, F. J. (editor) (1994). Formal Aspects of Computing (Journal).

2009

  • Diertens, B. (2009). Software Engineering with Process Algebra

2007

  • Vu, T. D. (2007). Semantics and applications of process and program algebra [details] 

2005

  • Gattari, M. (2005). Distributed Systems, the delta and gamma- Calculus

1992

  • Ponse, A. (1992). Process Algebras with Data Amsterdam: CWI

2014

  • Bergstra, J. A., Bethke, I., & Ponse, A. (2014). Equations for formally real meadows. Ithaca, NY: arXiv.org. [details] 

2013

  • Bergstra, J. A., & Ponse, A. (2013). Periodic single-pass instruction sequences. Ithaca, NY: arXiv.org.

2010

  • Bergstra, J. A., & Ponse, A. (2010). On Hoare-McCarthy algebras. Ithaca, NY: arXiv.org. [details] 
This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library  or the Pure staff  of your faculty / institute. Log in to Pure  to edit your publications. Log in to Personal Page Publication Selection tool  to manage the visibility of your publications on this list.
  • No ancillary activities

edit contact information edit tabs