| 2008 |
| 22 | EE | Thomas Bøgholm,
Henrik Kragh-Hansen,
Petur Olsen,
Bent Thomsen,
Kim Guldstrand Larsen:
Model-based schedulability analysis of safety critical hard real-time Java programs.
JTRES 2008: 106-114 |
| 21 | EE | Bent Thomsen:
Using On-Line Tutorials in Introductory IT Courses.
Reflections on the Teaching of Programming 2008: 68-74 |
| 2007 |
| 20 | EE | Martin Schoeberl,
Hans Sondergaard,
Bent Thomsen,
Anders P. Ravn:
A Profile for Safety Critical Java.
ISORC 2007: 94-101 |
| 19 | EE | Rene Hansen,
Bent Thomsen:
Using Weighted Graphs for Computationally Efficient WLAN Location Determination.
MobiQuitous 2007: 1-5 |
| 2001 |
| 18 | | Bent Thomsen,
Lone Leth Thomsen:
Towards Global Computations Guided by Concurrency Theory.
Current Trends in Theoretical Computer Science 2001: 460-468 |
| 1999 |
| 17 | EE | Pierpaolo Degano,
Corrado Priami,
Lone Leth,
Bent Thomsen:
Causality for Debugging Mobile Agents.
Acta Inf. 36(5): 335-374 (1999) |
| 1998 |
| 16 | | Bent Thomsen,
Lone Leth Thomsen:
Towards Global Computations Guided by Concurrency Theory.
Bulletin of the EATCS 66: 92-99 (1998) |
| 1996 |
| 15 | | Bent Thomsen,
Lone Leth,
Tsung-Min Kuo:
A Facile Tutorial.
CONCUR 1996: 278-298 |
| 14 | | Flemming Nielson,
Patrick Cousot,
Mads Dam,
Pierpaolo Degano,
Pierre Jouvelot,
Alan Mycroft,
Bent Thomsen:
Logical and Operational Methods in the Analysis of Programs and Systems.
LOMAPS 1996: 1-21 |
| 13 | | Pierpaolo Degano,
Corrado Priami,
Lone Leth,
Bent Thomsen:
Analysis of Facile Programs: A Case Study.
LOMAPS 1996: 345-369 |
| 12 | | Roberta Borgia,
Pierpaolo Degano,
Corrado Priami,
Lone Leth,
Bent Thomsen:
Understanding Mobile Agents via a Non-Interleaving Semantics for Facile.
SAS 1996: 98-112 |
| 11 | | Bent Thomsen:
Programming Languages, Analysis Tools, and Concurrency Theory.
ACM Comput. Surv. 28(4es): 57 (1996) |
| 1995 |
| 10 | | Roberto M. Amadio,
Lone Leth,
Bent Thomsen:
From a Concurrent Lambda-Calculus to the Pi-Calculus.
FCT 1995: 106-115 |
| 9 | | Lone Leth,
Bent Thomsen:
Some Facile Chemistry.
Formal Asp. Comput. 7(3): 314-328 (1995) |
| 8 | | Bent Thomsen:
A Theory of Higher Order Communicating Systems
Inf. Comput. 116(1): 38-57 (1995) |
| 1993 |
| 7 | | Jean-Marc Andreoli,
Lone Leth,
Remo Pareschi,
Bent Thomsen:
True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication.
TAPSOFT 1993: 182-198 |
| 6 | | Bent Thomsen:
Plain CHOCS: A Second Generation Calculus for Higher Order Processes.
Acta Inf. 30(1): 1-59 (1993) |
| 1992 |
| 5 | | Bent Thomsen,
Lone Leth,
Alessandro Giacalone:
Some Issues in the Semantics of Facile Distributed Programming.
REX Workshop 1992: 563-593 |
| 1991 |
| 4 | | Kim Guldstrand Larsen,
Bent Thomsen:
Partial Specifications and Compositional Verification.
Theor. Comput. Sci. 88(1): 15-32 (1991) |
| 1989 |
| 3 | | Bent Thomsen:
A Calculus of Higher Order Communicating Systems.
POPL 1989: 143-154 |
| 1988 |
| 2 | | Kim Guldstrand Larsen,
Bent Thomsen:
A Modal Process Logic
LICS 1988: 203-210 |
| 1 | | Kim Guldstrand Larsen,
Bent Thomsen:
Compositional Proofs by Partial Specification of Processes.
MFCS 1988: 414-423 |