3738 search results - page 86 / 748 » Parametrized Logic Programming |
130
click to vote
FOCS
1992
IEEE
15 years 7 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
135
Voted
TOOLS
2009
IEEE
15 years 10 months ago
2009
IEEE
Single inheritance often forces developers to duplicate code and logic. This widely recognized situation affects both business code and tests. In a large and complex application w...
129
Voted
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
166
Voted
LANMR
2004
15 years 5 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
119
Voted
TLDI
2003
ACM
15 years 8 months ago
2003
ACM
We develop a logic for reasoning about adjacency and separation of memory blocks, as well as aliasing of pointers. We provide a memory model for our logic and present a sound set ...