Sciweavers

500 search results - page 50 / 100
» Thread-Modular Abstraction Refinement
Sort
View
BIRTHDAY
2010
Springer
14 years 11 months ago
Counterexample Guided Path Reduction for Static Program Analysis
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
Ansgar Fehnker, Ralf Huuck, Sean Seefried
AGENTS
1999
Springer
15 years 2 months ago
Top-Down Search for Coordinating the Hierarchical Plans of Multiple Agents
Uncertain and complex environments demand that an agent be able to anticipate the actions of others in order to avoid resource conflicts with them and to realize its goals. Confli...
Bradley J. Clement, Edmund H. Durfee
PPDP
2000
Springer
15 years 1 months ago
Enhanced sharing analysis techniques: a comprehensive evaluation
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
AIPS
1998
14 years 11 months ago
Search Control of Plan Generation in Decision-Theoretic Planners
This paper addresses the search control problemof selecting whichplan to refine next for decision-theoretic planners, a choice point commonto the decision theoretic planners creat...
Richard Goodwin, Reid G. Simmons
JAR
2006
103views more  JAR 2006»
14 years 9 months ago
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
Panagiotis Manolios, Sudarshan K. Srinivasan