Sciweavers

5707 search results - page 284 / 1142
» Symbolic Simulation - Techniques and Applications
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 7 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
LPAR
2005
Springer
16 years 7 days ago
Functional Correctness Proofs of Encryption Algorithms
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an imple...
Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, K...
SAS
2005
Springer
162views Formal Methods» more  SAS 2005»
16 years 7 days ago
Boolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
Andreas Podelski, Thomas Wies
CSL
2004
Springer
16 years 4 days ago
Unsound Theorem Proving
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
Christopher Lynch
FOSSACS
2004
Springer
16 years 4 days ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas