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)
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
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
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
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
On abstract interpretation of mobile ambients
Information and Computation
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
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Theoretical Computer Science
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
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
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
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
Model-Checking markov chains in the presence of uncertainties
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of 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
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Probabilistic model checking of biological systems with uncertain kinetic rates
Theoretical Computer Science
Best probabilistic transformers
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Probabilistic abstract interpretation
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we apply the Abstract Interpretation approach [P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. Proc. of POPL'77, 238-252, 1977; P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. Proc. of POPL'79, 269-282, 1979] for approximating the behavior of biological systems, modeled specifically using the Chemical Ground Form calculus [L. Cardelli. On Process Rate Semantics. Theoretical Computer Science, 391 190-215, 2008], a new stochastic calculus rich enough to model the dynamics of biochemical reactions. Our analysis computes an Interval Markov Chain (IMC) that safely approximates the Discrete-Time Markov Chain, describing the probabilistic behavior of the system, and reports both lower and upper bounds for probabilistic temporal properties. Our analysis has several advantages: (i) the method is effective (even for infinite state systems) and allows us to systematically derive an IMC from an abstract labeled transition system; (ii) using intervals for abstracting the multiplicity of reagents allows us to achieve conservative bounds for the concrete probabilities of a set of concrete experiments which differs only for initial concentrations.