default search action
Luca Paolini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c29]Matteo Palazzo, Luca Paolini, Luca Roversi, Margherita Zorzi:
Host-Core Calculi for Non-classical Computations: A First Insight. ICTCS 2024: 255-268 - 2023
- [j20]Ferruccio Damiani, Reiner Hähnle, Eduard Kamburjan
, Michael Lienhardt, Luca Paolini
Variability modules. J. Syst. Softw. 195: 111510 (2023) - [c28]Ferruccio Damiani
Deltas for Functional Programs with Algebraic Data Types. SPLC (A) 2023: 52-63 - 2022
- [j19]Maurice H. ter Beek
Efficient static analysis and verification of featured transition systems. Empir. Softw. Eng. 27(1): 10 (2022) - [j18]Maurice H. ter Beek
FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC. Sci. Comput. Program. 224: 102879 (2022) - [j17]Ferruccio Damiani, Michael Lienhardt, Luca Paolini
On logical and extensional characterizations of attributed feature models. Theor. Comput. Sci. 912: 56-80 (2022) - [d5]Ferruccio Damiani
Variability Modules for Java-like Languages (Artifact). Zenodo, 2022 - [d4]Ferruccio Damiani
Variability Modules for Java-like Languages (Artifact). Zenodo, 2022 - [i5]Ferruccio Damiani, Luca Paolini, Luca Roversi:
Programming the Interaction with Quantum Coprocessors. ERCIM News 2022(128) (2022) - 2021
- [c27]Armando B. Matos, Luca Paolini
Splitting Recursion Schemes into Reversible and Classical Interacting Threads. RC 2021: 204-213 - [c26]Ferruccio Damiani, Reiner Hähnle, Eduard Kamburjan
Variability modules for Java-like languages. SPLC (A) 2021: 1-12 - [c25]Maurice H. ter Beek, Franco Mazzanti, Ferruccio Damiani, Luca Paolini
Static analysis and family-based model checking of featured transition systems with VMC. SPLC (B) 2021: 24-27 - [c24]Maurice H. ter Beek, Franco Mazzanti, Ferruccio Damiani, Luca Paolini
Static analysis and family-based model checking with VMC. SPLC (A) 2021: 214 - [d3]Ferruccio Damiani
Variability Modules for Java-like Languages (Artifact). Zenodo, 2021 - [d2]Ferruccio Damiani
Variability Modules for Java-like Languages (Artifact). Zenodo, 2021 - [d1]Ferruccio Damiani
Variability Modules for Java-like Languages (Artifact). Zenodo, 2021 - [i4]Armando B. Matos, Luca Paolini, Luca Roversi:
Interleaving classical and reversible. CoRR abs/2102.09436 (2021) - [i3]Armando B. Matos, Luca Paolini, Luca Roversi:
Splitting recursion schemes into reversible and classical interacting threads. CoRR abs/2105.04910 (2021) - 2020
- [j16]Armando B. Matos, Luca Paolini
The fixed point problem of a simple reversible language. Theor. Comput. Sci. 813: 143-154 (2020) - [j15]Luca Paolini
A class of Recursive Permutations which is Primitive Recursive complete. Theor. Comput. Sci. 813: 218-233 (2020) - [c23]Ferruccio Damiani
On Two Characterizations of Feature Models. ICTAC 2020: 103-122 - [c22]Ferruccio Damiani
On Slicing Software Product Line Signatures. ISoLA (1) 2020: 81-102 - [c21]Armando B. Matos, Luca Paolini
On the Expressivity of Total Reversible Programming Languages. RC 2020: 128-143
2010 – 2019
- 2019
- [j14]Luca Paolini
QPCF: Higher-Order Languages and Quantum Circuits. J. Autom. Reason. 63(4): 941-966 (2019) - [j13]Maurice H. ter Beek
On the expressiveness of modal transition systems with variability constraints. Sci. Comput. Program. 169: 1-17 (2019) - [j12]Ferruccio Damiani, Michael Lienhardt, Luca Paolini
A formal model for Multi Software Product Lines. Sci. Comput. Program. 172: 203-231 (2019) - [j11]Ferruccio Damiani, Michael Lienhardt, Luca Paolini
Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form. Int. J. Softw. Tools Technol. Transf. 21(6): 691-707 (2019) - [c20]Maurice H. ter Beek
Summary of: On the Expressiveness of Modal Transition Systems with Variability Constraints. IFM 2019: 542-546 - [c19]Maurice H. ter Beek, Ferruccio Damiani, Michael Lienhardt, Franco Mazzanti, Luca Paolini
Static analysis of featured transition systems. SPLC (A) 2019: 9:1-9:13 - 2018
- [j10]Luca Paolini
On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions. New Gener. Comput. 36(3): 233-256 (2018) - [c18]Armando B. Matos, Luca Paolini, Luca Roversi:
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. ICTCS 2018: 128-139 - [c17]Michael Lienhardt, Ferruccio Damiani, Simone Donetti, Luca Paolini
Multi Software Product Lines in the Wild. VaMoS 2018: 89-96 - [c16]Luca Paolini
Quantum programming made easy. Linearity-TLLA@FLoC 2018: 133-147 - [i2]Luca Paolini, Mauro Piccolo, Margherita Zorzi:
QPCF: higher order languages and quantum circuits. CoRR abs/1809.05723 (2018) - 2017
- [j9]Giulio Guerrieri
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. Log. Methods Comput. Sci. 13(4) (2017) - [j8]Luca Paolini
Essential and relational models. Math. Struct. Comput. Sci. 27(5): 626-650 (2017) - [c15]Ferruccio Damiani
A Formal Model for Multi SPLs. FSEN 2017: 67-83 - [c14]Luca Paolini
qPCF: A Language for Quantum Circuit Computations. TAMC 2017: 455-469 - 2016
- [j7]Marco Gaboardi
On the reification of semantic linearity. Math. Struct. Comput. Sci. 26(5): 829-867 (2016) - [i1]Giulio Guerrieri, Luca Paolini, Simona Ronchi Della Rocca:
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus. CoRR abs/1611.07255 (2016) - 2015
- [c13]Maurice H. ter Beek
From Featured Transition Systems to Modal Transition Systems with Variability Constraints. SEFM 2015: 344-359 - [c12]Giulio Guerrieri
Standardization of a Call-By-Value Lambda-Calculus. TLCA 2015: 211-225 - [c11]Luca Paolini
A Certified Study of a Reversible Programming Language. TYPES 2015: 7:1-7:21 - [c10]Luca Paolini
A Class of Reversible Primitive Recursive Functions. ICTCS 2015: 227-242 - 2013
- [e1]Stéphane Graham-Lengrand, Luca Paolini
Proceedings Sixth Workshop on Intersection Types and Related Systems, ITRS 2012, Dubrovnik, Croatia, 29th June 2012. EPTCS 121, 2013 [contents] - 2012
- [j6]Silvia Ghilezan
Preface. Fundam. Informaticae 121(1-4) (2012) - [c9]Beniamino Accattoli, Luca Paolini
Call-by-Value Solvability, Revisited. FLOPS 2012: 4-16 - 2011
- [j5]Luca Paolini
Strong normalization from an unusual point of view. Theor. Comput. Sci. 412(20): 1903-1915 (2011) - [c8]Marco Gaboardi
Linearity and PCF: a semantic insight! ICFP 2011: 372-384
2000 – 2009
- 2009
- [c7]Luca Paolini
Logical Semantics for Stability. MFPS 2009: 429-449 - 2008
- [j4]Luca Paolini
Parametric lambda -theories. Theor. Comput. Sci. 398(1-3): 51-62 (2008) - [c6]Luca Paolini
Semantically linear programming languages. PPDP 2008: 97-107 - [c5]Luca Paolini
A Process-Model for Linear Programs. TYPES 2008: 289-305 - 2006
- [j3]Luca Paolini
A stable programming language. Inf. Comput. 204(3): 339-375 (2006) - [c4]Luca Paolini
An Operational Characterization of Strong Normalization. FoSSaCS 2006: 367-381 - 2004
- [b2]Luca Paolini:
Lambda]-theories. University of Genoa, Italy, 2004 - [b1]Simona Ronchi Della Rocca, Luca Paolini
The Parametric Lambda Calculus - A Metamodel for Computation. Texts in Theoretical Computer Science. An EATCS Series, Springer 2004, ISBN 978-3-642-05746-5, pp. 1-254 - [j2]Luca Paolini
Parametric parameter passing Lambda-calculus. Inf. Comput. 189(1): 87-106 (2004) - [c3]Luca Paolini
Lazy Strong Normalization. ITRS 2004: 103-116 - 2003
- [c2]Luca Paolini
Lazy Logical Semantics. COMETA 2003: 235-251 - 2001
- [c1]Luca Paolini
Call-by-Value Separability and Computability. ICTCS 2001: 74-89
1990 – 1999
- 1999
- [j1]Luca Paolini
Call-by-value Solvability. RAIRO Theor. Informatics Appl. 33(6): 507-534 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: