193 search results - page 16 / 39 » Decidable logics combining heap structures and data |
126
Voted
VMCAI
2010
Springer
15 years 12 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
135
Voted
PAMI
1998
15 years 2 months ago
1998
This paper describes a framework for the estimation of shape from sparse or incomplete range data. It uses a shape representation called blending, which allows for the geometric c...
114
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
113
Voted
ICLP
1992
Springer
15 years 6 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
104
Voted
KBSE
2008
IEEE
15 years 9 months ago
2008
IEEE
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...