4340 search results - page 471 / 868 » Formal Methods and Cryptography |
183
click to vote
SAS
2004
Springer
16 years 3 days ago
2004
Springer
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
156
click to vote
TYPES
2004
Springer
16 years 3 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...
189
click to vote
SAC
2003
ACM
16 years 19 hour 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 ...
171
click to vote
SIGSOFT
2003
ACM
16 years 17 hour 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...
152
click to vote
TLDI
2003
ACM
16 years 16 hour 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...