Sciweavers

1111 search results - page 189 / 223
» Program Analysis as Model Checking of Abstract Interpretatio...
Sort
View
SIGSOFT
2005
ACM
14 years 9 months ago
Permissive interfaces
A modular program analysis considers components independently and provides succinct summaries for each component, which can be used when checking the rest of the system. Consider ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar
CACM
1998
81views more  CACM 1998»
13 years 8 months ago
Toward a Model of Type Inheritance
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
C. J. Date, Hugh Darwen
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
14 years 3 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
ENTCS
2007
105views more  ENTCS 2007»
13 years 8 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
FAC
2008
108views more  FAC 2008»
13 years 8 months ago
Property-directed incremental invariant generation
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
Aaron R. Bradley, Zohar Manna