Sciweavers

434 search results - page 67 / 87
» Monadic Bounded Algebras
Sort
View
STACS
2007
Springer
14 years 4 months ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 3 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
ANTS
2004
Springer
103views Algorithms» more  ANTS 2004»
14 years 1 months ago
A Comparison of CEILIDH and XTR
We give a comparison of the performance of the recently proposed torus-based public key cryptosystem CEILIDH, and XTR. Underpinning both systems is the mathematics of the two dimen...
Robert Granger, Dan Page, Martijn Stam
IJAR
2008
143views more  IJAR 2008»
13 years 10 months ago
A characterization of interval-valued residuated lattices
As is well-known, residuated lattices (RLs) on the unit interval correspond to leftcontinuous t-norms. Thus far, a similar characterization has not been found for RLs on the set o...
Bart Van Gasse, Chris Cornelis, Glad Deschrijver, ...
ENTCS
2007
98views more  ENTCS 2007»
13 years 9 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow