Sciweavers

923 search results - page 17 / 185
» Proving the value of formal methods
Sort
View
AMC
2007
156views more  AMC 2007»
14 years 12 months ago
Derivation of the Adomian decomposition method using the homotopy analysis method
Adomian decomposition method has been used intensively to solve nonlinear boundary and initial value problems. It has been proved to be very efficient in generating series solutio...
Fathi M. Allan
MEMOCODE
2003
IEEE
15 years 5 months ago
Methods for exploiting SAT solvers in unbounded model checking
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
Kenneth L. McMillan
EUROCRYPT
1999
Springer
15 years 4 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
SAS
2007
Springer
15 years 5 months ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
IAT
2008
IEEE
15 years 6 months ago
Understanding Social Networks Using Formal Concept Analysis
Social networks are very popular nowadays and the understanding of their inner structure seems to be promising area. Several approaches for the social network structure visualizat...
Václav Snásel, Zdenek Horak, Ajith A...