525 search results - page 65 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
PEPM
2009
ACM
14 years 4 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
EACL
2003
ACL Anthology
13 years 9 months ago
2003
ACL Anthology
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
JASIS
2000
13 years 7 months ago
2000
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
AMAST
2004
Springer
14 years 1 months ago
2004
Springer
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...