• Corpus ID: 17112517

Under consideration for publication in Formal Aspects of Computing Towards a Linear Algebra of Programming

  title={Under consideration for publication in Formal Aspects of Computing Towards a Linear Algebra of Programming},
  author={J. Oliveira},
The Algebra of Programming (AoP) is a discipline for programming from specifications using relation algebra. Specification vagueness and nondeterminism are captured by relations. (Final) implementations are functions. Probabilistic functions are half way between relations and functions: they express the propensity, or likelihood of ambiguous, multiple outputs. This paper puts forward a basis for a Linear Algebra of Programming (LAoP) extending standard AoP towards probabilistic functions… 


Linear algebra techniques for deciding the correctness of probabilistic programs with bounded resources ∗
An algorithm is outlined for deciding the correctness of (space and time) resource bounded, imperative, probabilistic programs, using linear algebra techniques encoded in the theory of real closed
Towards Linear Algebras of Components
At the core of Parnas objections the authors find the contrast between the current ad-hoc (re)invention of mathematical concepts which are cumbersome and a burden to use and elegant concept which are neglected, often for cultural or (lack of) background reasons.
Fork Algebras in Algebra, Logic and Computer Science
This paper study fork algebras from the points of view of their algebraic and logical properties and applications, which will prove to be essential for the definition of a wide-spectrum calculus for program construction.
Just do it: simple monadic equational reasoning
A simple axiomatic approach to reasoning about programs with computational effects is presented, suggesting that the impure imperative part of functional programming has not become inaccessible to equational reasoning.
Functional Pearls: Probabilistic functional programming in Haskell
Functional programming's principle of referential transparency is violated when contemplating the use of functions to describe probabilistic events, such as rolling a die, but these two seemingly incompatible notions can be reconciled if Probabilistic values are encapsulated in a data type.
Using Probabilistic Kleene Algebra for Protocol Verification
We describe pKA, a probabilistic Kleene-style algebra, based on a well known model of probabilistic/demonic computation [3,16,10]. Our technical aim is to express probabilistic versions of Cohen's
Abstraction, Refinement and Proof for Probabilistic Systems
Probabilistic guarded commands and their refinement logic.- to pGCL: Its logic and its model.- Probabilistic loops: Invariants and variants.- Case studies in termination: Choice coordination, the
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our
The origin of relation algebras in the development and axiomatization of the calculus of relations
  • R. Maddux
  • Mathematics, Computer Science
    Stud Logica
  • 1991
The calculus of relations and the theory of relation algebras are introduced and shown to be incomplete by Roger Lyndon's discovery of nonrepresentable relation alagbras.
Do the middle letters of \OLAP" stand for Linear Algebra (\LA")?
Inspired by pointfree relational data processing, this paper addresses the foundations of an alternative roadmap for parallel online analytical processing (OLAP) based on a separation of concerns: