4257 search results - page 706 / 852 » The Logical Modularity of Programs |
151
click to vote
MST
2007
15 years 5 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
140
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
164
click to vote
ICTAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
289
Voted
POPL
2005
ACM
16 years 6 months ago
2005
ACM
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
163
click to vote
LACL
2001
Springer
15 years 10 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...