Abstract Semantics for Alias Analysis in<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="double-struck">K</mml:mi></mml:math>

Asavoae, Irina Mariuca

doi:10.1016/j.entcs.2014.05.005

Cited by 5 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A similar technique exploiting regular behaviour of (non-concurrent) programs, in order to reason on "may aliasing", was previously introduced in [34]. In short, the results in [34] utilize abstract representations of programs in terms of finite pushdown systems, for which infinite execution paths have a regular structure (or are "lasso shaped") [35]. Then, in the style of abstract interpretation [36], the collecting semantics is applied over the (finite state) pushdown systems to obtain the alias analysis itself.…”

Section: Discussionmentioning

confidence: 99%

“…Then, in the style of abstract interpretation [36], the collecting semantics is applied over the (finite state) pushdown systems to obtain the alias analysis itself. The main difference with the results in [34] consists in how the abstract memory addresses corresponding to pointer variables are represented. In [34] these range over a finite set of natural numbers.…”

Section: Discussionmentioning

confidence: 99%

“…The main difference with the results in [34] consists in how the abstract memory addresses corresponding to pointer variables are represented. In [34] these range over a finite set of natural numbers. In this paper we consider alias expressions build according to the calculus in [18], based on program constructs.…”

Section: Discussionmentioning

confidence: 99%

“…As introduced in (18), an alias relation r ′ is a lasso of a relation r whenever there is a one-to-one correspondence between their elements as follows: before applying rule (34), is a lasso of…”

Section: The K-machinery By Examplementioning

confidence: 99%

“…Here ε stands for the empty alias expression. Moreover, according to rule (34), the lasso shaped by r 2 and r 4 also causes the (otherwise infinite) recursive calls to stop, as call f (l) is eliminated from the top of the k-cell. Hence, the rewriting process finishes with a sound over-approximation reg(r 2 , r 4 ) replacing the current alias relation (cf.…”

Section: The K-machinery By Examplementioning

confidence: 99%

See 4 more Smart Citations

On the verification of SCOOP programs

Caltais

Meyer

2017

Science of Computer Programming

View full text Add to dashboard Cite

In this paper we focus on the development of a toolbox for the verification of programs in the context of SCOOP -an elegant concurrency model, recently formalized based on Rewriting Logic (RL) and Maude. SCOOP is implemented in Eiffel and its applicability is demonstrated also from a practical perspective, in the area of robotics programming. Our contribution consists in devising and integrating an alias analyzer and a Coffman deadlock detector under the roof of the same RL-based semantic framework of SCOOP. This enables using the Maude rewriting engine and its LTL model-checker "for free", in order to perform the analyses of interest. We discuss the limitations of our approach for model-checking deadlocks and provide solutions to the state explosion problem. The latter is mainly caused by the size of the SCOOP formalization which incorporates all the aspects of a real concurrency model. On the aliasing side, we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions such as infinite loops and recursive calls. Moreover, we devise a corresponding executable specification easily implementable on top of the SCOOP formalization. An important property of our extension is that, in non-concurrent settings, the corresponding alias expressions can be over-approximated in terms of a notion of regular expressions. This further enables us to derive an algorithm that always stops and provides a sound over-approximation of the "may aliasing" information, where soundness stands for the lack of false negatives.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: The K-machinery By Examplementioning

confidence: 99%

Section: The K-machinery By Examplementioning

confidence: 99%

See 3 more Smart Citations

On the verification of SCOOP programs

Caltais

Meyer

2017

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

Expression-Based Aliasing for OO–languages

Caltais

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. Alias analysis has been an interesting research topic in verification and optimization of programs. The undecidability of determining whether two expressions in a program may reference to the same object is the main source of the challenges raised in alias analysis. In this paper we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions such as infinite loops and recursive calls. Moreover, we devise a corresponding executable specification in the K-framework. An important property of our extension is that, in a non-concurrent setting, the corresponding alias expressions can be over-approximated in terms of a notion of regular expressions. This further enables us to show that the associated K-machinery implements an algorithm that always stops and provides a sound over-approximation of the "may aliasing" information, where soundness stands for the lack of false negatives. As a case study, we analyze the integration and further applications of the alias calculus in SCOOP. The latter is an object-oriented programming model for concurrency, recently formalized in Maude; K definitions can be compiled into Maude for execution.

show abstract

From Rewriting Logic, to Programming Language Semantics, to Program Verification

Roşu

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract Semantics for Alias Analysis inK

Cited by 5 publications

References 7 publications

On the verification of SCOOP programs

On the verification of SCOOP programs

Expression-Based Aliasing for OO–languages

From Rewriting Logic, to Programming Language Semantics, to Program Verification

Contact Info

Product

Resources

About