Sciweavers

231 search results - page 19 / 47
» Improvements to combinational equivalence checking
Sort
View
ASPLOS
2000
ACM
14 years 12 days ago
Slipstream Processors: Improving both Performance and Fault Tolerance
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effec...
Karthik Sundaramoorthy, Zachary Purser, Eric Roten...
ICIP
2006
IEEE
14 years 9 months ago
Improving H.264/AVC Inter Compression with Multiscale Recurrent Patterns
In this paper we describe the ongoing work on a new paradigm for compressing the motion predicted error in a video coder, referred to as MMP-Video. This new coding algorithm uses ...
Eduardo A. B. da Silva, Murilo B. de Carvalho, Nun...
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
14 years 8 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
FM
2006
Springer
161views Formal Methods» more  FM 2006»
13 years 11 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 5 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz