Sciweavers

387 search results - page 70 / 78
» Expressive programs through presentation extension
Sort
View
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
14 years 1 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
BMCBI
2008
126views more  BMCBI 2008»
13 years 7 months ago
NITPICK: peak identification for mass spectrometry data
Background: The reliable extraction of features from mass spectra is a fundamental step in the automated analysis of proteomic mass spectrometry (MS) experiments. Results: This co...
Bernhard Y. Renard, Marc Kirchner, Hanno Steen, Ju...
CCS
2006
ACM
13 years 11 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
SIGSOFT
2009
ACM
14 years 8 months ago
DebugAdvisor: a recommender system for debugging
In large software development projects, when a programmer is assigned a bug to fix, she typically spends a lot of time searching (in an ad-hoc manner) for instances from the past ...
B. Ashok, Joseph M. Joy, Hongkang Liang, Sriram K....
SIGSOFT
2008
ACM
14 years 8 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