Sciweavers

98 search results - page 5 / 20
» A semantics for procedure local heaps and its abstractions
Sort
View
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
AGP
2003
IEEE
14 years 1 months ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...
ICTAC
2010
Springer
13 years 5 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
ECCV
2002
Springer
14 years 9 months ago
Multimodal Data Representations with Parameterized Local Structures
Abstract. In many vision problems, the observed data lies in a nonlinear manifold in a high-dimensional space. This paper presents a generic modelling scheme to characterize the no...
Ying Zhu, Dorin Comaniciu, Stuart C. Schwartz, Vis...
POPL
2006
ACM
14 years 8 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan