895 search results - page 38 / 179 » A Spectrum of Applications of Automated Reasoning |
137
click to vote
ECSQARU
2003
Springer
15 years 10 months ago
2003
Springer
We introduce a set of transformations on the set of all probability distributions over a finite state space, and show that these transformations are the only ones that preserve c...
147
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
133
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
140
click to vote
SARA
2009
Springer
15 years 11 months ago
2009
Springer
: Given a system design (SD), a key task is to optimize this design to reduce the probability of catastrophic failures. We consider the task of redesigning an SD to minimize the pr...
267
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...