Sfoglia per Autore
Deltas for Functional Programs with Algebraic Data Types
2023-01-01 Damiani F.; Kamburjan E.; Lienhardt M.; Paolini L.
Variability modules
2023-01-01 Damiani F.; Hahnle R.; Kamburjan E.; Lienhardt M.; Paolini L.
FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC
2022-01-01 ter Beek M.H.; Damiani F.; Lienhardt M.; Mazzanti F.; Paolini L.; Scarso G.
On logical and extensional characterizations of attributed feature models
2022-01-01 Damiani F.; Lienhardt M.; Paolini L.
Efficient static analysis and verification of featured transition systems
2022-01-01 ter Beek M.H.; Damiani F.; Lienhardt M.; Mazzanti F.; Paolini L.
Splitting Recursion Schemes into Reversible and Classical Interacting Threads
2021-01-01 Armando Matos; Paolini Luca; Roversi Luca
Variability modules for Java-like languages
2021-01-01 Damiani F.; Hahnle R.; Kamburjan E.; Lienhardt M.; Paolini L.
Static analysis and family-based model checking with VMC
2021-01-01 Ter Beek M.H.; Mazzanti F.; Damiani F.; Paolini L.; Scarso G.; Lienhardt M.
Static analysis and family-based model checking of featured transition systems with VMC
2021-01-01 Beek M.H.T.; Mazzanti F.; Damiani F.; Paolini L.; Scarso G.; Valfre M.; Lienhardt M.
On Two Characterizations of Feature Models
2020-01-01 Damiani F.; Lienhardt M.; Paolini L.
On Slicing Software Product Line Signatures
2020-01-01 Damiani F.; Lienhardt M.; Paolini L.
The fixed point problem of a simple reversible language
2020-01-01 Armando Matos, Luca Paolini, Luca Roversi
On the Expressivity of Total Reversible Programming Languages
2020-01-01 Matos A.B.; Paolini L.; Roversi L.
A class of Recursive Permutations which is Primitive Recursive complete
2020-01-01 Paolini L.; Piccolo M.; Roversi L.
Static analysis of featured transition systems
2019-01-01 Ter Beek M.H.; Damiani F.; Lienhardt M.; Mazzanti F.; Paolini L.
Summary of: On the Expressiveness of Modal Transition Systems with Variability Constraints
2019-01-01 ter Beek M.H.; Damiani F.; Gnesi S.; Mazzanti F.; Paolini L.
A formal model for Multi Software Product Lines
2019-01-01 Damiani, Ferruccio; Lienhardt, Michael; Paolini, Luca
QPCF: Higher-Order Languages and Quantum Circuits
2019-01-01 Paolini L.; Piccolo M.; Zorzi M.
On the expressiveness of modal transition systems with variability constraints
2019-01-01 ter Beek, Maurice H.*; Damiani, Ferruccio; Gnesi, Stefania; Mazzanti, Franco; Paolini, Luca
Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form
2019-01-01 Damiani F.; Lienhardt M.; Paolini L.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Deltas for Functional Programs with Algebraic Data Types | 2023 | Damiani F.; Kamburjan E.; Lienhardt M.; Paolini L. | |
Variability modules | 2023 | Damiani F.; Hahnle R.; Kamburjan E.; Lienhardt M.; Paolini L. | |
FTS4VMC: A front-end tool for static analysis and family-based model checking of FTSs with VMC | 2022 | ter Beek M.H.; Damiani F.; Lienhardt M.; Mazzanti F.; Paolini L.; Scarso G. | |
On logical and extensional characterizations of attributed feature models | 2022 | Damiani F.; Lienhardt M.; Paolini L. | |
Efficient static analysis and verification of featured transition systems | 2022 | ter Beek M.H.; Damiani F.; Lienhardt M.; Mazzanti F.; Paolini L. | |
Splitting Recursion Schemes into Reversible and Classical Interacting Threads | 2021 | Armando Matos; Paolini Luca; Roversi Luca | |
Variability modules for Java-like languages | 2021 | Damiani F.; Hahnle R.; Kamburjan E.; Lienhardt M.; Paolini L. | |
Static analysis and family-based model checking with VMC | 2021 | Ter Beek M.H.; Mazzanti F.; Damiani F.; Paolini L.; Scarso G.; Lienhardt M. | |
Static analysis and family-based model checking of featured transition systems with VMC | 2021 | Beek M.H.T.; Mazzanti F.; Damiani F.; Paolini L.; Scarso G.; Valfre M.; Lienhardt M. | |
On Two Characterizations of Feature Models | 2020 | Damiani F.; Lienhardt M.; Paolini L. | |
On Slicing Software Product Line Signatures | 2020 | Damiani F.; Lienhardt M.; Paolini L. | |
The fixed point problem of a simple reversible language | 2020 | Armando Matos, Luca Paolini, Luca Roversi | |
On the Expressivity of Total Reversible Programming Languages | 2020 | Matos A.B.; Paolini L.; Roversi L. | |
A class of Recursive Permutations which is Primitive Recursive complete | 2020 | Paolini L.; Piccolo M.; Roversi L. | |
Static analysis of featured transition systems | 2019 | Ter Beek M.H.; Damiani F.; Lienhardt M.; Mazzanti F.; Paolini L. | |
Summary of: On the Expressiveness of Modal Transition Systems with Variability Constraints | 2019 | ter Beek M.H.; Damiani F.; Gnesi S.; Mazzanti F.; Paolini L. | |
A formal model for Multi Software Product Lines | 2019 | Damiani, Ferruccio; Lienhardt, Michael; Paolini, Luca | |
QPCF: Higher-Order Languages and Quantum Circuits | 2019 | Paolini L.; Piccolo M.; Zorzi M. | |
On the expressiveness of modal transition systems with variability constraints | 2019 | ter Beek, Maurice H.*; Damiani, Ferruccio; Gnesi, Stefania; Mazzanti, Franco; Paolini, Luca | |
Automatic refactoring of delta-oriented SPLs to remove-free form and replace-free form | 2019 | Damiani F.; Lienhardt M.; Paolini L. |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile