A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Filters
TVLA: A System for Generating Abstract Interpreters
[chapter]
Building the Information Society
Preserved Fulltext
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. ...
The idea of automatically generating abstract semantics from concrete semantics was proposed in Cousot, 1997. TVLA is intended as a proof of concept for abstract interpreters. ...
doi:10.1007/978-1-4020-8157-6_28
dblp:conf/ifip/Lev-AmiMS04
fatcat:xynfsui7gnbqvlhnnu2vpx2mgy
Revamping TVLA: Making Parametric Shape Analysis Competitive
[chapter]
Computer Aided Verification
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use linked data structures. ...
The improvements were obtained by employing well-known techniques from the database community to reduce the cost of extracting information from shape descriptors and performing abstract interpretation ...
Introduction In this paper, we review recent improvements to TVLA (Three-Valued-Logic Analyzer), a system for automatically generating a static-analysis implementation from the operational semantics of ...
doi:10.1007/978-3-540-73368-3_25
dblp:conf/cav/BogudlovLRS07
fatcat:uabafgyl65dv7frqqi65cjpeei
Automatic Verification of Strongly Dynamic Software Systems
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this position paper, we describe the progress we have made in automated verification of strongly dynamic systems using abstract interpretation with three-valued logical structures. ...
We then enumerate a number of challenges that must be tackled in order for such techniques to be widely adopted. ...
[18] , a general-purpose abstract-interpretation engine based on three-valued logic. ...
doi:10.1007/978-3-540-69149-5_11
fatcat:252iuojyevfyxhvlyskmtxnym4
Partially Disjunctive Heap Abstraction
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
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 ...
Disjunctive (powerset) abstractions capture such distinctions in a natural way. However, in general, powerset abstractions increase space and time costs by an exponential factor. ...
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
Alexsa - Algorithm Explanation by Shape Analysis - Extensions to the TVLA System
[article]
2001
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Since TVLA can be used for other applications than dynamic data structure analysis, we will not try to interpret the generated data ourselves. ...
The problem is that the user may not see the shape graph as a purely abstract representation, but instead he or she will very likely combine the abstract view with own concrete interpretations. ...
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
Compactly Representing First-Order Structures for Static Analysis
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A fundamental bottleneck in applying sophisticated static analyses to large programs is the space consumed by abstract program states. ...
The TVLA (Three-Valued Logic Analysis) program analysis and verification system models dynamic allocation precisely by representing program states as first-order structures. ...
x = x->n; } } (a) (b)
Abstract Interpretation in TVLA TVLA takes as input a control flow graph (CFG) of the program to be analyzedeach edge of which is annotated with a sequence of actions-and an abstract ...
doi:10.1007/3-540-45789-5_16
fatcat:72k267kqnzbezfvinuco5b5ccy
Verification of Java Programs with Interacting Analysis Plugins
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
In this paper we propose a modular framework for program analysis, where multiple program analysis tools are combined in order to exploit the particular advantages of each. ...
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
Abstraction Refinement via Inductive Learning
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This paper concerns how to automatically create abstractions for program analysis. ...
We show that inductive learning, the goal of which is to identify general rules from a set of observed instances, provides new leverage on the problem. ...
The TVLA system is a tool for creating such analyses [1] . ...
doi:10.1007/11513988_50
fatcat:e3ekksspufacpd34dgct4gubmi
Automatically Verifying Concurrent Queue Algorithms
2003
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Concurrent FIFO queues are a common component of concurrent systems. Using a single shared lock to prevent concurrent manipulations of queue contents reduces system concurrency. ...
This paper shows how to automatically verify partial correctness of concurrent FIFO queue algorithms using existing abstract interpretation techniques. ...
The imprecision in TVLA/3VMC occurs due to the fact that the system abstracts many of the dynamically allocated objects and threads into a single summary representation. ...
doi:10.1016/s1571-0661(05)80006-4
fatcat:33x4n5k2tvcarfakho2xwkrvwm
Verification of B $$^+$$ trees by integration of shape analysis and interactive theorem proving
2013
Journal of Software and Systems Modeling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
TVLA itself relies on problem specific constraints and lemmas, that were proven in KIV as a foundation for an overall correct analysis. ...
To this purpose we define a mapping between typed algebraic heaps and TVLA. ...
Acknowledgements We thank Alexander Knapp, Axel Habermaier, and the anonymous reviewers for their valuable feedback. ...
doi:10.1007/s10270-013-0320-1
fatcat:u3plcztperh43bu5scy2oga7zq
Program verification with interacting analysis plugins
2007
Formal Aspects of Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
We describe a prototype implementation of our framework, which performs static assertion checking on a simple language for heap-manipulating programs. ...
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
Computing the Scope of Applicability for Acquired Task Knowledge in Experience-Based Planning Domains
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
., activity schemata, for generating solutions to problem instances in a class of tasks. ...
Using Three-Valued Logic Analysis (TVLA), we extend previous work to generate a set of conditions that determine the scope of applicability of an activity schema. ...
To extend a loop, the abstract planner simultaneously generates all successors for an iteration of the loop as well as for the following abstract action after the loop. ...
arXiv:1903.06015v1
fatcat:xjpj2fmmmbh7zh2kxid7wa7i64
Algorithm animation using shape analysis
2005
Proceedings of the 2005 ACM symposium on Software visualization - SoftVis '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We visualise the abstract execution of an algorithm instead of animating the algorithm for executions on concrete input data. Algorithms under consideration are imperative pointer-based algorithms. ...
This paper describes progress in a non-traditional approach to algorithm animation. ...
TVLA needs to generate and distinguish many shape graphs for a correct analysis. Often, redundancies are introduced as well. The visualisation, however, does not need this level of detail. ...
doi:10.1145/1056018.1056021
dblp:conf/softvis/JohannesSW05
fatcat:be4dskf2hbf4dhh2maenqxfblm
Satisfiability modulo abstraction for separation logic with linked lists
2014
Proceedings of the 2014 International SPIN Symposium on Model Checking of Software - SPIN 2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The semi-decision procedure is designed using concepts from abstract interpretation. ...
The procedure uses an abstract domain of shape graphs to represent a set of heap structures, and computes an abstraction that overapproximates the set of satisfying models of a given formula. ...
a more general language in which to specify equation systems. ...
doi:10.1145/2632362.2632376
dblp:conf/spin/ThakurBR14
fatcat:lzmuignccvhnjadmydizvexbkq
Putting static analysis to work for verification
2000
Proceedings of the International Symposium on Software Testing and Analysis - ISSTA '00
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
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
« Previous
Showing results 1 — 15 out of 259 results