5255 search results - page 632 / 1051 » Formal Methods for Privacy |
160
click to vote
TYPES
2004
Springer
16 years 8 days ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
198
click to vote
SAC
2003
ACM
16 years 6 days ago
2003
ACM
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are ...
177
click to vote
SIGSOFT
2003
ACM
16 years 6 days ago
2003
ACM
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
159
click to vote
TLDI
2003
ACM
16 years 6 days ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
168
click to vote
TLDI
2003
ACM
16 years 6 days ago
2003
ACM
An important consideration for certified code systems is the interaction of the untrusted program with the runtime system, most notably the garbage collector. Most certified cod...