1. Larsake Fredlund
2. Semantics

. Part of the book series (LNCS, volume 8974) Abstract The concurrent functional language Erlang has a number of distinguishing features, like dynamic typing, concurrency via asynchronous message passing or hot code loading, that make it especially appropriate for distributed, fault-tolerant, soft real-time applications.

We propose an extension to Fredlund's formal semantics for Erlang that models the concept of. Clara Benac Earle, A unified semantics for future Erlang. The formal semantics of Erlang is a bit too complicated to be easily understandable. Much of this complication stems from the desire to accurately model the current.

In this paper, we introduce a symbolic execution technique for Erlang. We discuss how both an overapproximation and an underapproximation of the concrete semantics can be obtained.

We illustrate our approach through some examples. To the best of our knowledge, this is the first attempt to formalize symbolic execution in the context of this language, where previous approaches have only considered exploring different schedulings but have not dealt with symbolic data.

Abstract Erlang is an actor-based programming ud language used extensively for building concurrent, reactive ud systems that are highly available and suff er minimum ud downtime. Such systems are often mission critical, making ud system correctness vital.

Refactoring is code restructuring ud that improves the code but does not change ud behaviour. While using automated refactoring tools is ud less error-prone than performing refactorings manually, ud automated refactoring tools still cannot guarantee that ud the refactoring is correct, i.e., program behaviour is preserved.

Ud This leads to lack of trust in automated refactoring ud tools. We rst survey solutions to this problem ud proposed in the literature. Erlang refactoring tools as ud commonly use approximation techniques which do not ud guarantee behaviour while some other works propose the ud use of formal methodologies. In this work we aim to ud develop a formal methodology for refactoring Erlang ud code. We study behavioural preorders, with a special focus ud on the testing preorder as it seems most suited to ud our purpose.peer-reviewe. Citations.

(2001). A Framework for Reasoning about Erlang Code (Doctoral dissertation, Royal Institute of Technology,. (2007).

A more accurate semantics for distributed erlang. A semantics for distributed Erlang. A survey of software refactoring. A theory of testing for asynchronous concurrent systems (Doctoral dissertation). A unified semantics for future Erlang.

Actor Frameworks for the JVM Platform: A Comparative Analysis. Actors in Scala - Concurrent programming for the multi-core era. An Actor Algebra for Specifying Distributed Systems: the Hurried Philosophers Case Study. Objectoriented program. Petri nets, lect.

Notes comput. An Algebra of Actors. Automatic refactoring of Erlang programs. Formal methods to aid the evolution of software. Formalisation of Haskell refactorings. Trends Funct.

Larsake Fredlund

How we refactor, and how we know it. Making Program Refactoring Safer. Mechanical verification of refactorings. On the Integration of the Actor Model in Mainstream Technologies: The Scala Perspective. Paraphrasing: Generating Parallel Programs Using Refactoring.

Semantics

Programmer-Friendly Refactoring Tools. QuickCheck testing for fun and profit. Quickchecking refactoring tools. Refactoring Object-oriented Frameworks (Doctoral dissertation,.

(2008). Refactoring with Wrangler, updated: data and process refactorings, and integration with eclipse. Refactoring: Current research and future trends. Software and the Concurrency Revolution.

Synthesising Correct Concurrent Runtime Monitors - (Extended Abstract). In Rv. (1984). Testing equivalences for processes. Testing Erlang Refactorings with QuickCheck. Testing Erlang Refactorings with QuickCheck. Testing Theories for Asynchronous Languages.

In Fsttcs. (2001). The Linear Time-Branching Time Spectrum I - The Semantics of Concrete, Sequential Processes. Process algebr.