Personal Home Page

http://staff.science.uva.nl/~janb/cvSept05.html

Articles in Scholarly Journals [Incomplete List]

1. Simulating Turing machines on Maurer machines
   Journal of Applied Logic, vol. 6, no. 1, pp. 1–23, 2008
2. Thread algebra for strategic interleaving
   Formal Aspects of Computing, vol. 19, no. 4, pp. 445–474, 2007
3. A Thread Algebra with Multi-Level Strategic Interleaving
   Theory of Computing Systems, vol. 41, no. 1, pp. 3–32, 2007
4. Decision problems for pushdown threads
   Acta Informatica, vol. 44, no. 2, pp. 75–90, 2007
5. Synchronous cooperation for explicit multi-threading
   Acta Informatica, vol. 44, no. 7-8, pp. 525–569, 2007
6. Preferential choice and coordination conditions
   Journal of Logic and Algebraic Programming, vol. 70, no. 2, pp. 172–200, 2007
7. About “trivial” software patents: The IsNot case?
   Science of Computer Programming, vol. 64, no. 3, pp. 264–285, 2007
8. Letter from the editor
   Science of Computer Programming, vol. 65, no. 1, pp. v–v, 2007
9. Execution architectures for program algebra
   Journal of Applied Logic, vol. 5, no. 1, pp. 170–192, 2007
10. Maurer computers for pipelined instruction processing
    Mathematical Structures in Computer Science, vol. 18, no. 02, 2007
11. The rational numbers as an abstract data type
    Journal of the ACM, vol. 54, no. 2, pp. 7–es, 2007
12. Continuity controlled hybrid automata
    Journal of Logic and Algebraic Programming, vol. 68, no. 1-2, pp. 5–53, 2006
13. Six Themes for Future Concurrency Research
    Electronic Notes in Theoretical Computer Science, vol. 162, pp. 61–64, 2006
14. On the Design Rationale of ACP Style Process Algebras
    Electronic Notes in Theoretical Computer Science, vol. 162, pp. 79–85, 2006
15. Splitting bisimulations and retrospective conditions
    Information and Computation, vol. 204, no. 7, pp. 1083–1138, 2006
16. An upper bound for the equational specification of finite state services
    Information Processing Letters, vol. 94, no. 6, pp. 267–269, 2005
17. Process algebra for hybrid systems
    Theoretical Computer Science, vol. 335, no. 2-3, pp. 215–280, 2005
18. Polarized process algebra with reactive composition
    Theoretical Computer Science, vol. 343, no. 3, pp. 285–304, 2005
19. Network algebra in Java
    Journal of Logic and Algebraic Programming, 2004
20. Operator programs and operator processes
    Information and Software Technology, vol. 45, no. 10, pp. 681–689, 2003
21. Branching time and orthogonal bisimulation equivalence
    Theoretical Computer Science, vol. 309, no. 1-3, pp. 313–355, 2003
22. Molecule-oriented programming in Java
    Information and Software Technology, vol. 44, no. 11, pp. 617–638, 2002
23. Program algebra for sequential code
    Journal of Logic and Algebraic Programming, vol. 51, no. 2, pp. 125–156, 2002
24. Combining programs and state machines
    Journal of Logic and Algebraic Programming, vol. 51, no. 2, pp. 175–192, 2002
25. Molecular dynamics
    Journal of Logic and Algebraic Programming, vol. 51, no. 2, pp. 193–214, 2002
26. Non-regular iterators in process algebra
    Theoretical Computer Science, vol. 269, no. 1-2, pp. 203–229, 2001
27. Process algebra and conditional composition
    Information Processing Letters, vol. 80, no. 1, pp. 41–49, 2001
28. Register-machine based processes
    Journal of the ACM, vol. 48, no. 6, pp. 1207–1241, 2001
29. Program Algebra for Component Code
    Formal Aspects of Computing, vol. 12, no. 1, pp. 1–17, 2000
30. Kleene's three-valued logic and process algebra
    Information Processing Letters, vol. 67, no. 2, pp. 95–103, 1998
31. The discrete time ? — A software coordination architecture
    Science of Computer Programming, vol. 31, no. 2-3, pp. 205–229, 1998
32. Deadlock Behaviour in Split and ST Bisimulation Semantics
    Electronic Notes in Theoretical Computer Science, vol. 16, no. 2, pp. 61–74, 1998
33. Grid protocols based on synchronous communication
    Science of Computer Programming, vol. 29, no. 1-2, pp. 199–233, 1997
