Latest

• AI-enhanced blockchain technology: A review of advancements and opportunities
• Compressing neural networks via formal methods
• Efficient Algorithm for Proportional Lumpability and Its Application to Selfish Mining in Public Blockchains
• Quantum encoding of dynamic directed graphs
• Towards a Computational Approach to Quantification of Allele Specific Expression at Population Level
• Towards a Computational Approach to Quantification of Allele Specific Expression at Population Level
• Adaptive Directions for Bernstein-Based Polynomial Set Evolution
• An ASP Approach for the Synthesis of CNOT Minimal Quantum Circuits
• Draft genome sequences of 14 Lacticaseibacillus spp. strains, representatives of a collection of 200 strains
• Draft genome sequences of 14 Lacticaseibacillus spp. strains, representatives of a collection of 200 strains
• Graph-Theoretical Arguments in Support of a Quantum Declarative Manifesto
• Inferring Markov Chains to Describe Convergent Tumor Evolution With CIMICE
• Inferring Markov Chains to Describe Convergent Tumor Evolution With CIMICE
• LINC01605 Is a Novel Target of Mutant p53 in Breast and Ovarian Cancer Cell Lines
• LINC01605 Is a Novel Target of Mutant p53 in Breast and Ovarian Cancer Cell Lines
• Neural Networks Reduction via Lumping
• Set-Based Invariants over Polynomial Systems
• Synthesis of CNOT minimal quantum circuits with topological constraints through ASP
• A Conservative Approach for Describing Cancer Progression
• Directed Graph Encoding in Quantum Computing Supporting Edge-Failures
• Hybrid automata in systems biology
• Hybrid automata in systems biology
• Mirrors and Memory in Quantum Automata
• Parameter synthesis of polynomial dynamical systems
• WGA-LP: A pipeline for whole genome assembly of contaminated reads
• WGA-LP: A pipeline for whole genome assembly of contaminated reads
• 1781P Feasibility of an automated data solution for Binary Alignment Map (BAM) files generated through next generation sequencing (NGS) of circulating tumor DNA (ctDNA)
• D_PSNI: Delimited persistent stochastic non-interference
• Persistent Stochastic Non-Interference
• Proportional lumpability and proportional bisimilarity
• Reasoning About Proportional Lumpability
• A process algebra for (delimited) persistent stochastic non-interference
• Delimited persistent stochastic non-interference
• Proportional Lumpability
• Set-Based Analysis for Biological Modeling
• Entangλe: A Translation Framework from Quipper Programs to Quantum Markov Chains
• Information Flow Security for Stochastic Processes
• Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses
• Persistent stochastic non-interference
• Efficient Computation of Renaming Functions for ρ-reversibility Discrete and Continuous Time Markov Chains
• Games, Automata, Logics, and Formal Verification (GandALF2014) - Preface
• Reachability computation for polynomial dynamical systems
• Is Hyper-extensionality Preservable under Deletions of Graph Elements?
• Parallelotope bundles for polynomial reachability
• Towards quantum programs verification: from quipper circuits to QPMC
• Hybrid Systems Biology: Second International Workshop, HSB 2013 Taormina, Italy, September 2, 2013 and Third International Workshop, HSB 2014 Vienna, Austria, July 23–24, 2014 Revised Selected Papers
• Parameter Synthesis Through Temporal Logic Specifications
• Parameter Synthesis using Parallelotopic Enclosure and Applications to Epidemic Models
• Rank and simulation: the well-founded case
• Unwinding biological systems
• External Interactions on Hybrid Models of Biological Systems
• Formal Methods in Macro-Biology - First International Conference, FMMB 2014, Noumea, New Caledonia, September 22-24, 2014. Proceedings
• Hyper-Extensionality and One-Node Elimination on Membership Graphs
• Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014, Verona, Italy, September 10-12, 2014
• ϵ-Semantics computations on biological systems
• A graph-theoretic approach to map conceptual designs to XML schemas
• Approximated Symbolic Computations over Hybrid Automata
• Contextual Lumpability
• High-throughput trascriptome profiling of two peach chimeric genotypes
• Proceedings Second International Workshop on Hybrid Systems and Biology (HSB 2013), Taormina, Italy, 2nd September 2013
• Hybrid Automata and epsilon-Analysis on a Neural Oscillator
• Model Checking on Hybrid Automata: Theory and Application to Biological Systems
• Rank-Based Simulation on Acyclic Graphs
• Composing FOCoRe Hybrid Automata
• From entity relationship to XML Schema: A graph-theoretic approach (extended abstract)
• Hybrid automata, reachability, and Systems Biology
• Morphos Configuration Engine: the Core of a Commercial Configuration System in CLP(FD)
• Discrete Semantics for Hybrid Automata
• External Control in Process Algebra for Systems Biology
• From Entity Relationship to XML Schema: A Graph-Theoretic Approach
• Hybrid Automata in Systems Biology: How far can we go?
• A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
• Action Refinement in Process Algebra and Security Issues
• Decidable Compositions of O-Minimal Automata
• Discreteness, hybrid automata, and biology
• Inclusion dynamics hybrid automata
• Model Checking, Hybrid Automata, and Systems Biology
• PicNIc - Pi-calculus Non-Interference checker
• Symbolic Graphs: Linear Solutions to Connectivity Related Problems
• Systems Biology: Models and Logics
• Systems Biology: Models and Logics
• Compositional information flow security for concurrent programs
• Synchronized Product of Semi-Algebraic O-Minimal Hybrid Automata
• Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction
• Combining static and dynamic analysis for the verification of Information Flow Security in Concurrent Programs
• Exploiting Model Checking in Constraint-based Approaches to the Protein Folding.
• Tolque: A Tool for Algorithmic Algebraic Model Checking
• Algebraic Model Checking II: Decidability of Semi-Algebraic Model Checking and its Applications to Systems Biology
• Algorithmic Algebraic Model Checking I: Challenges from Systems Biology⋆
• Independent Dynamics Hybrid Automata in System Biology
• Information flow in secure contexts
• Semi-Algebraic Constant Reset Hybrid Automata - SACoRe
• Stability of Hybrid Systems and Related Questions from Systems Biology
• Unwinding Conditions for Security in Imperative Languages
• Ackermann Encodings, Bisimulations, and OBDDs
• An Efficient Algorithm for Computing Bisimulation Equivalence
• Behind Banana: Design and Implemantation of a Tool for Nesting Analysis of Mobile Ambients
• Checking Integrity via CoPS and Banana: the E-Commerce Case Study
• CoPS - Checker of Persistent Security
• Disunification in ACI1 Theories
• Modelling Downgrading in Information Flow Security
• Nesting Analysis of Mobile Ambients
• Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
• Unwinding in Information Flow Security
• Verifying Persistent Security Properties
• A Proof System for Information Flow Security
• A sense of life: computational and experimental investigations with models of biochemical and evolutionary processes
• BANANA - A Tool for Boundary Ambients Nesting ANAlysis
• Bisimulation and Unwinding for Verifying Possibilistic Security Properties
• Complexity of Nesting Analysis in Mobile Ambients
• Computing strongly connected components in a linear number of symbolic steps
• From Bisimulation to Simulation: Coarsest Partition Problems
• Information Flow Security and Recursive Systems
• Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing
• Refinement Operators and Information Flow Security
• Secure Contexts for Confidential Data
• Simulating Polyadic Modal Logics by Monadic Ones
• The Subgraph Bisimulation Problem
• Computing in Non Standard Set Theories
• Proofs Methods for Bisimulation Based Information Flow Security
• Rank-Based Symbolic Bisimulation (and Model Checking)
• Simulation as Coarsest Partition Problem
• Simulation Reduction as Constraint
• Transforming Processes to Check and Ensure Information Flow Security
• A Fast Bisimulation Algorithm
• Ackermann Encoding, Bisimulations, and OBDD's
• Multiset Constraints and P Systems
• Multiset rewriting by multiset constraint solving
• Comparing Expressiveness of Set Constructor Symbols
• Sets and Constraint Logic Programming
• Towards tableau-based decision procedures for non-well-founded fragments of set theory
• ACI1 Constraints
• On the Representation and Management of Finite Sets in CLP-languages