Sciweavers

923 search results - page 93 / 185
» Proving the value of formal methods
Sort
View
SIGSOFT
2010
ACM
15 years 28 days ago
Language-based verification will change the world
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
Tim Sheard, Aaron Stump, Stephanie Weirich
SMI
2007
IEEE
129views Image Analysis» more  SMI 2007»
16 years 13 days ago
Localized Homology
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
Afra Zomorodian, Gunnar Carlsson
COMMA
2006
15 years 7 months ago
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
Søren Holbech Nielsen, Simon Parsons
KBSE
2000
IEEE
15 years 9 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
JMLR
2010
143views more  JMLR 2010»
15 years 4 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...