Software safety: why, what, and how
ACM Computing Surveys (CSUR)
Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Abstract interpretation and application to logic programs
Journal of Logic Programming
STATEMATE applied to statistical software testing
ISSTA '93 Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
On random and partition testing
Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract Interpretation of Probabilistic Semantics
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Backwards Abstract Interpretation of Probabilistic Programs
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Probabilistic Abstract Interpretation and Statistical Testing
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Abstraction of Expectation Functions Using Gaussian Distributions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Static Analyses of the Precision of Floating-Point Operations
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
An Abstract Analysis of the Probabilistic Termination of Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
A Few Graph-Based Relational Numerical Abstract Domains
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Evaluating Complex MAC Protocols for Sensor Networks with APMC
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing randomized software by means of statistical hypothesis tests
Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting
λ-calculus and Quantitative Program Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract interpretation of programs as Markov decision processes
SAS'03 Proceedings of the 10th international conference on Static analysis
Statistical verification of probabilistic properties with unbounded until
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Probabilistically accurate program transformations
SAS'11 Proceedings of the 18th international conference on Static analysis
An overview of semantics for the validation of numerical programs
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
We introduce a new method, combination of random testing and abstract interpretation, for the analysis of programs featuring both probabilistic and non-probabilistic nondeterminism. After introducing "ordinary" testing, we show how to combine testing and abstract interpretation and give formulas linking the precision of the results to the number of iterations. We then discuss complexity and optimization issues and end with some experimental results.