Travelled to:
1 × Austria
1 × Japan
1 × The Netherlands
1 × USA
2 × Denmark
2 × France
2 × Germany
2 × Spain
2 × United Kingdom
Collaborated with:
J.Giesl M.Dam H.Svensson U.Eklund T.Noll ∅ H.Zantema K.Claessen C.B.Earle J.Derrick N.Smallbone J.Hughes L.Fredlund D.Gurov J.Svenningsson U.Norell M.H.Palka U.T.Wiger
Talks about:
erlang (7) termin (4) verifi (3) system (3) distribut (2) descript (2) program (2) automat (2) semant (2) depend (2)
Person: Thomas Arts
DBLP: Arts:Thomas
Facilitated 2 volumes:
Contributed to:
Wrote 15 papers:
- FASE-2014-SvenningssonSSANH #semantics
- An Expressive Semantics of Mocking (JS, HS, NS, TA, UN, JH), pp. 385–399.
- ECSA-2010-EklundA #architecture #classification
- A Classification of Value for Software Architecture Decisions (UE, TA), pp. 368–375.
- ICFP-2009-ClaessenPSHSAW #erlang #quickcheck
- Finding race conditions in Erlang with QuickCheck and PULSE (KC, MHP, NS, JH, HS, TA, UTW), pp. 149–160.
- FATES-2004-ArtsCS #development #erlang #fault tolerance #protocol
- Semi-formal Development of a Fault-Tolerant Leader Election Protocol in Erlang (TA, KC, HS), pp. 140–154.
- FME-2002-ArtsED #case study #erlang #verification
- Verifying Erlang Code: A Resource Locker Case-Study (TA, CBE, JD), pp. 184–203.
- IFL-2000-ArtsN #erlang #implementation #verification
- Verifying Generic Erlang Client-Server Implementations (TA, TN), pp. 37–52.
- RTA-2000-Arts #dependence
- System Description: The Dependency Pair Method (TA), pp. 261–264.
- CSL-1999-ArtsG #erlang #process #verification
- Applying Rewriting Techniques to the Verification of Erlang Processes (TA, JG), pp. 96–110.
- FM-v1-1999-ArtsD #database #distributed #erlang #verification
- Verifying a Distributed Database Lookup Manager Written in Erlang (TA, MD), pp. 682–700.
- CADE-1998-ArtsDFG #distributed #erlang #source code #verification
- System Description: Verification of Distributed Erlang Programs (TA, MD, LÅF, DG), pp. 38–41.
- RTA-1998-ArtsG #composition #dependence #termination #using
- Modularity of Termination Using Dependency pairs (TA, JG), pp. 226–240.
- RTA-1997-ArtsG #automation #normalisation #proving
- Proving Innermost Normalisation Automatically (TA, JG), pp. 157–171.
- RTA-1996-ArtsG #termination
- Termination of Constructor Systems (TA, JG), pp. 63–77.
- LOPSTR-1995-ArtsZ #logic programming #semantics #source code #termination #unification #using
- Termination of Logic Programs Using Semantic Unification (TA, HZ), pp. 219–233.
- TAPSOFT-1997-ArtsG #automation #order #proving #termination
- Automatically Proving Termination Where Simplification Orderings Fail (TA, JG), pp. 261–272.