2024
Efficient Algorithm for Proportional Lumpability and Its Application to Selfish Mining in Public Blockchains.
Algorithms, April, 2024
Quantum encoding of dynamic directed graphs.
J. Log. Algebraic Methods Program., January, 2024
Inferring Markov Chains to Describe Convergent Tumor Evolution With CIMICE.
IEEE ACM Trans. Comput. Biol. Bioinform., 2024
Compressing neural networks via formal methods.
Neural Networks, 2024
Classical computation over quantum architectures.
J. Log. Comput., 2024
AI-enhanced blockchain technology: A review of advancements and opportunities.
J. Netw. Comput. Appl., 2024
Vulnerability Detection in Ethereum Smart Contracts via Machine Learning: A Qualitative Analysis.
CoRR, 2024
Speeding up Answer Set Programming by Quantum Computing.
Proceedings of the 2024 Workshop on Quantum Search and Information Retrieval, 2024
Cosmos discovery: Quantitative assessment of Cosmos blockchain.
Proceedings of the 32nd International Conference on Modeling, 2024
Towards a Computational Approach to Quantification of Allele Specific Expression at Population Level.
Proceedings of the Bioinformatics and Biomedical Engineering, 2024
Under the Space Threat: Quantitative Analysis of Cosmos Blockchain.
Proceedings of the Computer Performance Engineering - 20th European Workshop, 2024
Noninterference Analysis for Smart Contracts: Would you Bet on it?
Proceedings of the Sixth Distributed Ledger Technology Workshop (DLT 2024), 2024
2023
Adaptive Directions for Bernstein-Based Polynomial Set Evolution.
Proceedings of the Reachability Problems - 17th International Conference, 2023
Graph-Theoretical Arguments in Support of a Quantum Declarative Manifesto.
Proceedings of the 38th Italian Conference on Computational Logic, 2023
An ASP Approach for the Synthesis of CNOT Minimal Quantum Circuits.
Proceedings of the 38th Italian Conference on Computational Logic, 2023
Set-Based Invariants over Polynomial Systems.
Proceedings of the 38th Italian Conference on Computational Logic, 2023
Synthesis of CNOT minimal quantum circuits with topological constraints through ASP.
Proceedings of the International Workshop on AI for Quantum and Quantum for AI (AIQxQIA 2023) co-located with 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), November 6, 2023
2022
Parameter synthesis of polynomial dynamical systems.
Inf. Comput., 2022
WGA-LP: a pipeline for whole genome assembly of contaminated reads.
Bioinform., 2022
Proportional lumpability and proportional bisimilarity.
Acta Informatica, 2022
Directed Graph Encoding in Quantum Computing Supporting Edge-Failures.
Proceedings of the Reversible Computation - 14th International Conference, 2022
Mirrors and Memory in Quantum Automata.
Proceedings of the Quantitative Evaluation of Systems - 19th International Conference, 2022
Neural Networks Reduction via Lumping.
Proceedings of the AIxIA 2022 - Advances in Artificial Intelligence, 2022
2021
<i>D</i>_<i>PSNI</i>: Delimited persistent stochastic non-interference.
Theor. Comput. Sci., 2021
Persistent Stochastic Non-Interference.
Fundam. Informaticae, 2021
Reasoning About Proportional Lumpability.
Proceedings of the Quantitative Evaluation of Systems - 18th International Conference, 2021
2019
Set-Based Analysis for Biological Modeling.
Proceedings of the Automated Reasoning for Systems Biology and Medicine, 2019
Delimited Persistent Stochastic Non-Interference.
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools, 2019
A Process Algebra for (Delimited) Persistent Stochastic Non-Interference.
Proceedings of the Quantitative Evaluation of Systems, 16th International Conference, 2019
Proportional Lumpability.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2019
2018
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses.
Inf. Comput., 2018
Persistent Stochastic Non-Interference.
Proceedings of the Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics, 2018
Information Flow Security for Stochastic Processes.
Proceedings of the Computer Performance Engineering - 15th European Workshop, 2018
2017
Games, Automata, Logics and Formal Verification (GandALF 2014) - Preface.
Inf. Comput., 2017
Reachability computation for polynomial dynamical systems.
Formal Methods Syst. Des., 2017
Verifying Quantum Programs: From Quipper to QPMC.
CoRR, 2017
Efficient Computation of Renaming Functions for ρ-reversible Discrete and Continuous Time Markov Chains.
Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, 2017
\mathtt Entangλ Entang λ e: A Translation Framework from Quipper Programs to Quantum Markov Chains.
Proceedings of the New Frontiers in Quantitative Methods in Informatics, 2017
2016
Towards Quantum Programs Verification: From Quipper Circuits to QPMC.
Proceedings of the Reversible Computation - 8th International Conference, 2016
Parallelotope Bundles for Polynomial Reachability.
Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control, 2016
2015
Unwinding biological systems.
Theor. Comput. Sci., 2015
Rank and simulation: the well-founded case.
J. Log. Comput., 2015
Is Hyper-extensionality Preservable Under Deletions of Graph Elements?
Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015
Parameter Synthesis Through Temporal Logic Specifications.
Proceedings of the FM 2015: Formal Methods, 2015
2014
ϵ-Semantics computations on biological systems.
Inf. Comput., 2014
Parameter Synthesis Using Parallelotopic Enclosure and Applications to Epidemic Models.
Proceedings of the Hybrid Systems Biology, 2014
External Interactions on Hybrid Models of Biological Systems.
Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014
Hyper-Extensionality and One-Node Elimination on Membership Graphs.
Proceedings of the 29th Italian Conference on Computational Logic, 2014
2013
A graph-theoretic approach to map conceptual designs to XML schemas.
ACM Trans. Database Syst., 2013
Approximated Symbolic Computations over Hybrid Automata.
Proceedings of the Proceedings Third International Workshop on Hybrid Autonomous Systems, 2013
Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, 2013
2012
Hybrid Automata and ε-Analysis on a Neural Oscillator
Proceedings of the Proceedings First International Workshop on Hybrid Systems and Biology, 2012
Model Checking on Hybrid Automata.
Proceedings of the 15th Euromicro Conference on Digital System Design, 2012
Rank-Based Simulation on Acyclic Graphs.
Proceedings of the 9th Italian Convention on Computational Logic, 2012
2010
Hybrid automata, reachability, and Systems Biology.
Theor. Comput. Sci., 2010
Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD).
Fundam. Informaticae, 2010
From Entity Relationship to XML Schema: a Graph-Theoretic Approach (Extended Abstract).
Proceedings of the Eighteenth Italian Symposium on Advanced Database Systems, 2010
2009
Discrete Semantics for Hybrid Automata.
Discret. Event Dyn. Syst., 2009
From Entity Relationship to XML Schema: A Graph-Theoretic Approach.
Proceedings of the Database and XML Technologies, 6th International XML Database Symposium, 2009
2008
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets.
ACM Trans. Comput. Log., 2008
Inclusion dynamics hybrid automata.
Inf. Comput., 2008
External Control in Process Algebra for Systems Biology.
Proceedings of the Second International Meeting on Membrane Computing and Biologically Inspired Process Calculi, 2008
Hybrid Automata in Systems Biology: How Far Can We Go?
Proceedings of the Second Workshop From Biology to Concurrency and Back, 2008
Symbolic Graphs: Linear Solutions to Connectivity Related Problems.
Algorithmica, 2008
Systems Biology: Models and Logics.
Proceedings of the Logic Programming, 24th International Conference, 2008
Decidable Compositions of O-Minimal Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2008
PicNIc - Pi-calculus non-interference checker.
Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008
2007
Compositional information flow security for concurrent programs.
J. Comput. Secur., 2007
Action Refinement in Process Algebra and Security Issues.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007
Composing Semi-algebraic O-Minimal Automata.
Proceedings of the Hybrid Systems: Computation and Control, 10th International Workshop, 2007
Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction.
Proceedings of the Algebraic Biology, Second International Conference, 2007
2005
Information flow in secure contexts.
J. Comput. Secur., 2005
Semi-Algebraic Constant Reset Hybrid Automata - SACoRe.
Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005
Algorithmic Algebraic Model Checking I: Challenges from Systems Biology.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005
Algorithmic Algebraic Model Checking II: Decidability of Semi-algebraic Model Checking and Its Applications to Systems Biology.
Proceedings of the Automated Technology for Verification and Analysis, 2005
2004
Ackermann Encoding, Bisimulations, and OBDDs.
Theory Pract. Log. Program., 2004
An efficient algorithm for computing bisimulation equivalence.
Theor. Comput. Sci., 2004
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice.
Theor. Comput. Sci., 2004
Disunification in <i>ACI</i>1 Theories.
Constraints An Int. J., 2004
Nesting analysis of mobile ambients.
Comput. Lang. Syst. Struct., 2004
Verifying persistent security properties.
Comput. Lang. Syst. Struct., 2004
CoPS - Checker of Persistent Security.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004
Unwinding Conditions for Security in Imperative Languages.
Proceedings of the Logic Based Program Synthesis and Transformation, 2004
Modelling Downgrading in Information Flow Security.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004
2003
The Subgraph Bisimulation Problem.
IEEE Trans. Knowl. Data Eng., 2003
Simulating polyadic modal logics by monadic ones.
J. Symb. Log., 2003
From Bisimulation to Simulation: Coarsest Partition Problems.
J. Autom. Reason., 2003
Checking Integrity via CoPS and Banana: the E-Commerce Case Study .
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003
Behind BANANA: Design and Implementation of a Tool for Nesting Analysis of Mobile Ambients.
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003
Unwinding in Information Flow Security.
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003
Complexity of Nesting Analysis in Mobile Ambients.
Proceedings of the Verification, 2003
Bisimulation and Unwinding for Verifying Possibilistic Security Properties.
Proceedings of the Verification, 2003
BANANA - A Tool for Boundary Ambients Nesting ANAlysis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003
Computing strongly connected components in a linear number of symbolic steps.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Refinement Operators and Information Flow Security.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003
Information Flow Security and Recursive Systems.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003
Secure Contexts for Confidential Data.
Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003
Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing.
Proceedings of the Computational Methods in Systems Biology, First International Workshop, 2003
2002
Simulation Reduction as Constraint.
Proceedings of the 11th International Workshop on Functional and (Constraint) Logic Programming, 2002
Rank-Based Symbolic Bisimulation (and Model Checking).
Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002
Proofs Methods for Bisimulation Based Information Flow Security.
Proceedings of the Verification, 2002
Simulation as Coarsest Partition Problem.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002
A Proof System for Information Flow Security.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002
Transforming Processes to Check and Ensure Information Flow Security.
Proceedings of the Algebraic Methodology and Software Technology, 2002
2001
A Fast Bisimulation Algorithm.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001
Deciding modal logics using tableaux and set theory.
Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001
2000
Sets and constraint logic programming.
ACM Trans. Program. Lang. Syst., 2000
Multiset Constraints and P Systems.
Proceedings of the Multiset Processing, 2000
Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000
1999
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999
Comparing expressiveness of set constructor symbols.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999
1998
On the Representation and Management of Finite Sets in CLP Languages.
Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998
Narrowing the Gap between Set-Constraints and CLP(SET)-Constraints.
Proceedings of the 1998 Joint Conference on Declarative Programming, 1998