Sciweavers

6554 search results - page 904 / 1311
» Constraint Logic Programming
Sort
View
199
Voted
ICFP
2003
ACM
16 years 6 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
16 years 1 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
ACSAC
2007
IEEE
16 years 1 months ago
Automated Vulnerability Analysis: Leveraging Control Flow for Evolutionary Input Crafting
We present an extension of traditional "black box" fuzz testing using a genetic algorithm based upon a Dynamic Markov Model fitness heuristic. This heuristic allows us t...
Sherri Sparks, Shawn Embleton, Ryan Cunningham, Cl...
WCRE
2007
IEEE
16 years 1 months ago
Parametric Process Model Inference
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...
Saurabh Sinha, G. Ramalingam, Raghavan Komondoor
CCS
2005
ACM
16 years 9 days ago
Formal security analysis of basic network-attached storage
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
Avik Chaudhuri, Martín Abadi