Sciweavers

4290 search results - page 784 / 858
» Formal Approaches to Teamwork
Sort
View
POPL
2008
ACM
16 years 6 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
CADE
2007
Springer
16 years 6 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
CADE
2005
Springer
16 years 6 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
OSDI
2006
ACM
16 years 6 months ago
EXPLODE: A Lightweight, General System for Finding Serious Storage System Errors
Storage systems such as file systems, databases, and RAID systems have a simple, basic contract: you give them data, they do not lose or corrupt it. Often they store the only copy...
Junfeng Yang, Can Sar, Dawson R. Engler
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 6 months ago
QoX-driven ETL design: reducing the cost of ETL consulting engagements
As business intelligence becomes increasingly essential for organizations and as it evolves from strategic to operational, the complexity of Extract-Transform-Load (ETL) processes...
Alkis Simitsis, Kevin Wilkinson, Malú Caste...