537 search results - page 37 / 108 » Compiling Exceptions Correctly |
AMAST
2008
Springer
13 years 11 months ago
2008
Springer
Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generi...
AAAI
1993
13 years 10 months ago
1993
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
PEPM
2011
ACM
12 years 11 months ago
2011
ACM
Passing multiple continuation arguments to a function in CPS form allows one to encode a wide variety of direct-style control constructs, such as conditionals, exceptions, and mul...
NDSS
2009
IEEE
14 years 3 months ago
2009
IEEE
We introduce a new paradigm for outsourcing the durability property of a multi-client transactional database to an untrusted service provider. Specifically, we enable untrusted s...
LOPSTR
1994
Springer
14 years 1 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...