2873 search results - page 18 / 575 » Model Checking and the Mu-calculus |
337
click to vote
DAC
2012
ACM
13 years 4 months ago
2012
ACM
Loop pipelining is a critical transformation in behavioral synthesis. It is crucial to producing hardware designs with acceptable latency and throughput. However, it is a complex ...
132
click to vote
BCS
2008
15 years 3 months ago
2008
Parity games underlie the model checking problem for the modal
125
click to vote
ICASSP
2010
IEEE
14 years 8 months ago
2010
IEEE
An operational framework is developed for testing stationarity relatively to an observation scale. The proposed method makes use of a family of stationary surrogates for defining ...
112
click to vote
CAV
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
105
Voted
ENTCS
2006
15 years 1 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...