Sciweavers

2308 search results - page 202 / 462
» Representing Symbolic Reasoning
Sort
View
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 10 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
CSFW
2010
IEEE
15 years 10 months ago
Modeling and Verifying Ad Hoc Routing Protocols
Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
CHARME
2005
Springer
145views Hardware» more  CHARME 2005»
15 years 8 months ago
Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies
Abstract. Automatic formal verification techniques generally require exponential resources with respect to the number of primary inputs of a netlist. In this paper, we present sev...
Jason Baumgartner, Hari Mony
STAIRS
2008
169views Education» more  STAIRS 2008»
15 years 8 months ago
Probabilistic Association Rules for Item-Based Recommender Systems
Since the beginning of the 1990's, the Internet has constantly grown, proposing more and more services and sources of information. The challenge is no longer to provide users ...
Sylvain Castagnos, Armelle Brun, Anne Boyer
AIPS
2006
15 years 8 months ago
Safe LTL Assumption-Based Planning
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
Alexandre Albore, Piergiorgio Bertoli