Sciweavers

1291 search results - page 45 / 259
» Arithmetic program paths
Sort
View
CADE
2010
Springer
13 years 9 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
COMPSAC
2008
IEEE
14 years 2 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
MOR
2000
162views more  MOR 2000»
13 years 8 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
14 years 4 days ago
Genetic programming with primitive recursion
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
Stefan Kahrs
CP
2005
Springer
14 years 2 months ago
Graph Invariants as Necessary Conditions for Global Constraints
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
Nicolas Beldiceanu, Mats Carlsson, Jean-Xavier Ram...