Sciweavers

923 search results - page 184 / 185
» Proving the value of formal methods
Sort
View
HM
2007
Springer
137views Optimization» more  HM 2007»
15 years 3 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
115
Voted
WPES
2006
ACM
15 years 3 months ago
Measuring relationship anonymity in mix networks
Many applications of mix networks such as anonymous Web browsing require relationship anonymity: it should be hard for the attacker to determine who is communicating with whom. Co...
Vitaly Shmatikov, Ming-Hsiu Wang
AFP
2004
Springer
105views Formal Methods» more  AFP 2004»
15 years 2 months ago
Epigram: Practical Programming with Dependent Types
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
Conor McBride
AFP
2004
Springer
15 years 2 months ago
A Functional Shell That Operates on Typed and Compiled Applications
Abstract. Esther is the interactive shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, ...
Rinus Plasmeijer, Arjen van Weelden
GECCO
2010
Springer
172views Optimization» more  GECCO 2010»
15 years 2 months ago
Designing better fitness functions for automated program repair
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
Ethan Fast, Claire Le Goues, Stephanie Forrest, We...