Sciweavers

57 search results - page 6 / 12
» Reporting Failures in Functional Logic Programs
Sort
View
SIGSOFT
2004
ACM
15 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
ISMVL
2007
IEEE
92views Hardware» more  ISMVL 2007»
15 years 3 months ago
Experimental Studies on SAT-Based ATPG for Gate Delay Faults
The clock rate of modern chips is still increasing and at the same time the gate size decreases. As a result, already slight variations during the production process may cause a f...
Stephan Eggersglüß, Daniel Tille, G&oum...
SIGSOFT
2003
ACM
15 years 10 months ago
Protecting C programs from attacks via invalid pointer dereferences
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
Suan Hsi Yong, Susan Horwitz
ICFP
2003
ACM
15 years 9 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...
85
Voted
ICFP
2010
ACM
14 years 10 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones