Bergstra, J. A., & Ponse, A. (2021). Datatype defining rewrite systems for naturals and integers. Logical Methods in Computer Science, 17(1), Article 17. https://doi.org/10.23638/LMCS-17(1:17)2021[details]
Bergstra, J. A., Ponse, A., & Staudt, D. J. C. (2021). Non-commutative propositional logic with short-circuit evaluation. Journal of Applied Non-Classical Logics, 31(3-4), 234-278. Advance online publication. https://doi.org/10.1080/11663081.2021.2010954[details]
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). Springer. https://doi.org/10.1007/978-3-319-72044-9_6[details]
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). Springer. https://doi.org/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, pt. B), 1-23. Advance online publication. https://doi.org/10.1016/j.jal.2015.01.004[details]
Bergstra, J. A., Bethke, I., & Ponse, A. (2013). Cancellation meadows: a generic basis theorem and some applications. Computer Journal, 56(1), 3-14. Advance online publication. https://doi.org/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). Springer. https://doi.org/10.1007/978-3-642-29320-7_2[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. (2006). An Introduction to Program and Thread Algebra. Lecture Notes in Computer Science, 3988, 445-458. https://doi.org/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]
Bergstra, J. A., & Ponse, A. (2005). A bypass of Cohen's impossibility result. In Advances in Grid Computing - EGC 2005 (Vol. 3470, pp. 1097-1106). (LNCS; Vol. 3470). Springer Verlag.
Ponse, A., & van der Zwaag, M. B. (2005). ACP and Belnap's logic. In L. Aceto, & A. D. Gordon (Eds.), Algebraic Process Calculi: The First Twenty Five Years and Beyond: Bertinoro (Forl`ı), Italy, August 1–5, 2005 (Vol. 05-03, pp. 204-208). (BRICS Notes Series publications).. https://www.brics.dk/NS/05/3/index.html[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. https://doi.org/10.1016/S0304-3975(03)00277-9[details]
Bergstra, J. A., & Ponse, A. (2001). Register-machine based processes. Journal of the Association for Computing Machinery, 48(6), 1207-1241. https://doi.org/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]
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 three-valued logic and process algebra. Information Processing Letters, 67(2), 95-103.
Bergstra, J. A., Ponse, A., & van Wamel, J. J. (1994). Process Algebra with Backtracking. In J. W. de Bakker, W-P. de Roever, & G. Rozenberg (Eds.), A Decade of Concurrency Reflections and Perspectives: REX School/Symposium Noordwijkerhout, The Netherlands June 1–4, 1993 : proceedings (pp. 46-91). (Lecture Notes in Computer Science; Vol. 803). Springer. https://doi.org/10.1007/3-540-58043-3_17[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
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.
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.
Bergstra, J. A., & Ponse, A. (2016). Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view. (1 ed.) Informatics Institute, University of Amsterdam. https://arxiv.org/abs/1608.06212v1[details]
Bergstra, J. A., & Ponse, A. (2014). Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. (2 ed.) Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1406.3280v2[details]
Bergstra, J. A., & Ponse, A. (2009). A progression ring for interfaces of instruction sequences, threads, and services. ArXiv. http://arxiv.org/abs/0909.2839[details]
Bergstra, J. A., & Ponse, A. (2007). Interface Groups and Financial Transfer Architectures. (PRG technical report). ArXiv. http://arxiv.org/abs/0707.1639[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]
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]
Ponse, A., Verhoef, C., & van Vlijmen, S. F. M. (1995). Algebra of Communicating Processes. (Workshops in Computing). 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). 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). CSLI Publications. [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.
de Boer, F. S., Olderog, E. R., Ponse, A., & de Vries, F. J. (1994). Editorial. Formal Aspects of Computing, 6(6), 741-742. https://doi.org/10.1007/BF01213600
1993
Bethke, I., & Ponse, A. (1993). A car registration authority, a concise PSF specification. (P9318). Amsterdam: University of Amsterdam, Informatics Institute.
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). Hogeschool Utrecht. [details]
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]
2010
Bethke, I. (Author), Diertens, B. (Author), & Ponse, A. (Author). (2010). Webklas Informatica: Wat is een programma?. Web publication or website https://tcs.science.uva.nl/WebKlas/
2005
Bethke, I., Diertens, B., & Ponse, A. (2005). Webklas Informatica: Wat is een programma? Electronic publication in Dutch. http://www.science.uva.nl/~alban/WebKlas
2011
Bethke, I., Ponse, A., & Rodenburg, P. H. (2011). Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday. Theoretical Computer Science, 412(28), 3033-3034. https://doi.org/10.1016/j.tcs.2011.04.016[details]
2006
Bergstra, J. A., Bethke, I., & Ponse, A. (2006). Decision problems for pushdown threads. The Bulletin of Symbolic Logic, 12, 311-312. [details]
Ponse, A., & van der Zwaag, M. B. (2006). A generalization of ACP using Belnaps logic: Extended abstract. Electronic Notes in Theoretical Computer Science, 162, 287-293. [details]
2004
Bethke, I. (Author), Diertens, B. (Author), & Ponse, A. (Author). (2004). Webklas Informatika: Wat is een programma?. Software, University of Amsterdam. http://www.science.uva.nl/~alban/WebKlas/
Tijdschriftredactie
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. [Thesis, fully internal, Universiteit van Amsterdam]. [details]
Gattari, M. (2005). Distributed Systems, the delta and gamma- Calculus.
1992
Ponse, A. (1992). Process Algebras with Data. Amsterdam: CWI.
2018
Bergstra, J. A., Ponse, A., & Staudt, D. J. C. (2018). Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant. ArXiv. https://arxiv.org/abs/1810.02142[details]
Ponse, A., & Staudt, D. J. C. (2017). An independent axiomatization for free short-circuit logic. (1 ed.) Section Theory of Computer Science, University of Amsterdam. https://arxiv.org/abs/1707.05718v1[details]
Bergstra, J. A., & Ponse, A. (2016). Probability functions in the context of signed involutive meadows. Informatics Institute, University of Amsterdam. https://arxiv.org/abs/1307.5173v3[details]
Bergstra, J. A., & Ponse, A. (2015). Evaluation trees for proposition algebra. Section Theory of Computer Science, University of Amsterdam. http://arxiv.org/abs/1504.08321[details]
Bergstra, J. A., & Ponse, A. (2015). Poly-infix operators and operator families. Section Theory of Computer Science, University of Amsterdam. http://arxiv.org/abs/1505.01087[details]
Bergstra, J. A., & Ponse, A. (2014). Fracpairs: fractions over a reduced commutative ring. (1 ed.) Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1411.4410v1[details]
Bergstra, J. A., & Ponse, A. (2013). Periodic single-pass instruction sequences. (2 ed.) Informatics Institute, University of Amsterdam. http://arxiv.org/abs/0810.1151v2[details]
Bergstra, J. A., & Ponse, A. (2013). Signed Meadow valued Probability Mass Functions. Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1307.5173[details]
Bergstra, J. A., & Ponse, A. (2009). An Instruction Sequence Semigroup with Involutive Anti-Automorphisms. (1 ed.) Section Software Engineering, University of Amsterdam. https://arxiv.org/abs/0903.1352v1[details]
De UvA gebruikt cookies voor het meten, optimaliseren en goed laten functioneren van de website. Ook worden er cookies geplaatst om inhoud van derden te kunnen tonen en voor marketingdoeleinden. Klik op ‘Accepteren’ om akkoord te gaan met het plaatsen van alle cookies. Of kies voor ‘Weigeren’ om alleen functionele en analytische cookies te accepteren. Je kunt je voorkeur op ieder moment wijzigen door op de link ‘Cookie instellingen’ te klikken die je onderaan iedere pagina vindt. Lees ook het UvA Privacy statement.