Carla Piazza

Acta Informatica, 2022

Directed Graph Encoding in Quantum Computing Supporting Edge-Failures.

[BibT_eX]

[DOI]

Davide Della Giustina

Brian Riccardi

Riccardo Romanello

Proceedings of the Reversible Computation - 14th International Conference, 2022

Mirrors and Memory in Quantum Automata.

[BibT_eX]

[DOI]

Riccardo Romanello

Proceedings of the Quantitative Evaluation of Systems - 19th International Conference, 2022

Neural Networks Reduction via Lumping.

[BibT_eX]

[DOI]

Proceedings of the AIxIA 2022 - Advances in Artificial Intelligence, 2022

2021

D_PSNI: Delimited persistent stochastic non-interference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Persistent Stochastic Non-Interference.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Reasoning About Proportional Lumpability.

[BibT_eX]

[DOI]

Proceedings of the Quantitative Evaluation of Systems - 18th International Conference, 2021

2019

Set-Based Analysis for Biological Modeling.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning for Systems Biology and Medicine, 2019

Delimited Persistent Stochastic Non-Interference.

[BibT_eX]

[DOI]

Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools, 2019

A Process Algebra for (Delimited) Persistent Stochastic Non-Interference.

[BibT_eX]

[DOI]

Proceedings of the Quantitative Evaluation of Systems, 16th International Conference, 2019

Proportional Lumpability.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Persistent Stochastic Non-Interference.

[BibT_eX]

[DOI]

Jane Hillston

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.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Engineering - 15th European Workshop, 2018

2017

Games, Automata, Logics and Formal Verification (GandALF 2014) - Preface.

[BibT_eX]

[DOI]

Adriano Peron

Inf. Comput., 2017

Reachability computation for polynomial dynamical systems.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2017

Verifying Quantum Programs: From Quipper to QPMC.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Computation of Renaming Functions for ρ-reversible Discrete and Continuous Time Markov Chains.

[BibT_eX]

[DOI]

Matteo Sottana

Andrea Albarelli

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.

[BibT_eX]

[DOI]

Proceedings of the New Frontiers in Quantitative Methods in Informatics, 2017

2016

Towards Quantum Programs Verification: From Quipper Circuits to QPMC.

[BibT_eX]

[DOI]

Proceedings of the Reversible Computation - 8th International Conference, 2016

Parallelotope Bundles for Polynomial Reachability.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control, 2016

2015

Unwinding biological systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Rank and simulation: the well-founded case.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

Is Hyper-extensionality Preservable Under Deletions of Graph Elements?

[BibT_eX]

[DOI]

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Parameter Synthesis Through Temporal Logic Specifications.

[BibT_eX]

[DOI]

Proceedings of the FM 2015: Formal Methods, 2015

2014

ϵ-Semantics computations on biological systems.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Parameter Synthesis Using Parallelotopic Enclosure and Applications to Epidemic Models.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems Biology, 2014

External Interactions on Hybrid Models of Biological Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014

Hyper-Extensionality and One-Node Elimination on Membership Graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th Italian Conference on Computational Logic, 2014

2013

A graph-theoretic approach to map conceptual designs to XML schemas.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2013

Approximated Symbolic Computations over Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third International Workshop on Hybrid Autonomous Systems, 2013

Contextual lumpability.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, 2013

2012

Hybrid Automata and ε-Analysis on a Neural Oscillator

[BibT_eX]

[DOI]

Proceedings of the Proceedings First International Workshop on Hybrid Systems and Biology, 2012

Model Checking on Hybrid Automata.

[BibT_eX]

[DOI]

Proceedings of the 15th Euromicro Conference on Digital System Design, 2012

Rank-Based Simulation on Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 9th Italian Convention on Computational Logic, 2012

2010

Hybrid automata, reachability, and Systems Biology.

[BibT_eX]

[DOI]

Dario Campagna

Theor. Comput. Sci., 2010

Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD).

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

From Entity Relationship to XML Schema: a Graph-Theoretic Approach (Extended Abstract).

[BibT_eX]

Proceedings of the Eighteenth Italian Symposium on Advanced Database Systems, 2010

2009

Discrete Semantics for Hybrid Automata.

[BibT_eX]

[DOI]

Discret. Event Dyn. Syst., 2009

From Entity Relationship to XML Schema: A Graph-Theoretic Approach.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Gianfranco Rossi

