Sciweavers

4719 search results - page 242 / 944
» Newtonian program analysis
Sort
View
ICFP
1999
ACM
15 years 10 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
POPL
2008
ACM
16 years 6 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
ICSE
2005
IEEE-ACM
16 years 5 months ago
Object naming analysis for reverse-engineered sequence diagrams
UML sequence diagrams are commonly used to represent object interactions in software systems. This work considers the problem of extracting UML sequence diagrams from existing cod...
Atanas Rountev, Beth Harkness Connell
RTAS
2008
IEEE
16 years 4 days ago
A Modular Worst-case Execution Time Analysis Tool for Java Processors
Recent technologies such as the Real-Time Specification for Java promise to bring Java’s advantages to real-time systems. While these technologies have made Java more predictab...
Trevor Harmon, Martin Schoeberl, Raimund Kirner, R...
SEFM
2008
IEEE
16 years 4 days ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto