Race analysis for SystemC using model checking
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Automated deduction for verification
ACM Computing Surveys (CSUR)
Formal Methods in System Design
Race analysis for systemc using model checking
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A new verification method for embedded systems
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Automated reasoning and presentation support for formalizing mathematics in Mizar
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
A wiki for Mizar: motivation, considerations, and initial prototype
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Journal of Electronic Testing: Theory and Applications
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
A dynamic constraint-based BMC strategy for generating counterexamples
Proceedings of the 2011 ACM Symposium on Applied Computing
Interpolation-based software verification with WOLVERINE
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Model checking recursive programs with numeric data types
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Checking bounded reachability in asynchronous systems by symbolic event tracing
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Time-bounded analysis of real-time systems
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
A lightweight technique for distributed and incremental program verification
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
A case for alloy annotations for efficient incremental analysis via domain specific solvers
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Modifying test suite composition to enable effective predicate-level statistical debugging
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Towards the formal specification and verification of maple programs
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Synchronisation- and reversal-bounded analysis of multithreaded programs with counters
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Information and Software Technology
High Performance Static Analysis for Industry
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic inference of specifications using matching logic
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
SMT-based false positive elimination in static program analysis
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
An evolutionary framework for routing protocol analysis in wireless sensor networks
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
Quantum adiabatic machine learning
Quantum Information Processing
Verifiably-safe software-defined networks for CPS
Proceedings of the 2nd ACM international conference on High confidence networked systems
Precise and scalable context-sensitive pointer analysis via value flow graph
Proceedings of the 2013 international symposium on memory management
A model reduction approach for improving discrete event simulation performance
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
Partial orders for efficient bounded model checking of concurrent software
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.03 |
The quality and the correctness of software are often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific flaws. This paper surveys algorithms that perform automatic static analysis of software to detect programming errors or prove their absence. The three techniques considered are static analysis with abstract domains, model checking, and bounded model checking. A short tutorial on these techniques is provided, highlighting their differences when applied to practical problems. This paper also surveys tools implementing these techniques and describes their merits and shortcomings.