Sciweavers

2861 search results - page 280 / 573
» Constraint Programming
Sort
View
AADEBUG
1997
Springer
15 years 10 months ago
Bisection Debugging
This paper introduces the bisection debugging model. The key idea is to use a debugger to identify the semantic differences between two versions of the same program. The debugger ...
Thomas R. Gross
KRDB
2003
111views Database» more  KRDB 2003»
15 years 8 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
PLDI
2010
ACM
15 years 11 months ago
Jinn: synthesizing dynamic bug detectors for foreign language interfaces
Programming language specifications mandate static and dynamic analyses to preclude syntactic and semantic errors. Although individual languages are usually well-specified, comp...
Byeongcheol Lee, Ben Wiedermann, Martin Hirzel, Ro...
DAC
1997
ACM
15 years 10 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
GD
2007
Springer
16 years 22 days ago
Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
Tim Dwyer, Kim Marriott