Sciweavers

1689 search results - page 64 / 338
» Refining abstract interpretations
Sort
View
ASPDAC
2007
ACM
139views Hardware» more  ASPDAC 2007»
15 years 8 months ago
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
ICML
2002
IEEE
16 years 5 months ago
Action Refinement in Reinforcement Learning by Probability Smoothing
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
Carles Sierra, Dídac Busquets, Ramon L&oacu...
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
15 years 8 months ago
A synchronization algorithm for local temporal refinements in perfectly synchronous models with nested feedback loops
he abstract and simple computation and communication mechanism in the synchronous computational model it is easy to simulate synchronous systems and to apply formal verification m...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
POPL
2004
ACM
16 years 4 months ago
Abstractions from proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
RULEML
2009
Springer
15 years 10 months ago
Generation of Rules from Ontologies for High-Level Scene Interpretation
Abstract. In this paper, a novel architecture for high-level scene interpretation is introduced, which is based on the generation of rules from an OWL-DL ontology. It is shown that...
Wilfried Bohlken, Bernd Neumann