Laboratoire d'analyse et de raisonnement automatisés
Laboratoire
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We derive a new expression for calculating the fields on the aperture of an impulse radiating antenna, fed by the coplanar TEM plates. The new expression avoids the use of Jacobi and inverse Jacobi functions of complex argument. ...
We present a detailed computation of the cyclic and the Hochschild homology and cohomology of generic and 3-Calabi–Yau homogeneous down–up algebras. This family was defined by Benkart and Roby in [3] in their study of differential posets. Our calculations ...
In this thesis, we explore techniques for the development and verification of programs in a high-level, expressive, and safe programming language. Our programs can express problems over unbounded domains and over recursive and mutable data structures. We p ...
The paper explores the city of Stockholm, apparently far from the main tracks of other significant European examples due to its peculiar morphological features. The study investigates the Stockholm Town Hall (Stadshuset) and the nearby never-to-be realized ...
Static estimation of resource utilisation of programs is a challenging and important problem with numerous applications. In this thesis, I present new algorithms that enable users to specify and verify their desired bounds on resource usage of functional p ...
We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...
Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...
We present a new approach for specifying and verifying resource utilization of higher-order functional programs that use lazy evaluation and memoization. In our approach, users can specify the desired resource bound as templates with numerical holes e.g. a ...
Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of verifying automaticall ...
IRGC’s guidelines for the governance of systemic risks addresses the question of how to deal with systemic risks in the context of system transitions, i.e., in situations that require adaptation to new context conditions or transformation of an organisatio ...
