500 search results - page 29 / 100 » Thread-Modular Abstraction Refinement |
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
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...
ICML
2002
IEEE
15 years 10 months ago
2002
IEEE
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 ...
108
click to vote
GLVLSI
2007
IEEE
15 years 1 months ago
2007
IEEE
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...
189
Voted
POPL
2004
ACM
15 years 10 months ago
2004
ACM
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 ...
127
click to vote
FMCO
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Atomicity Decomposition is a technique in the Event-B formal method, which augments Event-B refinement with additional structuring in a diagrammatic notation to support c...