300 search results - page 59 / 60 » Using probabilistic reasoning to automate software tuning |
POPL
2005
ACM
14 years 8 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
VMCAI
2007
Springer
14 years 2 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
JACM
2002
13 years 8 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
AVI
2010
13 years 10 months ago
2010
Advanced visual interfaces, like the ones found in informaualization, intend to offer a view on abstract data spaces to enable users to make sense of them. By mapping data to visu...
PLDI
2009
ACM
14 years 9 months ago
2009
ACM
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...