ACM Trans. Comput. Log., 2008

Inclusion dynamics hybrid automata.

[BibT_eX]

[DOI]

Inf. Comput., 2008

External Control in Process Algebra for Systems Biology.

[BibT_eX]

[DOI]

Filippo Del Tedesco

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?

[BibT_eX]

[DOI]

Dario Campagna

Proceedings of the Second Workshop From Biology to Concurrency and Back, 2008

Symbolic Graphs: Linear Solutions to Connectivity Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 2008

Systems Biology: Models and Logics.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 24th International Conference, 2008

Decidable Compositions of O-Minimal Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2008

PicNIc - Pi-calculus non-interference checker.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008

2007

Compositional information flow security for concurrent programs.

[BibT_eX]

[DOI]

J. Comput. Secur., 2007

Action Refinement in Process Algebra and Security Issues.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

Composing Semi-algebraic O-Minimal Automata.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Biology, Second International Conference, 2007

2005

Information flow in secure contexts.

[BibT_eX]

[DOI]

J. Comput. Secur., 2005

Semi-Algebraic Constant Reset Hybrid Automata - SACoRe.

[BibT_eX]

[DOI]

Bud Mishra

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Venkatesh Mysore

Bud Mishra

Proceedings of the Automated Technology for Verification and Analysis, 2005

2004

Ackermann Encoding, Bisimulations, and OBDDs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2004

An efficient algorithm for computing bisimulation equivalence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Disunification in ACI1 Theories.

[BibT_eX]

[DOI]

Enrico Pontelli

Constraints An Int. J., 2004

Nesting analysis of mobile ambients.

[BibT_eX]

[DOI]

Comput. Lang. Syst. Struct., 2004

Verifying persistent security properties.

[BibT_eX]

[DOI]

Comput. Lang. Syst. Struct., 2004

CoPS - Checker of Persistent Security.

[BibT_eX]

[DOI]

Enrico Pivato

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Unwinding Conditions for Security in Imperative Languages.

[BibT_eX]

[DOI]

Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Modelling Downgrading in Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003

The Subgraph Bisimulation Problem.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2003

Simulating polyadic modal logics by monadic ones.

[BibT_eX]

[DOI]

George Goguadze

Yde Venema

J. Symb. Log., 2003

From Bisimulation to Simulation: Coarsest Partition Problems.

[BibT_eX]

[DOI]

J. Autom. Reason., 2003

Checking Integrity via CoPS and Banana: the E-Commerce Case Study .

[BibT_eX]

[DOI]

Chiara Braghin

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.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

Unwinding in Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

Complexity of Nesting Analysis in Mobile Ambients.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2003

Bisimulation and Unwinding for Verifying Possibilistic Security Properties.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2003

BANANA - A Tool for Boundary Ambients Nesting ANAlysis.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Refinement Operators and Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

Information Flow Security and Recursive Systems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Secure Contexts for Confidential Data.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003

Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing.

[BibT_eX]

[DOI]

Proceedings of the Computational Methods in Systems Biology, First International Workshop, 2003

2002

Simulation Reduction as Constraint.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Functional and (Constraint) Logic Programming, 2002

Rank-Based Symbolic Bisimulation (and Model Checking).

[BibT_eX]

[DOI]

Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002

Proofs Methods for Bisimulation Based Information Flow Security.

[BibT_eX]

[DOI]

Riccardo Focardi

Proceedings of the Verification, 2002

Simulation as Coarsest Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

A Proof System for Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Transforming Processes to Check and Ensure Information Flow Security.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2002

2001

A Fast Bisimulation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 13th International Conference, 2001

Deciding modal logics using tableaux and set theory.

[BibT_eX]

[DOI]

Proceedings of the APPIA-GULP-PRODE 2001: Joint Conference on Declarative Programming, 2001

2000

Sets and constraint logic programming.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2000

Multiset Constraints and P Systems.

[BibT_eX]

[DOI]

Gianfranco Rossi

Proceedings of the Multiset Processing, 2000

Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

1999

ACI1 Constraints.

[BibT_eX]

Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Comparing expressiveness of set constructor symbols.

[BibT_eX]

Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998

On the Representation and Management of Finite Sets in CLP Languages.

[BibT_eX]

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

Narrowing the Gap between Set-Constraints and CLP(SET)-Constraints.

[BibT_eX]