Thomas Given-Wilson

Dr. Thomas Given-Wilson

Universite Catholique de Louvain
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 August 2019 in Computers & Security
Verified
Journal Article
Closed access
FBFabrizio Biondi
Fabrizio Biondi
MEMichael A. Enescu
Michael A. Enescu
TGThomas Given-Wilson
Thomas Given-Wilson
ALAxel Legay
Axel Legay
LNLamine Noureddine
Lamine Noureddine
VVVivek Verma
Vivek Verma

1 September 2011 in The Journal of Symbolic Logic
Verified
Journal Article
Closed access
PDF file
BJBarry Jay
Barry Jay
TGThomas Given-Wilson
Thomas Given-Wilson
Traditional combinatory logic uses combinators S and K to represent all Turing-computable functions on natural numbers, but there are Turing-computable functions on the combinators themselves that cannot be so represented, because they access internal structure in ways that S and K cannot. Much of this expressive power is captured by adding a factorisation combinator F. The resulting SF-calculus is structure complete, in that it supports all pattern-matching functions whose patterns are in normal form, including a function that decides structural equality of arbitrary normal forms. A general characterisation of the structure complete, confluent combinatory calculi is given along with some examples. These are able to represent all their Turing-computable functions whose domain is limited to normal forms. The combinator F can be typed using an existential type to represent internal type information.

27 June 2020 in Innovations in Systems and Software Engineering
Verified
Journal Article
Closed access
PDF file
TGThomas Given-Wilson
Thomas Given-Wilson
NJNisrine Jafri
Nisrine Jafri
ALAxel Legay
Axel Legay

25 July 2022 in Applied Soft Computing
Verified
Journal Article
Closed access
KDKhanh Huu The Dam
Khanh Huu The Dam
TGThomas Given-Wilson
Thomas Given-Wilson
ALAxel Legay
Axel Legay
RVRosana Veroneze
Rosana Veroneze

1 January 2010
Verified
Book Chapter
Open access
PDF file
TGThomas Given-Wilson
Thomas Given-Wilson
DGDaniele Gorla
Daniele Gorla
BJBarry Jay
Barry Jay
Concurrent pattern calculus drives interaction between processes by unifying patterns, just as sequential pattern calculus drives computation by matching a pattern against a data structure. By generalising from pattern matching to unification, interaction becomes symmetrical, with information flowing in both directions. This provides a natural language for describing any form of exchange or trade. Many popular process calculi can be encoded in concurrent pattern calculus.

14 September 2018 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Open access
PDF file
TGThomas Given-Wilson
Thomas Given-Wilson
AHAnnelie Heuser
Annelie Heuser
NJNisrine Jafri
Nisrine Jafri
ALAxel Legay
Axel Legay
Summary: Fault injection has increasingly been used both to attack software applications and to test system robustness. Detecting fault injection vulnerabilities has been approached with a variety of different but limited methods. This paper proposes an extension of a recently published general model checking based process to detect fault injection vulnerabilities in binaries. This new extension makes the general process scalable to real‐world implementations, which is demonstrated by detecting vulnerabilities in different cryptographic implementations.