Sciweavers

1882 search results - page 131 / 377
» Transformational Programming and Forests
Sort
View
AMAST
1998
Springer
15 years 2 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
POPL
2010
ACM
15 years 7 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
ICDCS
2002
IEEE
15 years 2 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
FM
2008
Springer
75views Formal Methods» more  FM 2008»
14 years 11 months ago
Masking Faults While Providing Bounded-Time Phased Recovery
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
SIGMOD
2006
ACM
94views Database» more  SIGMOD 2006»
15 years 10 months ago
Programming for XML
In this paper we propose a type-based framework for using logic programming for XML processing. We transform XML documents into terms and DTDs into regular types. We implemented a ...
Daniela Florescu, Donald Kossmann