Sciweavers

851 search results - page 155 / 171
» Associative definition of programming languages
Sort
View
CP
2005
Springer
14 years 1 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
WSC
2000
13 years 8 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis
KBSE
2007
IEEE
14 years 1 months ago
Effective memory protection using dynamic tainting
Programs written in languages that provide direct access to memory through pointers often contain memory-related faults, which may cause non-deterministic failures and even securi...
James A. Clause, Ioannis Doudalis, Alessandro Orso...
WOTUG
2008
13 years 9 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith