Sciweavers

6960 search results - page 365 / 1392
» Continuity Analysis of Programs
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 5 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
ICSE
2007
IEEE-ACM
16 years 4 months ago
Kato: A Program Slicing Tool for Declarative Specifications
This paper presents Kato, a tool that implements a novel class of optimizations that are inspired by program slicing for imperative languages but are applicable to analyzable decl...
Engin Uzuncaova, Sarfraz Khurshid
ICC
2007
IEEE
122views Communications» more  ICC 2007»
15 years 11 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi
CCECE
2006
IEEE
15 years 10 months ago
AOP Extension for Security Testing of Programs
The purpose of this paper is to use the aspect-oriented programming (AOP) paradigm for security testing. AOP allows security experts to develop and inject separate modules for con...
Nadia Belblidia, Mourad Debbabi, Aiman Hanna, Zhen...
COMPSAC
2005
IEEE
15 years 10 months ago
Goal-Oriented Test Data Generation for Programs with Pointer Variables
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
Arnaud Gotlieb, Tristan Denmat, Bernard Botella