9626 search results - page 363 / 1926 » Invariant Based Programming |
163
click to vote
CADE
1999
Springer
15 years 11 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
157
click to vote
CISST
2004
15 years 8 months ago
2004
: We use a tensor product based multi-linear algebra theory to formulate three-dimensional Hilbert space-filling curves. A 3-D Hilbert space-filling curve is specified as a permuta...
175
click to vote
NETWORKS
2006
15 years 6 months ago
2006
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
209
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
225
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...