Sciweavers

2000 search results - page 113 / 400
» Program Transformation and Proof Transformation
Sort
View
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 3 months ago
Variable elimination for building interpreters
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (t...
Julien Cohen, Jean-Louis Giavitto, Olivier Michel
ECCC
2007
77views more  ECCC 2007»
15 years 3 months ago
Selected Results in Additive Combinatorics: An Exposition
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...
Emanuele Viola
MICS
2008
108views more  MICS 2008»
15 years 3 months ago
Efficient Intensional Implementation for Lazy Functional Languages
The intensional transformation is a technique that can be used in order to eliminate higher-order functions from a functional program by introducing appropriate context manipulatio...
Angelos Charalambidis, Athanasios Grivas, Nikolaos...
128
Voted
CCS
2010
ACM
15 years 2 months ago
TAPS: automatically preparing safe SQL queries
We present the first sound program transformation approach for automatically transforming the code of a legacy web application to employ PREPARE statements in place of unsafe SQL...
Prithvi Bisht, A. Prasad Sistla, V. N. Venkatakris...
IFSA
2007
Springer
147views Fuzzy Logic» more  IFSA 2007»
15 years 9 months ago
On Proofs and Rule of Multiplication in Fuzzy Attribute Logic
Abstract. The paper develops fuzzy attribute logic, i.e. a logic for reasoning about formulas of the form A ⇒ B where A and B are fuzzy sets of attributes. A formula A ⇒ B repr...
Radim Belohlávek, Vilém Vychodil