Filters








192 Hits in 2.5 sec

TVLA: A System for Generating Abstract Interpreters [chapter]

Tal Lev-Ami, Roman Manevich, Mooly Sagiv
Building the Information Society  
TVLA (Three-Valued-Logic Analyzer) is a "YACC"-like framework for automatically constructing abstract interpreters from an operational semantics.  ...  The operational semantics is specified as a generic transition system based on first-order logic.  ...  An Overview of the TVLA System In this paper, we review TVLA (Three-Valued-Logic Analyzer), a system for automatically generating a static-analysis implementation from the operational semantics of a given  ... 
doi:10.1007/978-1-4020-8157-6_28 dblp:conf/ifip/Lev-AmiMS04 fatcat:xynfsui7gnbqvlhnnu2vpx2mgy

Compactly Representing First-Order Structures for Static Analysis [chapter]

R. Manevich, G. Ramalingam, J. Field, D. Goyal, M. Sagiv
2002 Lecture Notes in Computer Science  
A fundamental bottleneck in applying sophisticated static analyses to large programs is the space consumed by abstract program states.  ...  The results show that both the OBDD and functional implementations reduce space consumption in TVLA by a factor of 4 to 10 relative to the current TVLA state representation, without compromising analysis  ...  TVLA Primer In this section, we give a brief overview of those aspects of the TVLA system that pertain to state manipulation. Complete details of the system may be found in [6] .  ... 
doi:10.1007/3-540-45789-5_16 fatcat:72k267kqnzbezfvinuco5b5ccy

Verification of Java Programs with Interacting Analysis Plugins

Nathaniel Charlton
2006 Electronical Notes in Theoretical Computer Science  
We describe our implementation of a prototype checker for a subset of Java which combines predicate abstraction, 3-valued shape analysis and a decidable pointer analysis.  ...  This allows for "plugging together" such tools as required by each verification task and makes it easy to integrate new analyses.  ...  Acknowledgement I would like to thank Michael Huth for our many fruitful discussions about this work.  ... 
doi:10.1016/j.entcs.2005.10.009 fatcat:nvtvwa4lb5fy5mntew6uorxqya

Alexsa - Algorithm Explanation by Shape Analysis - Extensions to the TVLA System [article]

Ronald Bieber, Universität Des Saarlandes, Universität Des Saarlandes
2001
And since TVLA only handles one input file per execution, we need not fear for mixups between different analyses.  ...  TVLA -THE ANALYSIS IMPLEMENTATION TVLA -The analysis implementation Developed by Tal and Mooly Sagiv, TVLA ("Three Valued Logic Analysis") [Lev-Ami and Sagiv, 2000b,a; Lev-Ami et al., 2000] represents  ...  issues This appendix contains several general implementational issues for completeness, including a list of all classes and a complete list of changes made to TVLA.  ... 
doi:10.22028/d291-25670 fatcat:3sbyoesfung2xkxqdnnifpycvq

Shape Analysis of Low-Level C with Overlapping Structures [chapter]

Jörg Kreiker, Helmut Seidl, Vesal Vojdani
2010 Lecture Notes in Computer Science  
We demonstrate the appropriateness of these models by implementing shape analyses based on them within the TVLA framework.  ...  Shape analyses have traditionally relied on a graph-based representation of memory where a node corresponds to a whole record and edges to pointers.  ...  Both memory models are formulated in terms of the TVLA framework [27] . Using the TVLA framework is not necessary but allows for a quick prototype implementation.  ... 
doi:10.1007/978-3-642-11319-2_17 fatcat:yx7xudehave5xhc72x4ivsinty

Partially Disjunctive Heap Abstraction [chapter]

Roman Manevich, Mooly Sagiv, Ganesan Ramalingam, John Field
2004 Lecture Notes in Computer Science  
We implemented this abstraction in TVLA-a generic system for implementing program analyses.We conducted an empirical evaluation of the new abstraction and compared it with the powerset heap abstraction  ...  Indeed, experience indicates that the partially disjunctive shape abstraction improves performance across all TVLA analyses uniformly, and in many cases is essential for making precise shape analysis feasible  ...  Acknowledgements The authors wish to thank Alexey Loginov for supplying us the tree benchmarks and the DSW benchmark, and Eran Yahav for supplying us the IOStream benchmarks, the KernelBench.1 benchmark  ... 
doi:10.1007/978-3-540-27864-1_20 fatcat:eczj6rj6zzaq5imqv5qifffmlm

Program verification with interacting analysis plugins

Nathaniel Charlton
2007 Formal Aspects of Computing  
We describe a prototype implementation of our framework, which performs static assertion checking on a simple language for heap-manipulating programs.  ...  This implementation includes plugins for three existing approaches -predicate abstraction, 3-valued shape analysis and a decidable pointer analysis -and for a simple type system.  ...  Acknowledgements Thanks to Dennis Dams for drawing our attention to the work in [CLCVH00] , and Michael Huth for many productive discussions about the contents of this paper.  ... 
doi:10.1007/s00165-007-0029-4 fatcat:kpdnrctzyjb5phtdnqzl7djhsy

Putting static analysis to work for verification

