Sciweavers

4719 search results - page 363 / 944
» Newtonian program analysis
Sort
View
CAL
2006
15 years 6 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani
POPL
2009
ACM
16 years 7 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux
FMCO
2007
Springer
16 years 25 days ago
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
Elvira Albert, Puri Arenas, Samir Genaim, German P...
GPCE
2008
Springer
15 years 7 months ago
On the modularity of feature interactions
Feature modules are the building blocks of programs in software product lines (SPLs). A foundational assumption of feature-based program synthesis is that features are composed in...
Chang Hwan Peter Kim, Christian Kästner, Don ...
IJNSEC
2008
150views more  IJNSEC 2008»
15 years 6 months ago
Tamper Resistant Software Through Intent Protection
One approach to protect distributed systems implemented with mobile code is through program obfuscation. Disguising program intent is a form of information hiding that facilitates...
Alec Yasinsac, J. Todd McDonald