Sciweavers

1073 search results - page 82 / 215
» Formal Program Development with Approximations
Sort
View
ENTCS
2007
144views more  ENTCS 2007»
13 years 10 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
APLAS
2009
ACM
14 years 4 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata
ASP
2005
Springer
14 years 3 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
MPC
2010
Springer
177views Mathematics» more  MPC 2010»
14 years 2 months ago
Adjoint Folds and Unfolds
Abstract. Folds and unfolds are at the heart of the algebra of programming. They allow the cognoscenti to derive and manipulate programs rigorously and effectively. Fundamental la...
Ralf Hinze
EMMCVPR
2005
Springer
14 years 3 months ago
Linear Programming Matching and Appearance-Adaptive Object Tracking
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
Hao Jiang, Mark S. Drew, Ze-Nian Li