2540 search results - page 128 / 508 » Abstract Logics as Dialgebras |
222
click to vote
MKM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
161
click to vote
EPIA
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
213
click to vote
ACL2
2006
ACM
16 years 14 days 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...
135
click to vote
ASPDAC
2006
ACM
16 years 14 days ago
2006
ACM
Abstract— The memory subsystem is known to comprise a significant fraction of the power dissipation in embedded systems. The memory addressing strategy, which determines the seq...
158
click to vote
ICLP
2005
Springer
16 years 6 hour ago
2005
Springer
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...