The SCEAS System
Navigation Menu

Search the dblp DataBase


Thomas Arts: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  28. Testing telecoms software with quviq QuickCheck. [Citation Graph (, )][DBLP]

  29. Automatic testing of TCP/IP implementations using QuickCheck. [Citation Graph (, )][DBLP]

  30. Model based testing of data constraints: testing the business logic of a Mnesia application with Quviq QuickCheck. [Citation Graph (, )][DBLP]

  31. Testing Erlang data types with quviq quickcheck. [Citation Graph (, )][DBLP]

  32. Finding race conditions in Erlang with QuickCheck and PULSE. [Citation Graph (, )][DBLP]

  33. A Classification of Value for Software Architecture Decisions. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002