Sciweavers

4850 search results - page 207 / 970
» Proof and Computation in Geometry
Sort
View
JSC
2011
110views more  JSC 2011»
15 years 1 months ago
Computing symmetric rank for symmetric tensors
We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for...
Alessandra Bernardi, Alessandro Gimigliano, Monica...
FOSSACS
2004
Springer
15 years 12 months ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
FAC
2010
93views more  FAC 2010»
15 years 3 months ago
Inter-process buffers in separation logic with rely-guarantee
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
Richard Bornat, Hasan Amjad
SLP
1993
110views more  SLP 1993»
15 years 7 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
ACTA
2011
15 years 1 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink