1026 search results - page 4 / 206 » A Methodology for Equational Reasoning |
KR
1992
Springer
13 years 11 months ago
1992
Springer
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
CEFP
2009
Springer
13 years 4 months ago
2009
Springer
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
CSL
2012
Springer
12 years 2 months ago
2012
Springer
FUIN
2010
13 years 4 months ago
2010
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...
IJCAI
1997
13 years 8 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...