Sciweavers

1911 search results - page 168 / 383
» Program analysis for code duplication in logic programs
Sort
View
PPDP
2009
Springer
16 years 26 days ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
177
Voted
SIGSOFT
2004
ACM
16 years 7 months ago
Testing static analysis tools using exploitable buffer overflows from open source code
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
Misha Zitser, Richard Lippmann, Tim Leek
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 6 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
SERP
2007
15 years 7 months ago
Towards Aspect-oriented Model-driven Code Generation in the Formal Design Analysis Framework
Model driven code generation has been investigated in traditional and object-oriented design paradigms; significant progress has been made. It offers many advantages including the...
Kendra Cooper, Lirong Dai, Sergiu Dascalu, Nehal M...
143
Voted
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
16 years 13 days ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin