1717 search results - page 150 / 344 » A Computable Spectral Theorem |
145
click to vote
ASIAN
2006
Springer
15 years 8 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
133
click to vote
ESOP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
122
click to vote
IJAC
2006
15 years 4 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
167
click to vote
JAR
2008
15 years 4 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
172
click to vote
JAIR
2007
15 years 4 months ago
2007
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...