Lars-Åke Fredlund

Lars-Åke Fredlund

Auto-generated profile, based on publicly available information

Lars-Åke Fredlund

Universidad Politécnica de Madrid

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2007
Verified
Conference Paper
Open access
PDF file
LFLars-Åke Fredlund
Lars-Åke Fredlund
HSHans Svensson
Hans Svensson
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the language is by now being seen as a very capable platform for developing industrial strength distributed applications with excellent failure tolerance characteristics. In contrast to most other Erlang verification attempts, we provide support for a very substantial part of the language. The model checker has full Erlang data type support, support for general process communication, node semantics (inter-process behave subtly different from intra-process communication), fault detection and fault tolerance through process linking, and can verify programs written using the OTP Erlang component library (used by most modern Erlang programs). As the model checking tool is itself implemented in Erlang we benefit from the advantages that a (dynamically typed) functional programming language offers: easy prototyping and experimentation with new verification algorithms, rich executable models that use complex data structures directly programmed in Erlang, the ability to treat executable models interchangeably as programs (to be executed directly by the Erlang interpreter) and data, and not least the possibility to cleanly structure and to cleanly combine various verification sub-tasks. In the paper we discuss the design of the tool and provide early indications on its performance.

30 September 2010
Verified
Conference Paper
Open access
PDF file
HSHans Svensson
Hans Svensson
LFLars-Åke Fredlund
Lars-Åke Fredlund
CBClara Benac-Earle
Clara Benac-Earle

1 August 2003 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
LFLars–Åke Fredlund
Lars–Åke Fredlund
DGDilian Gurov
Dilian Gurov
TNThomas Noll
Thomas Noll
MDMads Dam
Mads Dam
TAThomas Arts
Thomas Arts
GCGennady Chugunov
Gennady Chugunov

15 May 1997 in Theoretical Computer Science
Verified
Journal Article
Closed access
LFLars-Åke Fredlund
Lars-Åke Fredlund
Jan Friso GrooteJan Friso Groote
Jan Friso Groote
HKHenri Korver
Henri Korver

11 July 2016
Verified
Conference Paper
Open access
CEClara Benac Earle
Clara Benac Earle
LFLars-Åke Fredlund
Lars-Åke Fredlund
JHJohn Hughes
John Hughes
We present a framework for automatic grading of programming exercises using property-based testing, a form of model-based black-box testing. Models are developed to assess both the functional behaviour of programs and their algorithmic complexity. From the functional correctness model a large number of test cases are derived automatically. Executing them on the body of exercises gives rise to a (partial) ranking of programs, so that a program A is ranked higher than program B if it fails a strict subset of the test cases failed by B. The model for algorithmic complexity is used to compute worst-case complexity bounds. The framework moreover considers code structural metrics, such as McCabe's cyclomatic complexity, giving rise to a composite program grade that includes both functional, non-functional, and code structural aspects. The framework is evaluated in a course teaching algorithms and data structures using Java.

5 October 2007
Verified
Conference Paper
Open access
PDF file
HSHans Svensson
Hans Svensson
LFLars-Åke Fredlund
Lars-Åke Fredlund