Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Thomsen, Michael Kirkedal"'
Autor:
Thomsen, Michael Kirkedal
This PhD dissertation investigates garbage-free reversible computing systems from abstract design to physical gate-level implementation. Designed in reversible logic, we propose a ripple-block carry adder and work towards a reversible circuit for gen
Externí odkaz:
http://arxiv.org/abs/2309.11832
Autor:
Gashi, Triera, Bosio, Sophie Adeline Solheim, Kristensen, Joachim Tilsted, Thomsen, Michael Kirkedal
Property-based testing is a powerful method to validate program correctness. It is, however, not widely use in industry as the barrier of entry can be very high. One of the hindrances is to write the generators that are needed to generate randomised
Externí odkaz:
http://arxiv.org/abs/2309.04696
Tail recursive functions allow for a wider range of optimisations than general recursive functions. For this reason, much research has gone into the transformation and optimisation of this family of functions, in particular those written in continuat
Externí odkaz:
http://arxiv.org/abs/2302.10049
When the inverse of an algorithm is well-defined -- that is, when its output can be deterministically transformed into the input producing it -- we say that the algorithm is invertible. While one can describe an invertible algorithm using a general-p
Externí odkaz:
http://arxiv.org/abs/2212.03161
Algorithms are ways of mapping problems to solutions. An algorithm is invertible precisely when this mapping is injective, such that the initial problem can be uniquely inferred from its solution. While invertible algorithms can be described in gener
Externí odkaz:
http://arxiv.org/abs/2209.02422
We investigate the subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindromic circuits. We precisely determine which self-inverse functions can b
Externí odkaz:
http://arxiv.org/abs/1502.05825
Publikováno v:
In Journal of Systems Architecture 2008 54(7):697-706
Publikováno v:
Norsk Informatikkonferanse; 2022, Issue 1, p1-14, 14p
Publikováno v:
Schordan, M, Oppelstrup, T, Thomsen, M K & Glück, R 2020, Reversible languages and incremental state saving in optimistic parallel discrete event simulation . in I Ulidowski, I Lanese, U P Schultz & C Ferreira (eds), Reversible Computation : Extending Horizons of Computing-Selected Results of the COST Action IC1405 . Springer VS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12070 LNCS, pp. 187-207, 12th International Conference on Reversible Computation, RC 2020, Oslo, Norway, 09/07/2020 . https://doi.org/10.1007/978-3-030-47361-7_9
Optimistic parallel discrete event simulation (PDES) requires to do a distributed rollback if conflicts are detected during a simulation due to the massively parallel optimistic execution approach. When a rollback of a simulation is performed each no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2751::248999a90dd49ed5b123059b44029c34
https://curis.ku.dk/portal/da/publications/reversible-languages-and-incremental-state-saving-in-optimistic-parallel-discrete-event-simulation(8d617103-2d96-41a1-85c2-ac8f7cbbc109).html
https://curis.ku.dk/portal/da/publications/reversible-languages-and-incremental-state-saving-in-optimistic-parallel-discrete-event-simulation(8d617103-2d96-41a1-85c2-ac8f7cbbc109).html