Publisher
Springer International Publishing
Reference23 articles.
1. Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Ann. Pure Appl. Logic 100, 141–187 (1999)
2. Börger, E.: Computability, Complexity, Logic, Studies in Logic and the Foundations of Mathematics, vol. 128. North-Holland (1989)
3. Börger, E.: The ASM refinement method. Formal Aspects Comput. 15(2–3), 237–257 (2003). https://doi.org/10.1007/s00165-003-0012-7
4. Börger, E.: The role of executable abstract programs for software development and documentation (2022, personal communication, to be published)
5. Börger, E., Durdanovic, I.: Correctness of compiling Occam to Transputer code. Comput. J. 39(1), 52–92 (1996). https://doi.org/10.1093/comjnl/39.1.52