Sciweavers

1205 search results - page 102 / 241
» Program Extraction from Large Proof Developments
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 7 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
SIGSOFT
2008
ACM
16 years 2 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
ACSAC
2004
IEEE
15 years 5 months ago
RACOON: Rapidly Generating User Command Data For Anomaly Detection From Customizable Templates
One of the biggest obstacles faced by user command based anomaly detection techniques is the paucity of data. Gathering command data is a slow process often spanning months or yea...
Ramkumar Chinchani, Aarthie Muthukrishnan, Madhusu...
BMCBI
2006
165views more  BMCBI 2006»
15 years 1 months ago
Improving the quality of protein structure models by selecting from alignment alternatives
Background: In the area of protein structure prediction, recently a lot of effort has gone into the development of Model Quality Assessment Programs (MQAPs). MQAPs distinguish hig...
Ingolf Sommer, Stefano Toppo, Oliver Sander, Thoma...
SIGSOFT
2007
ACM
16 years 2 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip