Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 107
Number of items: 107
  • Ponse, A., & van der Zwaag, M. B. (2006). Risk Assessment for One-Counter Threads. Programming Research Group, UvA.
  • 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.
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2006). Decision problems for pushdown threads. The Bulletin of Symbolic Logic, 12, 311-312.
  • Bergstra, J. A., & Ponse, A. (2006). A bypass of Cohen's impossibility result: Extended version (in html). VX Heaven, Library. http://vx.netlux.org/lib/mjb00.html
  • 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
  • Bergstra, J. A., & Ponse, A. (2006). Interface Groups for Analytic Execution Architectures. Programming Research Group, UvA.
  • Bergstra, J. A., & Ponse, A. (2006). Program Algebra with Repeat Instruction. Programming Research Group, UvA.
  • 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
  • Bergstra, J. A., & Ponse, A. (2005). A Bypass of Cohen's Impossibility Result. (PRG; No. 0501). Informatics Institute.
  • Bergstra, J. A., & Ponse, A. (2005). A bypass of Cohen's impossibility result. Lecture Notes in Computer Science, 3470, 1097-1106.
Page 6 of 11