Tal Lev-Ami, Thomas Reps, Mooly Sagiv, Reinhard Wilhelm
2000 Proceedings of the International Symposium on Software Testing and Analysis - ISSTA '00  
A prototype of the algorithm has been implemented.  ...  • We have some ideas about how to automatically generate correct predicate-update formulae for the instrumentation predicates.  ...  A generalized version of that analysis framework has been implemented in a system called TVLA [18, 19] (for Three-Valued-Logic Analyzer).  ... 
doi:10.1145/347324.348031 dblp:conf/issta/Lev-AmiRSW00 fatcat:aqm3mk62zjbppn4fm64khj7oye

Putting static analysis to work for verification

Tal Lev-Ami, Thomas Reps, Mooly Sagiv, Reinhard Wilhelm
2000 Software engineering notes  
A prototype of the algorithm has been implemented.  ...  • We have some ideas about how to automatically generate correct predicate-update formulae for the instrumentation predicates.  ...  A generalized version of that analysis framework has been implemented in a system called TVLA [18, 19] (for Three-Valued-Logic Analyzer).  ... 
doi:10.1145/347636.348031 fatcat:wwbolxs4uneuhpq3x3bvqhblfi

Deriving specialized program analyses for certifying component-client conformance

G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, Mooly Sagiv
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
Finally, we evaluate a prototype implementation of a certifier for CMP on a variety of test programs.  ...  We are concerned with the problem of statically certifying (verifying) whether the client of a software component conforms to the component's constraints for correct usage.  ...  Acknowledgments We thank Sean McDirmid for introducing us to the Concurrent Modification Problem, the SOOT team and Roman Manevich for the assistance they provided with the implementation, and Robert O'Callahan  ... 
doi:10.1145/512529.512540 dblp:conf/pldi/RamalingamWFGS02 fatcat:c7cg26fgy5cbjkdnivgg464kcm

Deriving specialized program analyses for certifying component-client conformance

G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, Mooly Sagiv
2002 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02  
Finally, we evaluate a prototype implementation of a certifier for CMP on a variety of test programs.  ...  We are concerned with the problem of statically certifying (verifying) whether the client of a software component conforms to the component's constraints for correct usage.  ...  Acknowledgments We thank Sean McDirmid for introducing us to the Concurrent Modification Problem, the SOOT team and Roman Manevich for the assistance they provided with the implementation, and Robert O'Callahan  ... 
doi:10.1145/512537.512540 fatcat:tm3hsbj3jzfdloi63lv7n5qs64

A shape analysis for optimizing parallel graph programs

Dimitrios Prountzos, Roman Manevich, Keshav Pingali, Kathryn S. McKinley
2011 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11  
We implemented the shape analysis in TVLA, and used it to optimize benchmarks from the Lonestar suite. The optimized programs were executed on the Galois system.  ...  It uses two key ideas: a novel top-down heap abstraction that controls state space explosion, and a strategy for predicate discovery that exploits common patterns of data structure usage.  ...  Acknowledgments We would like to thank the anonymous referees, Noam Rinetzky, and Josh Berdine for their helpful comments.  ... 
doi:10.1145/1926385.1926405 dblp:conf/popl/PrountzosMPM11 fatcat:qssntsevujeqzftdjqv33jaxci

A shape analysis for optimizing parallel graph programs

Dimitrios Prountzos, Roman Manevich, Keshav Pingali, Kathryn S. McKinley
2011 SIGPLAN notices  
We implemented the shape analysis in TVLA, and used it to optimize benchmarks from the Lonestar suite. The optimized programs were executed on the Galois system.  ...  It uses two key ideas: a novel top-down heap abstraction that controls state space explosion, and a strategy for predicate discovery that exploits common patterns of data structure usage.  ...  Acknowledgments We would like to thank the anonymous referees, Noam Rinetzky, and Josh Berdine for their helpful comments.  ... 
doi:10.1145/1925844.1926405 fatcat:bs2xsirdljbvhbqtlf6zgnutqu

Computational Logical Frameworks and Generic Program Analysis Technologies [chapter]

José Meseguer, Grigore Roşu
2008 Lecture Notes in Computer Science  
of the formalism, 4. efficient implementability, and efficient meta-tools, 5. support for reflection, 6. support for inductive reasoning, preferably with initial model semantics, 7. support for generation  ...  For this, a computational logical framework with efficient executability and a spectrum of meta-tools can serve as a basis on which to: (1) define the formal semantics of any programming language; and  ...  There is also another layer at which to consider the issue; let me put in a plug for Stefan Schwoon's Weighted Pushdown System library and the Wisconsin system WPDS++.  ... 
doi:10.1007/978-3-540-69149-5_28 fatcat:ma3qya42aba3xbyhsb5l7tr37e

Deriving specialized program analyses for certifying component-client conformance

G. Ramalingam, Alex Warshavsky, John Field, Deepak Goyal, Mooly Sagiv
2002 SIGPLAN notices  
Finally, we evaluate a prototype implementation of a certifier for CMP on a variety of test programs.  ...  We are concerned with the problem of statically certifying (verifying) whether the client of a software component conforms to the component's constraints for correct usage.  ...  Acknowledgments We thank Sean McDirmid for introducing us to the Concurrent Modification Problem, the SOOT team and Roman Manevich for the assistance they provided with the implementation, and Robert O'Callahan  ... 
doi:10.1145/543552.512540 fatcat:h7kgiisupfh3ravcvzpov24ebe
« Previous Showing results 1 — 15 out of 192 results