Sciweavers

620 search results - page 19 / 124
» Concrete Abstractions
Sort
View
VMCAI
2004
Springer
14 years 3 months ago
Symbolic Implementation of the Best Transformer
This paper shows how to achieve, under certain conditions, abstract-interpretation ms that enjoy the best possible precision for a given abstraction. The key idea is a simple proce...
Thomas W. Reps, Shmuel Sagiv, Greta Yorsh
ECOOP
2001
Springer
14 years 2 months ago
Distinctness and Sharing Domains for Static Analysis of Java Programs
Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads...
Isabelle Pollet, Baudouin Le Charlier, Agostino Co...
VMCAI
2007
Springer
14 years 4 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
PLDI
2011
ACM
13 years 20 days ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
14 years 2 months ago
Visual Semantics - Or: What You See is What You Compute
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
Martin Erwig