Sciweavers

5084 search results - page 40 / 1017
» Proving Possibility Properties
Sort
View
CORR
2000
Springer
71views Education» more  CORR 2000»
13 years 9 months ago
Smoothness and decay properties of the limiting Quicksort density function
Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere ...
James Allen Fill, Svante Janson
FOSSACS
2006
Springer
14 years 1 months ago
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...
CP
1998
Springer
14 years 2 months ago
A Framework for Assertion-Based Debugging in Constraint Logic Programming
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
Germán Puebla, Francisco Bueno, Manuel V. H...
ECAI
1990
Springer
14 years 1 months ago
Probabilistic Belief Logics
Modal logics based on Kripke style semantics are the prominent formalismin AI for modeling beliefs. Kripke semantics involve a collection of possible worlds and a relation among t...
Fahiem Bacchus
CL
2007
Springer
13 years 10 months ago
Skeleton-based parallel programming: Functional and parallel semantics in a single shot
Semanticsofskeleton-basedparallelprogramminglanguagescomesusuallyastwodistinctitems:afunctionalsemantics,modeling the function computed by the skeleton program, and a parallel sem...
Marco Aldinucci, Marco Danelutto