Sciweavers

20 search results - page 3 / 4
» Specifying Imperative Data Obfuscations
Sort
View
PVLDB
2008
182views more  PVLDB 2008»
13 years 7 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
DBPL
1989
Springer
165views Database» more  DBPL 1989»
13 years 11 months ago
Support for Data-Intensive Applications: Conceptual Design and Software Development
In the process of developing an Information System, one passes through stages that include requirements gathering, design specification, and software implementation. The purpose ...
Alexander Borgida, John Mylopoulos, Joachim W. Sch...

Book
301views
15 years 5 months ago
Programming in Standard ML
"Standard ML is a type-safe programming language that embodies many innovative ideas in programming language design. It is a statically typed language, with an extensible type...
Robert Harper
PPDP
2007
Springer
14 years 1 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty
ACTA
2010
191views more  ACTA 2010»
13 years 7 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar