Sciweavers

8413 search results - page 70 / 1683
» Ordering Problem Subgoals
Sort
View
APSEC
2005
IEEE
14 years 1 months ago
Call-Ordering Constraints
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
Nam Tran, David Abramson, Christine Mingins
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
First-Order Query Rewriting for Inconsistent Databases
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
Ariel Fuxman, Renée J. Miller
ASM
2010
ASM
14 years 1 months ago
Formal Probabilistic Analysis: A Higher-Order Logic Based Approach
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
Osman Hasan, Sofiène Tahar
CSL
1999
Springer
14 years 9 days ago
Anti-Symmetry of Higher-Order Subtyping
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, Fω ≤, is anti-symmetric, establishing in the process that the subtyping relation...
Adriana B. Compagnoni, Healfdene Goguen
CADE
2006
Springer
13 years 11 months ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki