73 search results - page 7 / 15 » On the Automatizability of Polynomial Calculus |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
MOC
2000
13 years 7 months ago
2000
Abstract. We propose a discretization scheme for a numerical solution of elliptic PDE's, based on local representation of functions, by their Taylor polynomials (jets). This s...
TGC
2007
Springer
14 years 1 months ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
CAV
2003
Springer
14 years 23 days ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...