Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Shape analysis for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information Processing Letters
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Validating firewalls using flow logics
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Formal Modeling of C. elegans Development: A Scenario-Based Approach
CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Model checking mobile ambients
Theoretical Computer Science
On abstract interpretation of mobile ambients
Information and Computation
Static analysis for systems biology
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Modeling and querying biomolecular interaction networks
Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Logical Analysis of Biological Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Theoretical Computer Science
Efficient, correct simulation of biological processes in the stochastic pi-calculus
CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
A new occurrence counting analysis for bioambients
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
A parametric model for the analysis of mobile ambients
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Decidable extensions of hennessy-milner logic
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Model checking biological systems described using ambient calculus
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
An analysis for proving temporal properties of biological systems
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
An Analysis for Causal Properties of Membrane Interactions
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
This paper concerns the application of formal methods to biological systems, modeled specifically in BioAmbients, a variant of the Mobile Ambients calculus. Following the semantic-based approach of abstract interpretation, we define a new static analysis that computes an abstract transition system. Our analysis has two main advantages with respect to the analyses appearing in the literature: (i) it is able to address temporal properties which are more general than invariant properties; (ii) it supports, by means of a particular labeling discipline, the validation of systems where several copies of an ambient may appear. We also design new weaker and more efficient analyses by means of simple widening operators.