Carla Piazza

According to our database1, Carla Piazza authored at least 84 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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 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 in System Design, 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
Is Hyper-extensionality Preservable Under Deletions of Graph Elements?
Electr. Notes Theor. Comput. Sci., 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

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

Contextual lumpability.
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. Inform., 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
External Control in Process Algebra for Systems Biology.
Electr. Notes Theor. Comput. Sci., 2009

Hybrid Automata in Systems Biology: How Far Can We Go?
Electr. Notes Theor. Comput. Sci., 2009

Discrete Semantics for Hybrid Automata.
Discrete Event Dynamic Systems, 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

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.
Journal of Computer Security, 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.
Journal of Computer Security, 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.
TPLP, 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

Checking Integrity via CoPS and Banana: the E-Commerce Case Study .
Electr. Notes Theor. Comput. Sci., 2004

Behind BANANA: Design and Implementation of a Tool for Nesting Analysis of Mobile Ambients.
Electr. Notes Theor. Comput. Sci., 2004

Unwinding in Information Flow Security.
Electr. Notes Theor. Comput. Sci., 2004

Disunification in ACI1 Theories.
Constraints, 2004

Nesting analysis of mobile ambients.
Computer Languages, Systems & Structures, 2004

Verifying persistent security properties.
Computer Languages, Systems & Structures, 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. Reasoning, 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.
Electr. Notes Theor. Comput. Sci., 2002

Rank-Based Symbolic Bisimulation (and Model Checking).
Electr. Notes Theor. Comput. Sci., 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

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

Comparing Expressiveness of Set Constructor Symbols.
Proceedings of the Frontiers of Combining Systems, 2000

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

ACI1 constraints.
Proceedings of the 1999 Joint Conference on Declarative Programming, 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


  Loading...