Sciweavers

503 search results - page 95 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
JAR
2000
90views more  JAR 2000»
14 years 9 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
88
Voted
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
77
Voted
BMCBI
2008
112views more  BMCBI 2008»
14 years 9 months ago
A general modeling and visualization tool for comparing different members of a group: application to studying tau-mediated regul
Background: Innumerable biological investigations require comparing collections of molecules, cells or organisms to one another with respect to one or more of their properties. Al...
Arnab Bhattacharya, Sasha Levy, Adria LeBoeuf, Mic...
80
Voted
PLDI
2010
ACM
15 years 7 months ago
Type-preserving Compilation for End-to-end Verification of Security Enforcement
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...
Juan Chen, Ravi Chugh, Nikhil Swamy
CADE
2009
Springer
15 years 10 months ago
Integrated Reasoning and Proof Choice Point Selection in the Jahob System - Mechanisms for Program Survival
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
Martin C. Rinard