Sciweavers

116 search results - page 11 / 24
» Automatic Abstraction for Intervals Using Boolean Formulae
Sort
View
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
15 years 1 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
86
Voted
IJFCS
2007
98views more  IJFCS 2007»
14 years 9 months ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
15 years 4 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
ESOP
2009
Springer
15 years 4 months ago
An Interval-Based Inference of Variant Parametric Types
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
Florin Craciun, Wei-Ngan Chin, Guanhua He, Shengch...
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
15 years 1 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong