Sciweavers

479 search results - page 35 / 96
» On Static Properties of Specialized Programs
Sort
View
AIMSA
2000
Springer
15 years 5 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
AOSD
2011
ACM
14 years 7 months ago
Reducing combinatorics in testing product lines
A Software Product Line (SPL) is a family of programs where each program is defined by a unique combination of features. Testing or checking properties of an SPL is hard as it ma...
Chang Hwan Peter Kim, Don S. Batory, Sarfraz Khurs...
83
Voted
IFIP
2009
Springer
15 years 7 months ago
Towards a Type System for Security APIs
Security API analysis typically only considers a subset of an API’s functions, with results bounded by the number of function calls. Furthermore, attacks involving partial leakag...
Gavin Keighren, David Aspinall, Graham Steel
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
15 years 5 months ago
Library Compatible Ceff for Gate-Level Timing
Accurate gate-level static timing analysis in the presence of RC loads has become an important problem for modern deep-submicron designs. Non-capacitive loads are usually analyzed...
Bernard N. Sheehan
ECAI
2008
Springer
15 years 2 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson