155
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
194
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
127
click to vote
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision...
152
click to vote
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...