Sciweavers

1129 search results - page 10 / 226
» Modular Ranking Abstraction
Sort
View
25
Voted
CASSIS
2005
Springer
14 years 1 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Interference Alignment as a Rank Constrained Rank Minimization
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
KBSE
1999
IEEE
13 years 11 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
ICRA
2009
IEEE
109views Robotics» more  ICRA 2009»
14 years 2 months ago
Self-adapting modular robotics: A generalized distributed consensus framework
Abstract— Biological systems achieve amazing adaptive behavior with local agents performing simple sensing and actions. Modular robots with similar properties can potentially ach...
Chih-Han Yu, Radhika Nagpal
CHES
2003
Springer
119views Cryptology» more  CHES 2003»
14 years 23 days ago
Faster Double-Size Modular Multiplication from Euclidean Multipliers
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
Benoît Chevallier-Mames, Marc Joye, Pascal P...