Sciweavers

9626 search results - page 130 / 1926
» Invariant Based Programming
Sort
View
POPL
2004
ACM
16 years 5 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
TACAS
2010
Springer
142views Algorithms» more  TACAS 2010»
15 years 12 months ago
Tracking Heaps That Hop with Heap-Hop
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
Jules Villard, Étienne Lozes, Cristiano Cal...
157
Voted
IJFCS
2007
98views more  IJFCS 2007»
15 years 4 months ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
ECCV
2004
Springer
16 years 6 months ago
Face Recognition from Facial Surface Metric
Recently, a 3D face recognition approach based on geometric invariant signatures, has been proposed. The key idea is a representation of the facial surface, invariant to isometric ...
Alexander M. Bronstein, Michael M. Bronstein, Alon...
GIS
2005
ACM
16 years 6 months ago
Dimension-refined topological predicates
Topological predicates, as derived from the 9-intersection model, have been widely recognized in GIS, spatial database systems, and many other geo-related disciplines. They are ba...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...