27 search results - page 1 / 6 » Goto elimination in program algebra |
SCP
2008
13 years 4 months ago
2008
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...
JLP
2002
13 years 4 months ago
2002
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...
AISC
2010
Springer
13 years 8 months ago
2010
Springer
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 ...
DAGSTUHL
2007
13 years 6 months ago
2007
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...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
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...