Sciweavers

4745 search results - page 197 / 949
» Discretization: An Enabling Technique
Sort
View
ESOP
2007
Springer
16 years 20 days ago
Using History Invariants to Verify Observers
Abstract. This paper contributes a technique that expands the set of object invariants that one can reason about in modular verification. The technique uses history invariants, tw...
K. Rustan M. Leino, Wolfram Schulte
GMP
2006
IEEE
113views Solid Modeling» more  GMP 2006»
16 years 17 days ago
Matrix Based Subdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches
Abstract. A new subdivision depth computation technique for extraordinary Catmull-Clark subdivision surface (CCSS) patches is presented. The new technique improves a previous techn...
Gang Chen, Fuhua (Frank) Cheng
VMCAI
2005
Springer
15 years 12 months ago
Termination of Polynomial Programs
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
APLAS
2008
ACM
15 years 8 months ago
Reasoning about Java's Reentrant Locks
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....
Christian Haack, Marieke Huisman, Clément H...
NIPS
2004
15 years 7 months ago
On-Chip Compensation of Device-Mismatch Effects in Analog VLSI Neural Networks
Device mismatch in VLSI degrades the accuracy of analog arithmetic circuits and lowers the learning performance of large-scale neural networks implemented in this technology. We s...
Miguel Figueroa, Seth Bridges, Chris Diorio