92 search results - page 4 / 19 » Structuring Optimizing Transformations and Proving Them Soun... |
ICCAD
2001
IEEE
14 years 3 months ago
2001
IEEE
This paper attempts to determine the capabilities of existing Redundancy Addition and Removal (SRAR) techniques for logic optimization of sequential circuits. To this purpose, we ...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
PROVSEC
2007
Springer
14 years 8 days ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
IFM
2000
Springer
13 years 9 months ago
2000
Springer
State-based refinement relations have been developed for use on the Object-Z components in an integrated Object-Z / CSP specification. However this refinement methodology does not ...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...