Octagons Revisited

Schwarz, Michael; Seidl, Helmut

doi:10.1007/978-3-031-44245-2_21

Cited by 3 publications

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Teaching Through Practice: Advanced Static Analysis with LiSA

Negrini,

Arceri,

Olivieri

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Nowadays, ready-to-use libraries and code generation are often used to streamline and speed up the software development process. The resulting programs are thus a collection of different modules that cooperate: proving their safety and reliability is increasingly complex, requiring sound formal techniques, such as static program analysis. However, while teaching static analysis to master’s or PhD students, the predominant focus on theoretical concepts often leaves limited space for students to engage with the practical aspects of implementing static analyses and is limited to developing elementary ones. In this paper, we show how the infrastructure offered by LiSA can be exploited to learn how to implement advanced static analyses, such as string and relational numerical analyses, just focusing on their distinctive aspects. This would help to narrow the gap between theoretical and practical contents in static analysis courses, bringing the learning experience beyond the rudimentary implementation of static analyses to more sophisticated applications.

show abstract

Teaching Through Practice: Advanced Static Analysis with LiSA

Negrini,

Arceri,

Olivieri

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Non-numerical weakly relational domains

Seidl,

Erhard,

Tilscher

et al. 2024

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

The weakly relational domain of Octagons offers a decent compromise between precision and efficiency for numerical properties. Here, we are concerned with the construction of non-numerical relational domains. We provide a general construction of weakly relational domains, which we exemplify with an extension of constant propagation by disjunctions. Since for the resulting domain of 2-disjunctive formulas satisfiability is NP-complete, we provide a general construction for a further, more abstract, weakly relational domain where the abstract operations of restriction and least upper bound can be efficiently implemented. In the second step, we consider a relational domain that tracks conjunctions of inequalities between variables, and between variables and constants for arbitrary partial orders of values. Examples are sub(multi)sets, as well as prefix, substring or scattered substring orderings on strings. When the partial order is a lattice, we provide precise polynomial algorithms for satisfiability, restriction, and the best abstraction of disjunction. Complementary to the constructions for lattices, we find that, in general, satisfiability of conjunctions is NP-complete. We therefore again provide polynomial abstract versions of restriction, conjunction, and join. By using our generic constructions, these domains are extended to weakly relational domains that additionally track disjunctions. For all our domains, we indicate how abstract transformers for assignments and guards can be constructed.

show abstract