34. Toward a complete transformational toolkit for compilers
    ACM Transactions on Programming Languages and Systems, vol. 19, no. 5, pp. 639–684, 1997
35. Network algebra for asynchronous dataflow
    International Journal of Computer Mathematics, vol. 65, no. 1, pp. 57–88, 1997
36. Process algebra with prepositional signals
    Theoretical Computer Science, vol. 177, no. 2, pp. 381–405, 1997
37. Algebra of timed frames
    International Journal of Computer Mathematics, vol. 61, no. 3, pp. 227–255, 1996
38. Strategic directions in concurrency research
    ACM Computing Surveys, vol. 28, no. 4, pp. 607–625, 1996
39. Discrete time process algebra
    Formal Aspects of Computing, vol. 8, no. 2, pp. 188–208, 1996
40. On sequential composition, action prefixes and process prefix
    Formal Aspects of Computing, vol. 6, no. 3, pp. 250–268, 1994
41. Logic of transition systems
    Journal of Logic, Language and Information, vol. 3, no. 4, pp. 247–283, 1994
42. Bisimulation is two-way simulation
    Information Processing Letters, vol. 52, no. 6, pp. 285–287, 1994
43. Which data types have ?-complete initial algebra specifications?
    Theoretical Computer Science, vol. 124, no. 1, pp. 149–168, 1994
44. Process Algebra with Iteration and Nesting
    The Computer Journal, vol. 37, no. 4, pp. 243–258, 1994
45. Decidability of bisimulation equivalence for process generating context-free languages
    Journal of the ACM, vol. 40, no. 3, pp. 653–682, 1993
46. Real space process algebra
    Formal Aspects of Computing, vol. 5, no. 6, pp. 481–529, 1993
47. Real time process algebra
    Formal Aspects of Computing, vol. 3, no. 2, pp. 142–188, 1991
48. Recursive process definitions with the state operator
    Theoretical Computer Science, vol. 82, no. 2, pp. 285–302, 1991
49. Module algebra
    Journal of the ACM, vol. 37, no. 2, pp. 335–372, 1990
50. Term-rewriting systems with rule priorities
    Theoretical Computer Science, vol. 67, no. 2-3, pp. 283–301, 1989
51. SIAM Journal on Computing, vol. 17, no. 6, Article ID 0217073, 1988
52. On the consistency of Koomen's Fair Abstraction Rule
    Theoretical Computer Science, vol. 51, no. 1-2, pp. 129–176, 1987
53. Algebraic specifications of computable and semicomputable data types
    Theoretical Computer Science, vol. 50, no. 2, pp. 137–181, 1987
54. Conditional rewrite rules: Confluence and termination
    Journal of Computer and System Sciences, vol. 32, no. 3, pp. 323–362, 1986
55. Top-down design and the algebra of communicating processes
    Science of Computer Programming, vol. 5, pp. 171–199, 1985
56. Algebra of communicating processes with abstraction
    Theoretical Computer Science, vol. 37, pp. 77–121, 1985
57. The axiomatic semantics of programs based on Hoare's logic
    Acta Informatica, vol. 21, no. 3, pp. 293–320, 1984
58. Proving program inclusion using Hoare's logic
    Theoretical Computer Science, vol. 30, no. 1, pp. 1–48, 1984
59. Linear time and branching time semantics for recursion with merge
    Theoretical Computer Science, vol. 34, no. 1-2, pp. 135–156, 1984
60. Process algebra for synchronous communication
    Information and Control, vol. 60, no. 1-3, pp. 109–137, 1984
61. A proof rule for restoring logic circuits
    Integration, the VLSI Journal, vol. 1, no. 2-3, pp. 161–178, 1983
62. Hoare's logic for programming languages with two data types
    Theoretical Computer Science, vol. 28, no. 1-2, pp. 215–221, 1983
63. Standard model semantics for DSL a data type specification language
    Acta Informatica, vol. 19, no. 1, 1983
64. Two theorems about the completeness of Hoare's logic
    Information Processing Letters, vol. 15, no. 4, pp. 143–149, 1982
65. The completeness of the algebraic specification methods for computable data types
    Information and Control, vol. 54, no. 3, pp. 186–200, 1982
66. Small specifications for large finite data structures
    International Journal of Computer Mathematics, vol. 9, no. 4, pp. 305–320, 1981
67. Recursion theory on processes
    International Journal of Computer Mathematics, vol. 7, no. 2, pp. 119–128, 1979