| 2006 |
|---|
| 31 | EE | Thomas Arts,
John Hughes,
Joakim Johansson,
Ulf Wiger:
Testing telecoms software with quviq QuickCheck.
Erlang Workshop 2006: 2-10 |
| 2005 |
|---|
| 30 | EE | Hans Svensson,
Thomas Arts:
A new leader election implementation.
Erlang Workshop 2005: 35-39 |
| 29 | EE | Thomas Arts,
Jaco van de Pol:
Introductory paper.
STTT 7(3): 195-196 (2005) |
| 2004 |
|---|
| 28 | EE | Thomas Arts,
Clara Benac Earle,
Juan José Sánchez Penas:
Translating Erlang to µCRL.
ACSD 2004: 135-144 |
| 27 | EE | Thomas Arts,
Koen Claessen,
Hans Svensson:
Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang.
FATES 2004: 140-154 |
| 26 | EE | Thomas Arts,
Clara Benac Earle,
John Derrick:
Development of a verified Erlang program for resource locking.
STTT 5(2-3): 205-220 (2004) |
| 2003 |
|---|
| 25 | | Bjarne Däcker,
Thomas Arts:
Proceedings of the 2003 ACM SIGPLAN Workshop on Erlang, Uppsala, Sweden, August 29, 2003
ACM 2003 |
| 24 | | Ricardo Pena,
Thomas Arts:
Implementation of Functional Languages, 14th International Workshop, IFL 2002, Madrid, Spain, September 16-18, 2002, Revised Selected Papers
Springer 2003 |
| 23 | EE | Juan José Sánchez Penas,
Thomas Arts:
VoDkaV Tool: Model Checking for Extracting Global Scheduler Properties from Local Restrictions.
ACSD 2003: 247-248 |
| 22 | EE | Thomas Arts,
Wan Fokkink:
Preface.
Electr. Notes Theor. Comput. Sci. 80: (2003) |
| 21 | EE | Lars-Åke Fredlund,
Dilian Gurov,
Thomas Noll,
Mads Dam,
Thomas Arts,
Gennady Chugunov:
A verification tool for ERLANG.
STTT 4(4): 405-420 (2003) |
| 2002 |
|---|
| 20 | | Thomas Arts,
Markus Mohnen:
Implementation of Functional Languages, 13th International Workshop, IFL 2002 Stockholm, Sweden, September 24-26, 2001, Selected Papers
Springer 2002 |
| 19 | EE | Thomas Arts,
Lars-Åke Fredlund:
Trace analysis of Erlang programs.
Erlang Workshop 2002: 16-23 |
| 18 | EE | Thomas Arts,
Juan José Sánchez Penas:
Global scheduler properties derived from local restrictions.
Erlang Workshop 2002: 49-57 |
| 17 | EE | Thomas Arts,
Clara Benac Earle,
John Derrick:
Verifying Erlang Code: A Resource Locker Case-Study.
FME 2002: 184-203 |
| 16 | EE | Jürgen Giesl,
Thomas Arts,
Enno Ohlebusch:
Modular Termination Proofs for Rewriting Using Dependency Pairs.
J. Symb. Comput. 34(1): 21-58 (2002) |
| 15 | EE | Thomas Arts,
Lars-Åke Fredlund:
Trace analysis of Erlang programs.
SIGPLAN Notices 37(12): 18-24 (2002) |
| 2001 |
|---|
| 14 | EE | Thomas Arts,
Izak van Langevelde:
Correct Performance of Transaction Capabilities.
ACSD 2001: 35-42 |
| 13 | EE | Jürgen Giesl,
Thomas Arts:
Verification of Erlang Processes by Dependency Pairs.
Appl. Algebra Eng. Commun. Comput. 12(1/2): 39-72 (2001) |
| 2000 |
|---|
| 12 | EE | Thomas Arts,
Thomas Noll:
Verifying Generic Erlang Client-Server Implementations.
IFL 2000: 37-52 |
| 11 | | Thomas Arts:
System Description: The Dependency Pair Method.
RTA 2000: 261-264 |
| 10 | EE | Thomas Arts,
Jürgen Giesl:
Termination of term rewriting using dependency pairs.
Theor. Comput. Sci. 236(1-2): 133-178 (2000) |
| 1999 |
|---|
| 9 | | Thomas Arts,
Jürgen Giesl:
Applying Rewriting Techniques to the Verification of Erlang Processes.
CSL 1999: 96-110 |
| 8 | EE | Thomas Arts,
Mads Dam:
Verifying a Distributed Database Lookup Manager Written in Erlang.
World Congress on Formal Methods 1999: 682-700 |
| 1998 |
|---|
| 7 | EE | Thomas Arts,
Mads Dam,
Lars-Åke Fredlund,
Dilian Gurov:
System Description: Verification of Distributed Erlang Programs.
CADE 1998: 38-41 |
| 6 | EE | Thomas Arts,
Jürgen Giesl:
Modularity of Termination Using Dependency pairs.
RTA 1998: 226-240 |
| 1997 |
|---|
| 5 | | Thomas Arts,
Jürgen Giesl:
Proving Innermost Normalisation Automatically.
RTA 1997: 157-171 |
| 4 | | Thomas Arts,
Jürgen Giesl:
Automatically Proving Termination Where Simplification Orderings Fail.
TAPSOFT 1997: 261-272 |
| 1996 |
|---|
| 3 | | Thomas Arts:
Termination by Absence of Infinite Chains of Dependency Pairs.
CAAP 1996: 196-210 |
| 2 | | Thomas Arts,
Jürgen Giesl:
Termination of Constructor Systems.
RTA 1996: 63-77 |
| 1995 |
|---|
| 1 | | Thomas Arts,
Hans Zantema:
Termination of Logic Programs Using Semantic Unification.
LOPSTR 1995: 219-233 |
