Compiling for time predictability
Within the T-CREST project we work on hardware/software architectures and code-
generation strategies for time-predictable embedded and cyber-physical systems. In this …
generation strategies for time-predictable embedded and cyber-physical systems. In this …
Towards composable timing for real-time programs
Real-time software is increasing in size and complexity, precipitating the need for advanced
modeling and analysis capabilities early in the software development process. One …
modeling and analysis capabilities early in the software development process. One …
A machine-checked proof of the average-case complexity of quicksort in Coq
E Van der Weegen, J McKinna - … Workshop on Types for Proofs and …, 2008 - Springer
As a case-study in machine-checked reasoning about the complexity of algorithms in type
theory, we describe a proof of the average-case complexity of Quicksort in Coq. The proof …
theory, we describe a proof of the average-case complexity of Quicksort in Coq. The proof …
MOQA; unlocking the potential of compositional static average-case analysis
MP Schellekens - The Journal of Logic and Algebraic Programming, 2010 - Elsevier
Compositionality is the “golden key” to static analysis and plays a central role in static worst-
case time analysis. We show that compositionality, combined with the capacity for tracking …
case time analysis. We show that compositionality, combined with the capacity for tracking …
Approximating SP-orders through total preorders: incomparability and transitivity through permutations
We study finite partial orders and the concept of indistinguishability. In particular, we focus
on SP-orders. These orderings can be represented by means of Hasse diagrams and …
on SP-orders. These orderings can be represented by means of Hasse diagrams and …
Partial representations of orderings
In the present paper a new concept of representability is introduced, which can be applied to
not total and also to intransitive relations (semiorders in particular). This idea tries to …
not total and also to intransitive relations (semiorders in particular). This idea tries to …
A new approach on distributed systems: orderings and representability
AE Muguerza - arXiv preprint arXiv:2306.16888, 2023 - arxiv.org
In the present paper we propose a new approach ondistributed systems': the processes are
represented through total orders and the communications are characterized by means of …
represented through total orders and the communications are characterized by means of …
Running time of the Treapsort algorithm
D Early, M Schellekens - Theoretical Computer Science, 2013 - Elsevier
We analyse the running time of Treapsort, a sorting algorithm in the MOQA1 programming
language, which acts on treaps. We show that, using the 'partial permutation'model of …
language, which acts on treaps. We show that, using the 'partial permutation'model of …
An Approach to Distributed Systems from Orderings and Representability
A Estevan - Bulletin of the Iranian Mathematical Society, 2024 - Springer
In the present paper, we propose a new approach on 'distributed systems': the processes
are represented through total orders and the communications are characterized by means of …
are represented through total orders and the communications are characterized by means of …
Techno neuro pedagogy system: An instructional design methodology for customized online courses (virtual customized environment learning)
The Techno Neuro Pedagogy System (TNPS) is a systemic process with interrelated
activities that allows you to create environments that facilitate the mediation processes on …
activities that allows you to create environments that facilitate the mediation processes on …