Filters
Counterexample Validation and Interpolation-Based Refinement for Forest Automata
shape analysis based on forest automata. Our approach is based on backward symbolic execution on forest automata, allowing one to derive automata-based interpolants and refine the automata abstra...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Forester: From Heap Shapes to Automata Predicates
for hierarchical forest automata.This paper describes the participation of Forester in the SV-COMP 2017 competition on software verification. We briefly present the verification procedure used by Forester, the arc...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Forester: Shape Analysis Using Tree Automata (Competition Contribution)
Forester is a tool for shape analysis of programs with complex dynamic data structures, including various flavours of lists (such as singly linked lists, nested tree automata. This paper gives a brief description of the verificatio...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Fully Automated Shape Analysis Based on Forest Automata
Forest automata (FA) have recently been proposed as a tool for shape analysis of complex heap structures. FA encode sets of tree decompositions of heap graphs in the form of tuples of tree automata. In order to allow for re...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Verification of heap manipulating programs with ordered data by extended forest automata
We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. The underlying formalism of our framework is that of forest aut...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2015 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata
We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. Our framework is based on the notion of forest automata (F...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Run Forester, Run Backwards! (Competition Contribution)
Forester is a tool for shape analysis of programs with complex dynamic data structures, including various flavours of lists (such as singly linked lists, nested tree automata. This paper gives a brief description of the verificatio...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Forester: A Tool for Verification of Programs with Pointers
The tool allows verification of programs which manipulate complex dynamic data structures.
IN - Informatika
- 2010 •
- R
Rok uplatnění
R - Software
Forest Automata for Verification of Heap Manipulation
of tree automata to represent heap configurations. A heap is split into several. The automata can refer to each other allowing the different parts of the heaps to mutually of heaps by allowing alphabets of the tree automata
IN - Informatika
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Forest Automata for Verification of Heap Manipulation
of tree automata to represent heap configurations. A heap is split into several. The automata can refer to each other allowing the different parts of the heaps to mutually of heaps by allowing alphabets of the tree automata
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
- 1 - 10 out of 21 269