Sciweavers

72 search results - page 3 / 15
» Automatic Generation of Local Repairs for Boolean Programs
Sort
View
PPDP
2010
Springer
14 years 7 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
KBSE
2006
IEEE
15 years 3 months ago
Sieve: A Tool for Automatically Detecting Variations Across Program Versions
Software systems often undergo many revisions during their lifetime as new features are added, bugs repaired, abstractions simplified and refactored, and performance improved. Wh...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
IV
2007
IEEE
149views Visualization» more  IV 2007»
15 years 3 months ago
Information Visualization of Multi-dimensional Cellular Automata using GPU Programming
We propose a method for generating all possible rules of multidimension Boolean cellular automata (CA). Based on an original encoding method and the programming of graphical proce...
Stéphane Gobron, Daniel Mestre
ENTCS
2010
208views more  ENTCS 2010»
14 years 6 months ago
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
In this paper, we present Aspic, an automatic polyhedral invariant generation tool for flowcharts programs. Aspic implements an improved Linear Relation Analysis on numeric counte...
Paul Feautrier, Laure Gonnord
AISC
2006
Springer
15 years 1 months ago
Finding Relations Among Linear Constraints
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
Jun Yan, Jian Zhang, Zhongxing Xu