Sciweavers

276 search results - page 13 / 56
» Abstraction and Refinement for Local Reasoning
Sort
View
ECSQARU
2007
Springer
14 years 1 months ago
Local Monotonicity in Probabilistic Networks
version of this extended abstract appeared in the proceedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-07), H...
Johan Kwisthout, Hans L. Bodlaender, Gerard Tel
ALGORITHMICA
2006
63views more  ALGORITHMICA 2006»
13 years 7 months ago
A Local Limit Theorem in the Theory of Overpartitions
Abstract. An overpartition of an integer n is a partition where the last occurrence of a part can be overlined. We study the weight of the overlined parts of an overpartition count...
Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
FLOPS
2004
Springer
13 years 11 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar
KBSE
1999
IEEE
13 years 12 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
CSL
2007
Springer
14 years 1 months ago
Qualitative Temporal and Spatial Reasoning Revisited
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...
Manuel Bodirsky, Hubie Chen