Sciweavers

814 search results - page 35 / 163
» Analysis of Modular Arithmetic
Sort
View
ISDA
2006
IEEE
15 years 4 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
CADE
2008
Springer
15 years 10 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
Hasan Amjad, Richard Bornat
ICLP
2005
Springer
15 years 3 months ago
Abduction of Linear Arithmetic Constraints
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
Michael J. Maher
ISIPTA
2005
IEEE
146views Mathematics» more  ISIPTA 2005»
15 years 3 months ago
Arithmetic on Random Variables: Squeezing the Envelopes with New Joint Distribution Constraints
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....
Jianzhong Zhang 0004, Daniel Berleant
CADE
2010
Springer
14 years 11 months ago
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
Angelo Brillout, Daniel Kroening, Philipp Rüm...