Sciweavers

501 search results - page 89 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
PPOPP
2009
ACM
14 years 2 months ago
NePalTM: design and implementation of nested parallelism for transactional memory systems
Abstract. Transactional memory (TM) promises to simplify construction of parallel applications by allowing programmers to reason about interactions between concurrently executing c...
Haris Volos, Adam Welc, Ali-Reza Adl-Tabatabai, Ta...
CCS
2009
ACM
14 years 2 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
ECCV
2004
Springer
14 years 9 months ago
Example-Based Stereo with General BRDFs
Abstract. This paper presents an algorithm for voxel-based reconstruction of objects with general reflectance properties from multiple calibrated views. It is assumed that one or m...
Adrien Treuille, Aaron Hertzmann, Steven M. Seitz
IPMI
2005
Springer
14 years 8 months ago
Surface Matching via Currents
Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in buildin...
Marc Vaillant, Joan Glaunes
PPDP
2004
Springer
14 years 23 days ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey