Luca Paolini

Orcid: 0000-0002-4126-0170

According to our database1, Luca Paolini authored at least 58 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Host-Core Calculi for Non-classical Computations: A First Insight.
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

2023
Variability modules.
J. Syst. Softw., 2023

Deltas for Functional Programs with Algebraic Data Types.
Proceedings of the 27th ACM International Systems and Software Product Line Conference, 2023

2022
Variability Modules for Java-like Languages (Artifact).
Dataset, July, 2022

Variability Modules for Java-like Languages (Artifact).
Dataset, February, 2022

On logical and extensional characterizations of attributed feature models.
Theor. Comput. Sci., 2022

FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC.
Sci. Comput. Program., 2022

Efficient static analysis and verification of featured transition systems.
Empir. Softw. Eng., 2022

Programming the Interaction with Quantum Coprocessors.
ERCIM News, 2022

2021
Variability Modules for Java-like Languages (Artifact).
Dataset, June, 2021

Variability Modules for Java-like Languages (Artifact).
Dataset, June, 2021

Variability Modules for Java-like Languages (Artifact).
Dataset, June, 2021

Interleaving classical and reversible.
CoRR, 2021

Variability modules for Java-like languages.
Proceedings of the SPLC '21: 25th ACM International Systems and Software Product Line Conference, 2021

Static analysis and family-based model checking of featured transition systems with VMC.
Proceedings of the SPLC '21: 25th ACM International Systems and Software Product Line Conference, 2021

Static analysis and family-based model checking with VMC.
Proceedings of the SPLC '21: 25th ACM International Systems and Software Product Line Conference, 2021

Splitting Recursion Schemes into Reversible and Classical Interacting Threads.
Proceedings of the Reversible Computation - 13th International Conference, 2021

2020
A class of Recursive Permutations which is Primitive Recursive complete.
Theor. Comput. Sci., 2020

The fixed point problem of a simple reversible language.
Theor. Comput. Sci., 2020

On the Expressivity of Total Reversible Programming Languages.
Proceedings of the Reversible Computation - 12th International Conference, 2020

On Slicing Software Product Line Signatures.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles, 2020

On Two Characterizations of Feature Models.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

2019
Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form.
Int. J. Softw. Tools Technol. Transf., 2019

A formal model for Multi Software Product Lines.
Sci. Comput. Program., 2019

On the expressiveness of modal transition systems with variability constraints.
Sci. Comput. Program., 2019

QPCF: Higher-Order Languages and Quantum Circuits.
J. Autom. Reason., 2019

Static analysis of featured transition systems.
Proceedings of the 23rd International Systems and Software Product Line Conference, 2019

Summary of: On the Expressiveness of Modal Transition Systems with Variability Constraints.
Proceedings of the Integrated Formal Methods - 15th International Conference, 2019

2018
On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions.
New Gener. Comput., 2018

Quantum programming made easy.
Proceedings of the Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2018

Multi Software Product Lines in the Wild.
Proceedings of the 12th International Workshop on Variability Modelling of Software-Intensive Systems, 2018

The Fixed Point Problem for General and for Linear SRL Programs is Undecidable.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017
Essential and relational models.
Math. Struct. Comput. Sci., 2017

Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus.
Log. Methods Comput. Sci., 2017

qPCF: A Language for Quantum Circuit Computations.
Proceedings of the Theory and Applications of Models of Computation, 2017

A Formal Model for Multi SPLs.
Proceedings of the Fundamentals of Software Engineering - 7th International Conference, 2017

2016
On the reification of semantic linearity.
Math. Struct. Comput. Sci., 2016

2015
A Class of Reversible Primitive Recursive Functions.
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

A Certified Study of a Reversible Programming Language.
Proceedings of the 21st International Conference on Types for Proofs and Programs, 2015

Standardization of a Call-By-Value Lambda-Calculus.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

From Featured Transition Systems to Modal Transition Systems with Variability Constraints.
Proceedings of the Software Engineering and Formal Methods - 13th International Conference, 2015

2012
Preface.
Fundam. Informaticae, 2012

Call-by-Value Solvability, Revisited.
Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011
Strong normalization from an unusual point of view.
Theor. Comput. Sci., 2011

Linearity and PCF: a semantic insight!
Proceedings of the Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, 2011

2009
Logical Semantics for Stability.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

2008
Parametric lambda -theories.
Theor. Comput. Sci., 2008

A Process-Model for Linear Programs.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

Semantically linear programming languages.
Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

2006
A stable programming language.
Inf. Comput., 2006

An Operational Characterization of Strong Normalization.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2004
The Parametric Lambda Calculus - A Metamodel for Computation
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-10394-4, 2004

Lambda]-theories.
PhD thesis, 2004

Parametric parameter passing Lambda-calculus.
Inf. Comput., 2004

Lazy Strong Normalization.
Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

2003
Lazy Logical Semantics.
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

2001
Call-by-Value Separability and Computability.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

1999
Call-by-value Solvability.
RAIRO Theor. Informatics Appl., 1999


  Loading...