Sciweavers

4940 search results - page 281 / 988
» On the Complexity of Universal Programs
Sort
View
ESOP
2012
Springer
14 years 2 months ago
GMeta: A Generic Formal Metatheory Framework for First-Order Representations
Abstract. This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lem...
Gyesik Lee, Bruno C. D. S. Oliveira, Sungkeun Cho,...
CVPR
2004
IEEE
16 years 8 months ago
Optimizing Motion Estimation with Linear Programming and Detail-Preserving Variational Method
In this paper, we propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the...
Hao Jiang, Ze-Nian Li, Mark S. Drew
IEEEPACT
2006
IEEE
16 years 19 days ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
HASKELL
2005
ACM
16 years 5 days ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
IFIP
2004
Springer
15 years 12 months ago
Static program transformations for efficient software model checking
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
Shobha Vasudevan, Jacob A. Abraham