Iniciativa IMDEA
Resumen: As the adoption of SOA grows in enterprises and businesses and more and more complex information systems are reworked or...
Resumen: Coding rules are often used in industry to codify software best practises and avoid the many hazardous constructions pre...
Resumen: Co-Logic Programming (co-LP) is a paradigm recently introduced that combines both inductive and coinductive logic progra...
Resumen: Decompiling low-level code to a high-level intermediate representation facilitates the development of analyzers, model c...
Resumen: Church numerals are a functional encoding of natural numbers. In the pure (untyped) lambda calculus, the definition of c...
Resumen: Machine learning (ML) is essentially the field of identifying functions from observed data. For example, we can model re...
Resumen: Program verification environments increasingly rely on hybrid methods that combine static analyses and verification cond...
Resumen: Specification and Verification of imperative programs that manipulate mutable data structures has always been a challeng...
Resumen: The G12 project aims to allow one to model a combinatorial optimization problem in a high level way, independent of the ...
Resumen: Many constraint problems have a considerable number of symmetries. Detecting and breaking these symmetries is a very act...
Resumen: I will be presesting the paper “Discovering Properties about Arrays in Simple Programs” by Nicolas Halbwachs...
Resumen: Due to lack of speaker, I’ll try to improvise a short talk about functional programming and the algebra of program...
Resumen: The standard method to prove confluence of term rewriting system (TRS) is based on the study of joinability of critical ...
Resumen: Writing a language processor from scratch is a daunting task; it requires knowledge of specialised techniques and a cons...
Resumen: Classic techniques for proving termination of a given loop require the identification of a measure (ranking function) th...
Resumen: Existing algorithms for on-line partial evaluation (PE) of logic programs, given an initial program and a description of...
Resumen: Originating from the work of De Morgan (150 years ago!), CSS Peirce and Schröder, and getting its present equational for...
Resumen: Type arithmetic (or type-level computations) are calculations over types. Haskell lacks type-level lambdas and thus, one...
Resumen: In this presentation I will start by giving a brief introduction to the field of Diagrammatic Reasoning. Then I will pre...
Resumen: As two Manuels recently said, Wikipedia pages are never as precise as you want. Yet, probably, most of Wikipedia accesse...
Resumen: In this talk we will report on our experience on using the so-called model-driven security approach in an MDA industrial...
Resumen: Garbage collection (GC) is a form of automatic memory management. The garbage collector, or just collector, attempts to ...
Resumen: Wadler coined the name Expression Problem for the problem of extending data and functions on that data in modular and ty...
Resumen: I will talk about regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability ...
