This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
In the setting of program algebra (PGA), a projection from PGAu, i.e., PGA extended with a unit instruction operator, into PGA is defined. This is done via a composition that empl...
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...