All Stories

  1. Using Hoare Logic in a Process Algebra Setting
  2. On the strongest three-valued paraconsistent logic contained in classical logic and its dual
  3. Probabilistic Process Algebra and Strategic Interleaving
  4. On the complexity of the correctness problem for non-zeroness test instruction sequences
  5. Program Algebra for Turing-Machine Programs
  6. Instruction Sequences Expressing Multiplication Algorithms
  7. Process Algebra with Strategic Interleaving
  8. Contradiction-Tolerant Process Algebra with Propositional Signals
  9. Axioms for Behavioural Congruence of Single-Pass Instruction Sequences
  10. Instruction Sequence Size Complexity of Parity
  11. Transformation of fractions into simple fractions in divisive meadows
  12. A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences
  13. On Instruction Sets for Boolean Registers in Program Algebra
  14. On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions
  15. Division by zero in non-involutive meadows
  16. Probabilistic Thread Algebra
  17. Instruction Sequence Based Non-uniform Complexity Classes
  18. A Process Calculus with Finitary Comprehended Terms
  19. Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting
  20. Timed Tuplix Calculus and the Wesseling and van den Bergh Equation
  21. Instruction sequence processing operators
  22. Indirect Jumps Improve Instruction Sequence Performance
  23. Instruction Sequences for Computer Science
  24. On the Behaviours Produced by Instruction Sequences under Execution
  25. Inversive meadows and divisive meadows
  26. Thread algebra for poly-threading
  27. Preliminaries to an Investigation of Reduced Product Set Finance
  28. On the Expressiveness of Single-Pass Instruction Sequences
  29. A thread calculus with molecular dynamics
  30. On the operating unit size of load/store architectures
  31. An Interface Group for Process Components
  32. Data Linkage Dynamics with Shedding
  33. Machine structure oriented control code logic
  34. Instruction Sequences with Dynamically Instantiated Instructions
  35. Transmission Protocols for Instruction Streams
  36. Program algebra with a jump-shift instruction
  37. Distributed strategic interleaving with load balancing
  38. Parallel Processes with Implicit Computational Capital
  39. Simulating Turing machines on Maurer machines
  40. Maurer computers for pipelined instruction processing
  41. Synchronous cooperation for explicit multi-threading
  42. A Thread Algebra with Multi-Level Strategic Interleaving
  43. Thread algebra for strategic interleaving
  44. Preferential choice and coordination conditions
  45. Conditionals in Algebraic Process Calculi
  46. Splitting bisimulations and retrospective conditions
  47. Continuity controlled hybrid automata
  48. Process algebra for hybrid systems
  49. A Thread Algebra with Multi-level Strategic Interleaving
  50. Model Theory for Process Algebra
  51. Strong Splitting Bisimulation Equivalence
  52. An alternative formulation of operational conservativity with binding terms
  53. Revisiting timing in process algebra
  54. Guest editor's introduction
  55. Process Algebra with Timing
  56. Real time process algebra with time-dependent conditions
  57. Variable binding operators in transition system specifications
  58. Discrete Time Process Algebra and the Semantics of SDL
  59. Process Algebra with Timing: Real Time and Discrete Time
  60. Detection of non-determinacy feature interactions
  61. Truth of Duration Calculus Formulae in Timed Frames
  62. Network algebra for asynchronous dataflow∗
  63. Algebra of timed frames
  64. A typed logic of partial functions reconstructed classically
  65. Formalisation of properties for feature interaction detection: Experience in a real-life situation
  66. Notations for Software Design
  67. Semantics of Specification Languages (SoSL)
  68. Modular structuring of VDM specifications in VVSL
  69. Specification of interfering programs based on interconditions
  70. VVSL Specification of a Transaction-oriented Access Handler
  71. Experiences with combining formalisms in VVSL
  72. LPF and MPLω — A logical comparison of VDM SL and COLD-K
  73. VVSL: A language for structured VDM specifications
  74. The VIP VDM Specification Language
  75. The effect of the PDP-11 architecture on code generation for chill