3228 search results - page 376 / 646 » Computationally Sound Proofs |
122
Voted
ECCC
2006
15 years 4 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
147
click to vote
JUCS
2006
15 years 3 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
128
click to vote
LOGCOM
2006
15 years 3 months ago
2006
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision p...
107
Voted
FAC
2000
15 years 3 months ago
2000
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
135
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...