Sciweavers

1073 search results - page 16 / 215
» Formal Program Development with Approximations
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 8 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
SIGSOFT
2001
ACM
14 years 9 months ago
An empirical study on the utility of formal routines to transfer knowledge and experience
Most quality and software process improvement frameworks emphasize written (i.e. formal) documentation to convey recommended work practices. However, there is considerable skeptic...
Reidar Conradi, Tore Dybå
FPL
2007
Springer
101views Hardware» more  FPL 2007»
14 years 2 months ago
Formal Modeling of Process Migration
This paper develops a formal model of process migration that describes programs, processes, and the migration of those processes within a migration realm. A migration realm is a g...
Aric D. Blumer, Henning S. Mortveit, Cameron D. Pa...
CCS
2004
ACM
14 years 2 months ago
Formally verifying information flow type systems for concurrent and thread systems
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...
Gilles Barthe, Leonor Prensa Nieto
POPL
2010
ACM
14 years 6 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel