Sciweavers

100 search results - page 8 / 20
» Automated Security Debugging Using Program Structural Constr...
Sort
View
ICLP
1992
Springer
14 years 19 days ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen
ICLP
2011
Springer
13 years 14 hour ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
NDSS
2008
IEEE
14 years 2 months ago
Automated Whitebox Fuzz Testing
Fuzz testing is an effective technique for finding security vulnerabilities in software. Traditionally, fuzz testing tools apply random mutations to well-formed inputs of a progr...
Patrice Godefroid, Michael Y. Levin, David A. Moln...
ICST
2009
IEEE
14 years 3 months ago
PKorat: Parallel Generation of Structurally Complex Test Inputs
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
Junaid Haroon Siddiqui, Sarfraz Khurshid
ESOP
2009
Springer
14 years 3 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell