Sciweavers

373 search results - page 23 / 75
» Automatic Generation of Symmetry-Breaking Constraints
Sort
View
SIGMOD
2011
ACM
290views Database» more  SIGMOD 2011»
13 years 23 days ago
Database state generation via dynamic symbolic execution for coverage criteria
Automatically generating sufficient database states is imperative to reduce human efforts in testing database applications. Complementing the traditional block or branch coverage...
Kai Pan, Xintao Wu, Tao Xie
CPAIOR
2010
Springer
13 years 8 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
SAC
2006
ACM
13 years 10 months ago
A domain-specific language for task handlers generation, applying discrete controller synthesis
We propose a simple programming language, called Nemo, specific to the domain of multi-task real-time embedded systems, such as in robotic, automotive or avionics systems. It can ...
Gwenaël Delaval, Éric Rutten
PPDP
2005
Springer
14 years 3 months ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
DAC
1996
ACM
14 years 2 months ago
Characterization and Parameterized Random Generation of Digital Circuits
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...
Michael D. Hutton, Jerry P. Grossman, Jonathan Ros...