4340 search results - page 368 / 868 » Formal Methods and Cryptography |
147
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
170
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
Performing synthesis and verification in isolation has two undesirable consequences: (1) verification runs the risk of becoming intractable, and (2) strong sequential optimization...
176
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...
187
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
Abstract--This paper presents the verification of an asynchronous arbiter modeled at the circuit level with non-linear ordinary differential equations. We use Brockett's annul...
181
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
Automatic techniques for software verification focus on obtaining witnesses of program failure. Such counterexamples often fail to localize the precise cause of an error and usuall...