Sciweavers

509 search results - page 5 / 102
» On the completeness of compositional reasoning methods
Sort
View
CAV
2010
Springer
168views Hardware» more  CAV 2010»
13 years 5 months ago
A Dash of Fairness for Compositional Reasoning
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
Ariel Cohen 0002, Kedar S. Namjoshi, Yaniv Sa'ar
ISOLA
2010
Springer
13 years 5 months ago
Modeling and Reasoning about Service Behaviors and Their Compositions
Abstract. Service-oriented systems have recently emerged as context-independent component-based systems. Unlike components, services can be created, invoked, composed, and destroye...
Aida Causevic, Cristina Cerschi Seceleanu, Paul Pe...
VMCAI
2010
Springer
14 years 4 months ago
Considerate Reasoning and the Composite Design Pattern
We propose Considerate Reasoning, a novel specification and verification technique based on object invariants. This technique supports succinct specifications of implementations wh...
Alexander J. Summers, Sophia Drossopoulou
SAT
2005
Springer
107views Hardware» more  SAT 2005»
14 years 1 months ago
Local and Global Complete Solution Learning Methods for QBF
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
Ian P. Gent, Andrew G. D. Rowley
LPAR
2005
Springer
14 years 1 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang