Flow-Insensitive Points-To Analyses for Frama-C: Based on Tarjan s Disjoint-Sets (Paperback)
5 Angebote vergleichen

Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
Paperback. 52 pages. Dimensions: 9.0in. x 6.0in. x 0.1in.In this book, we compare two known algorithms for flow-insensitive points-to analyses. We show that they differ in precision and complexity. Andersens algorithm offers a flow-insensitive analysis with a high precision. Steensgaards algorithm provides a high performance points-to analysis. The time complexity in the number of program state- ments becomes almost linear if one uses Tarjans disjoint sets as a data structure for Steensgaards algorithm. We implemented the disjoint sets with a single array. The usage of arrays with quick reading access, has the advantage of providing a high-performance data structure for the analyzes. The performance has been tested in Section 5. 2. We showed that a functional programming language like OCaml is well suited for an implementation of Steensgaards algorithm. Since our program is written in OCaml, it could be used as a prototype for a Frama-C plugin. During development we encountered a problem that emerges from uninitialized pointers. Their referenced locations have to be unifiable regardless of whether these locations are empty or not. To overcome this problem, we introduced distinct empty sets that can be merged. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1 to 2 months.
Von Händler/Antiquariat, Amazon.com.
In this book, we compare two known algorithms for flow-insensitive points-to analyses. We show that they differ in precision and complexity. Andersen's algorithm offers a flow-insensitive analysis with a high precision. Steensgaard's algorithm provides a high performance points-to analysis. The time complexity in the number of program state- ments becomes almost linear if one uses Tarjan's disjoint sets as a data structure for Steensgaard's algorithm. We implemented the disjoint sets with a single array. The usage of arrays with quick reading access, has the advantage of providing a high-performance data structure for the analyzes. The performance has been tested in Section 5.2. We showed that a functional programming language like OCaml is well suited for an implementation of Steensgaard's algorithm. Since our program is written in OCaml, it could be used as a prototype for a Frama-C plugin. During development we encountered a problem that emerges from uninitialized pointers. Their referenced locations have to be unifiable regardless of whether these locations are empty or not. To overcome this problem, we introduced distinct empty sets that can be merged. Paperback, Label: AV Akademikerverlag, AV Akademikerverlag, Produktgruppe: Book, Publiziert: 2015-03-27, Studio: AV Akademikerverlag.

Flow-Insensitive Points-To Analyses for Frama-C von Max Berndt Englisch, 52 Seiten, Oktober 2016, AV Akademikerverlag, Taschenbuch, ISBN 3639807553, EAN 9783639807554 Beschreibung In this book, we compare two known algorithms for flow-insensitive points-to analyses. We show that they differ in precision and complexity. Andersens algorithm offers a flow-insensitive analysis with a high precision. Steensgaards algorithm provides a high performance points-to analysis. The time complexity in the number of program state- ments becomes almost linear if one uses Tarjans disjoint sets as a data structure for Steensgaards algorithm. We implemented the disjoint sets with a single array. The usage of arrays with quick reading access, has the advantage of providing a high-performance data structure for the analyzes. The performance has been tested in Section 5.2. We showed that a functional programming language like OCaml is well suited for an implementation of Steensgaards algorithm. Since our program is written in OCaml, it could be used as a prototype for a Frama-C plugin. During development we encountered a problem that emerges from uninitialized pointers. Their referenced locations have to be unifiable regardless of whether these locations are empty or not. To overcome this problem, we introduced distinct empty sets that can be merged.

Lieferung aus: Vereinigte Staaten von Amerika, zzgl. Versandkosten, Verandgebiet: DOM.
Von Händler/Antiquariat, BuySomeBooks, NV, Las Vegas, [RE:5].
Trade paperback.