Sciweavers

661 search results - page 68 / 133
» What Can We Expect from Program Verification
Sort
View
FOCS
2008
IEEE
13 years 9 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
ASPLOS
2006
ACM
14 years 2 months ago
A: an assertion language for distributed systems
Operator mistakes have been identified as a significant source of unavailability in Internet services. In this paper, we propose a new language, A , for service engineers to writ...
Andrew Tjang, Fábio Oliveira, Richard P. Ma...
PEPM
2009
ACM
14 years 5 months ago
Bidirectional data-flow analyses, type-systematically
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...
Maria João Frade, Ando Saabas, Tarmo Uustal...
ESOP
2001
Springer
14 years 1 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
NDQA
2003
119views Education» more  NDQA 2003»
13 years 10 months ago
Inference Web: Portable and Sharable Explanations for Question Answering
The World Wide Web lacks support for explaining information provenance. When web applications return results, many users do not know what information sources were used, when they ...
Deborah L. McGuinness, Paulo Pinheiro da Silva