1174 search results - page 49 / 235 » A Logical Approach to Abstract Algebra |
CSR
2008
Springer
13 years 11 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
JAR
1998
13 years 9 months ago
1998
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
ENTCS
2002
13 years 9 months ago
2002
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
ESOP
2004
Springer
14 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
ACL2
2006
ACM
14 years 3 months ago
2006
ACM
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...