Sciweavers

1452 search results - page 191 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
120
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 2 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
109
Voted
ISSTA
2009
ACM
15 years 8 months ago
HAMPI: a solver for string constraints
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter H...
116
Voted
PLDI
2006
ACM
15 years 8 months ago
A framework for unrestricted whole-program optimization
Procedures have long been the basic units of compilation in conventional optimization frameworks. However, procedures are typically formed to serve software engineering rather tha...
Spyridon Triantafyllis, Matthew J. Bridges, Easwar...
BIRTHDAY
2003
Springer
15 years 7 months ago
Extreme Model Checking
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
118
Voted
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
15 years 18 days ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...