3573 search results - page 576 / 715 » Reasoning about Codata |
216
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
215
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
198
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
238
click to vote
POPL
2001
ACM
16 years 1 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
102
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...