2905 search results - page 251 / 581 » Formal Memetic Algorithms |
126
click to vote
LOPSTR
2004
Springer
15 years 10 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
149
click to vote
SACRYPT
2004
Springer
15 years 10 months ago
2004
Springer
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
134
click to vote
TACAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
129
Voted
TPHOL
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
155
click to vote
CSL
2003
Springer
15 years 10 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...