Sciweavers

651 search results - page 79 / 131
» Precise Analysis of Java Programs Using JOANA
Sort
View
CONCUR
2005
Springer
15 years 8 months ago
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Ahmed Bouajjani, Markus Müller-Olm, Tayssir T...
147
Voted
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 6 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
OOPSLA
2005
Springer
15 years 7 months ago
Quantifying the performance of garbage collection vs. explicit memory management
Garbage collection yields numerous software engineering benefits, but its quantitative impact on performance remains elusive. One can compare the cost of conservative garbage col...
Matthew Hertz, Emery D. Berger
TAPSOFT
1997
Springer
15 years 6 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
140
Voted
CADE
2004
Springer
16 years 2 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu