2488 search results - page 233 / 498 » An improvement in formal verification |
PDP
2007
IEEE
15 years 7 months ago
2007
IEEE
Scientific and engineering programming has been around since the beginning of computing, often being the driving force for new system development and innovation. At the same time...
109
click to vote
ASPDAC
2005
ACM
15 years 7 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
106
click to vote
CAV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
119
click to vote
VLSID
2001
IEEE
16 years 1 months ago
2001
IEEE
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
231
click to vote
POPL
2005
ACM
16 years 1 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...