Výsledky vyhledávání - "Luca Paolini"

Akademický článek

Autor: Luca Paolini, Luca Roversi, Margherita Zorzi

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 292, Iss Proc. Linearity-TLLA 2018, Pp 133-147 (2019)

We present IQu, namely a quantum programming language that extends Reynold's Idealized Algol, the paradigmatic core of Algol-like languages. IQu combines imperative programming with high-order features, mediated by a simple type theory. IQu mildly me

Externí odkaz: https://doaj.org/article/ad162643f9954d44af5857502ea3934b

Zobrazit plný text záznamu

Akademický článek

Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus

Autor: Giulio Guerrieri, Luca Paolini, Simona Ronchi Della Rocca

Publikováno v: Logical Methods in Computer Science, Vol Volume 13, Issue 4 (2017)

We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-value normal forms from the calculus, so that it enjoys elegant characteri

Externí odkaz: https://doaj.org/article/14e8bf56cd514b79907557b535829134

Zobrazit plný text záznamu

A class of Recursive Permutations which is Primitive Recursive complete

Autor: Luca Roversi, Mauro Piccolo, Luca Paolini

Publikováno v: Theoretical Computer Science. 813:218-233

We focus on total functions in the theory of reversible computational models. We define a class of recursive permutations, dubbed Reversible Primitive Permutations ( RPP ) which are computable invertible total endo-functions on integers, so a subset

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf11f3fefb1ba0931ace33b4479ff7b2
https://doi.org/10.1016/j.tcs.2019.11.029

Zobrazit plný text záznamu

Efficient static analysis and verification of featured transition systems

Autor: Franco Mazzanti, Maurice H. ter Beek, Luca Paolini, Michael Lienhardt, Ferruccio Damiani

Publikováno v: Empirical software engineering (Online) 27 (2022). doi:10.1007/s10664-020-09930-8
info:cnr-pdr/source/autori:ter Beek M.H.; Damiani F.; Lienhardt M.; Mazzanti F.; Paolini L./titolo:Efficient static analysis and verification of featured transition systems/doi:10.1007%2Fs10664-020-09930-8/rivista:Empirical software engineering (Online)/anno:2022/pagina_da:/pagina_a:/intervallo_pagine:/volume:27

A Featured Transition System (FTS) models the behaviour of all products of a Software Product Line (SPL) in a single compact structure, by associating action-labelled transitions with features that condition their presence in product behaviour. It ma

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aff399b0783eef5849edbc716de8c6c9
https://openportal.isti.cnr.it/doc?id=people______::b0fc0a1e270d834c9f969267700c3a48

Zobrazit plný text záznamu

FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC

Autor: Maurice H. ter Beek, Ferruccio Damiani, Michael Lienhardt, Franco Mazzanti, Luca Paolini, Giordano Scarso

Publikováno v: Science of computer programming
224 (2022). doi:10.1016/j.scico.2022.102879

FTS4VMC is a publicly available front-end tool for the static analysis and family-based model checking of a Featured Transition System (FTS). It can detect ambiguities in an FTS, disambiguate an ambiguous FTS, transform an FTS into a Modal Transition

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f485529d2a65554360efcfbcdf36ab94
https://hdl.handle.net/2318/1882860

Zobrazit plný text záznamu

Variability modules

Autor: Ferruccio Damiani, Reiner Hähnle, Eduard Kamburjan, Michael Lienhardt, Luca Paolini

Publikováno v: Journal of Systems and Software. 195:111510

A Software Product Line (SPL) is a family of similar programs, called variants, generated from a common artifact base. A Multi SPL (MPL) is a set of interdependent SPLs: each variant can depend on variants from other SPLs. MPLs are challenging to mod

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85f842870f9130bb29cd5a30ab433e17
https://doi.org/10.1016/j.jss.2022.111510

Zobrazit plný text záznamu

Static analysis and family-based model checking of featured transition systems with VMC

Autor: Franco Mazzanti, Luca Paolini, Michele Valfrè, Giordano Scarso, Michael Lienhardt, Ferruccio Damiani, Maurice H. ter Beek

Publikováno v: SPLC (B)
SPLC'21-25th ACM International Systems and Software Product Line Conference, pp. 24–27, Leicester, UK, 06-10/09/2021
info:cnr-pdr/source/autori:ter Beek M.H.; Mazzanti F.; Damiani F.; Paolini L.; Scarso G.; Valfrè M.; Lienhardt M./congresso_nome:SPLC'21-25th ACM International Systems and Software Product Line Conference/congresso_luogo:Leicester, UK/congresso_data:06-10%2F09%2F2021/anno:2021/pagina_da:24/pagina_a:27/intervallo_pagine:24–27

A Featured Transition System (FTS) is a formalism for modeling variability in configurable system behavior. The behavior of all variants (products) is modeled in a single compact FTS by associating the possibility to perform an action and transition

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2962abda4c9ab35f83e444467805007
https://doi.org/10.1145/3461002.3473071

Zobrazit plný text záznamu

Static analysis and family-based model checking with VMC

Autor: Maurice H. ter Beek, Franco Mazzanti, Giordano Scarso, Luca Paolini, Michael Lienhardt, Ferruccio Damiani

Publikováno v: SPLC '21: Proceedings of the 25th ACM International Systems and Software Product Line Conference-Volume A
SPLC '21: 25th ACM International Systems and Software Product Line Conference
SPLC '21: 25th ACM International Systems and Software Product Line Conference, Sep 2021, Leicester, United Kingdom. pp.214-214, ⟨10.1145/3461001.3472732⟩
SPLC (A)
SPLC'21-25th International Systems and Software Product Line Conference, pp. 214–214, Leicester, UK, 06-10/09/2021
info:cnr-pdr/source/autori:ter Beek M.H.; Mazzanti F.; Damiani F.; Paolini L.; Scarso G.; Lienhardt M./congresso_nome:SPLC'21-25th International Systems and Software Product Line Conference/congresso_luogo:Leicester, UK/congresso_data:06-10%2F09%2F2021/anno:2021/pagina_da:214/pagina_a:214/intervallo_pagine:214–214

International audience; VMC is a research tool for model checking variability-rich behavioural models specified as a modal transition system (MTS) with variability constraints (MTSu). In this tutorial, we introduce a tool chain built on VMC that allo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c23ce26126805177def82eeba516dbb
https://hal.archives-ouvertes.fr/hal-03377758

Zobrazit plný text záznamu

QPCF: Higher-Order Languages and Quantum Circuits

Autor: Mauro Piccolo, Margherita Zorzi, Luca Paolini

Publikováno v: Journal of Automated Reasoning. 63:941-966

qPCF is a paradigmatic quantum programming language that extends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be duplicated and manipulated in flexible ways by means of a dependent type

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f0ffc497ae02b19db48fc77f7ed441f
https://doi.org/10.1007/s10817-019-09518-y

Zobrazit plný text záznamu

Splitting recursion schemes into reversible and classical interacting threads

Autor: Armando B. Matos, Luca Roversi, Luca Paolini

Publikováno v: Reversible Computation ISBN: 9783030798369
RC

Given a simple recursive function, we show how to extract from it a reversible and an classical iterative part. Those parts can synchronously cooperate under a Producer/Consumer pattern in order to implement the original recursive function. The rever

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1160ff8afc0db99376c022d7780d18bf

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání