Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1108792acmconferencesBook PagePublication PagespasteConference Proceedingsconference-collections
PASTE '05: Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
ACM2005 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
PASTE05: PASTE '05 - ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering Lisbon Portugal September 5 - 6, 2005
ISBN:
978-1-59593-239-6
Published:
05 September 2005
Sponsors:

Reflects downloads up to 20 Nov 2024Bibliometrics
Skip Abstract Section
Abstract

The 6th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE) was held on September 5-6, 2005 in Lisbon, Portugal. The workshop was co-located with the joint meetings of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE).The workshop received 38 submissions of which the program committee selected 17 papers for presentation.

Proceeding Downloads

Skip Table Of Content Section
SESSION: Opening
Article
PASTE at Microsoft

The Windows division of Microsoft Corporation is in the midst of a massive effort to improve the security and reliability of the next release of the product - Windows Vista. In this talk, I will explain how the Center for Software Excellence at ...

Article
An empirical framework for comparing effectiveness of testing and property-based formal analysis

Today, many formal analysis tools are not only used to provide certainty but are also used to debug software systems - a role that has traditional been reserved for testing tools. We are interested in exploring the complementary relationship as well as ...

SESSION: Static analysis
Article
Evaluating the impact of context-sensitivity on Andersen's algorithm for Java programs

Program analysis and program optimization of Java programs require reference information that estimates the instances of classes that may be accessed through dereferences. Recent work has presented several approaches for adapting Andersen's algorithm [1]...

Article
Evaluating and tuning a static analysis to find null pointer bugs

Using static analysis to detect memory access errors, such as null pointer dereferences, is not a new problem. However, much of the previous work has used rather sophisticated analysis techniques in order to detect such errors.In this paper we show that ...

Article
Link-time static analysis for efficient separate compilation of object-oriented languages

Compilers used in industry are mainly based on a separate compilation framework. However, the knowledge of the whole program improves efficiency of object-oriented language compilers, therefore more efficient implementation techniques are based on a ...

SESSION: Monitoring and testing
Article
Low overhead program monitoring and profiling

Program instrumentation, inserted either before or during execution, is rapidly becoming a necessary component of many systems. Instrumentation is commonly used to collect information for many diverse analysis applications, such as detecting program ...

Article
A concept analysis inspired greedy algorithm for test suite minimization

Software testing and retesting occurs continuously during the software development lifecycle to detect errors as early as possible and to ensure that changes to existing software do not break the software. Test suites once developed are reused and ...

Article
MonDe: safe updating through monitored deployment of new component versions

Safely updating software at remote sites is a cautious balance of enabling new functionality and avoiding adverse effects on existing functionality. A useful first step in this process would be to evaluate the performance of a new version of a component ...

SESSION: Security and state
Article
Making distributed systems secure with program analysis and transformation

Building secure distributed systems is difficult, and making sure they are secure is even harder. For strong security, a variety of different mechanisms are used, such as encryption, digital signatures, access control, and replication. But once the ...

Article
Invariants and state in testing and formal methods

Logical formulas called invariants are a staple of formal methods for program analysis. Persistent-state variables appear in these formulas playing their proper intuitive role, which is somewhere between inputs and internal variables. In software ...

SESSION: Analysis frameworks
Article
Symbolic path simulation in path-sensitive dataflow analysis

Symbolic path simulation is becoming an increasingly important component in many static analysis tasks. The emergence of inter-procedural path-sensitive dataflow algorithms has both raised the demands and posed new challenges for effective techniques in ...

Article
SableSpMT: a software framework for analysing speculative multithreading in Java

Speculative multithreading (SpMT) is a promising optimisation technique for achieving faster execution of sequential programs on multiprocessor hardware. Analysis of and data acquisition from such systems is however difficult and complex, and is ...

Article
Representation-independent program analysis

Program analysis has many applications in software engineering and high-performance computation, such as program understanding, debugging, testing, reverse engineering, and optimization. A ubiquitous compiler infrastructure does not exist; therefore, ...

SESSION: Low-level code
Article
LANCET: a nifty code editing tool

This paper presents LANCET, a multi-platform software visualization tool that enables the inspection of programs at the binary code level. Implemented on top of the link-time rewriting framework DIABLO, LANCET provides several views on the ...

Article
Weakest-precondition of unstructured programs

Program verification systems typically transform a program into a logical expression which is then fed to a theorem prover. The logical expression represents the weakest precondition of the program relative to its specification; when (and if!) the ...

Article
String analysis for x86 binaries

Information about string values at key points in a program can help program understanding, reverse engineering, and forensics. We present a static-analysis technique for recovering possible string values in an executable program, when no debug ...

SESSION: Reverse engineering and symbolic execution
Article
Static control-flow analysis for reverse engineering of UML sequence diagrams

UML sequence diagrams are commonly used to represent the interactions among collaborating objects. Reverse-engineered sequence diagrams are constructed from existing code, and have a variety of uses in software development, maintenance, and testing. In ...

Article
Generalizing symbolic execution to library classes

Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have focused on programs that manipulate primitive data types, such as integer or ...

Article
Automatically generating refactorings to support API evolution

When library APIs change, client code should change in response, in order to avoid erroneous behavior, compilation failures, or warnings. Previous research has introduced techniques for generating such client refactorings. This paper improves on the ...

Contributors
  • University of Washington
  • University of Copenhagen
Please enable JavaScript to view thecomments powered by Disqus.

Recommendations

Acceptance Rates

Overall Acceptance Rate 57 of 159 submissions, 36%
YearSubmittedAcceptedRate
PASTE '1313754%
PASTE '04371027%
PASTE '0226935%
PASTE '01241354%
PASTE '9931826%
PASTE '98281036%
Overall1595736%