3228 search results - page 413 / 646 » Computationally Sound Proofs |
122
Voted
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
134
Voted
JCC
2007
15 years 3 months ago
2007
Abstract: Starting from the 1980s and onwards, Valence Bond theory has been enjoying renaissance that is characterized by the development of a growing number of ab initio methods, ...
124
Voted
IGPL
1998
15 years 3 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
128
Voted
COLING
2010
14 years 10 months ago
2010
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
138
Voted
CAV
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computati...