154,766 Hits in 4.3 sec

CPAchecker with Sequential Combination of Explicit-Value Analyses and Predicate Analyses [chapter]

Stefan Löwe, Mikhail Mandrykin, Philipp Wendler
2014 Lecture Notes in Computer Science  
CPAchecker is a framework for software verification, built on the foundations of Configurable Program Analysis (CPA).  ...  The combination of conceptually different analyses is key to the success of our verification approach, as the diversity of verification tasks is taken into account.  ...  Several other research groups use and contribute to CPAchecker, such as the Institute for System Programming of the Russian Academy of Sciences, the University of Paderborn and the University of Technology  ... 
doi:10.1007/978-3-642-54862-8_27 fatcat:y2mu6bxgwbc3dl4nhtxvsh2eui

Validating Static WCET Analysis: A Method and Its Application

Wei-Tsun Sun, Eric Jenn, Hugues Cassé, Michael Wagner
2019 Worst-Case Execution Time Analysis  
We hereby show how we have validated the version of the data flow static analyser of OTAWA applied to the AURIX TC275 target processor.  ...  Note that, as for the previous verification, validity is demonstrated with respect to one or several input programs and on or several input stimuli for each program, so, the quality of the verification  ...  W C E T 2 0 1 9 Verification of the static analyser Abstract interpretation proceeds by executing a program in an abstract domain that preserves the properties of interest.  ... 
doi:10.4230/oasics.wcet.2019.6 dblp:conf/wcet/SunJC19 fatcat:p6a2fcy5ajc6favczckj44xr4u

CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic [chapter]

Matthias Dangl, Stefan Löwe, Philipp Wendler
2015 Lecture Notes in Computer Science  
The combination of several different analyses copes well with the diversity of the verification tasks in SV-COMP.  ...  The submitted configuration is a combination of seven different analyses, based on explicit-value analysis, k-induction, predicate analysis, and concrete memory graphs.  ...  Verification Approach The configuration used by CPAchecker in this year's SV-COMP is conceptually similar to last year [4] : a sequential combination of five analyses [2] , as shown in Fig. 1 , with  ... 
doi:10.1007/978-3-662-46681-0_34 fatcat:nzw7uubxufbmpdbxqidlfh6ls4

A Tool Integrating Model Checking into a C Verification Toolset [chapter]

Subash Shankar, Gilbert Pajela
2016 Lecture Notes in Computer Science  
Frama-C is an extensible C verification framework that includes support for abstract interpretation and deductive verification.  ...  We would also like to thank the entire Frama-C team for invaluable guidance without which this tool would not have been possible.  ...  Frama-C's combination algorithm assumes all analyses are correct, and its analyses combination algorithms result in inconsistent statuses if, for example, two plugins emit different statuses for the same  ... 
doi:10.1007/978-3-319-32582-8_15 fatcat:s5fayqfcsngvnmd2rvc3ieim5q

PeSCo: Predicting Sequential Combinations of Verifiers [chapter]

Cedric Richter, Heike Wehrheim
2019 Msphere  
PeSCo is a tool for predicting a (likely best) sequential combination of verifiers on a given verification task and then running it.  ...  C. Richter-Jury member.  ...  For the learning, we extract features of verification tasks via an encoding of programs as graphs combining concepts of control-flow and program dependence graphs with abstract syntax trees.  ... 
doi:10.1007/978-3-030-17502-3_19 fatcat:qzj23iv7rvcqfbme3t72l5hp5m

Software Verification Using k-Induction [chapter]

Alastair F. Donaldson, Leopold Haller, Daniel Kroening, Philipp Rümmer
2011 Lecture Notes in Computer Science  
We present combined-case k-induction, a novel technique for verifying software programs.  ...  We then present two implementations of our technique: K-INDUCTOR, a verifier for C programs built on top of the CBMC model checker, and K-BOOGIE, an extension of the Boogie tool.  ...  Algorithm 1: ANALYSE Input: Reducible CFG C = (V, in, E, code).  ... 
doi:10.1007/978-3-642-23702-7_26 fatcat:k5bwyozpljgdzaptzgszijtbty

CoVeriTest: interleaving value and predicate analysis for test-case generation

Marie-Christine Jakobs
2020 International Journal on Software Tools for Technology Transfer (STTT)  
For the competition, we interleave CPAchecker's value and predicate analysis and let both analyses resume their analysis performed in the previous iteration.  ...  Since the tasks in Test-Comp are diverse and verification techniques have different strengths and weaknesses, we also do not stick to a single verification technique, but use a hybrid approach that combines  ...  For C programs requiring a 64-bit environment, one must add the parameter -64. Moreover, for machines with less RAM one can adjust the amount of memory given to the Java VM.  ... 
doi:10.1007/s10009-020-00572-1 fatcat:g3w2echfkvbwdcdd5dnu6375iq

PINCETTE - Validating Changes and Upgrades in Networked Software

H. Chockler, G. Denaro, Meijia Ling, G. Fedyukovich, A. E. J. Hyvrinen, L. Mariani, A. Muhammad, M. Oriol, A. Rajan, O. Sery, N. Sharygina, M. Tautschnig
2013 2013 17th European Conference on Software Maintenance and Reengineering  
The EU FP7 project PINCETTE addresses this challenge by employing a combination of static and dynamic software verification tools.  ...  The changes between versions are used both as guidance for improving efficiency of software verification, and also to define new notions of correctness.  ...  C. Combination of Static and Dynamic Analyses Currently there are three industrial projects combining static and dynamic analyses, all led by Microsoft Research.  ... 
doi:10.1109/csmr.2013.72 dblp:conf/csmr/ChocklerDLFHMMORSST13 fatcat:s2rpfpvddndzxk2pp4vs6xqi54

Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework [chapter]

Dirk Beyer, Heike Wehrheim
2020 Lecture Notes in Computer Science  
To limit the scope, we restrict our overview to tools and approaches for automatic program analysis.  ...  The goal of cooperative verification is to combine verification approaches in such a way that they work together to verify a system model.  ...  The analyses are then jointly run and jointly derive analysis information for program locations.  ... 
doi:10.1007/978-3-030-61362-4_8 fatcat:32t7iq7e6fbbhchr4hveo3beja

Software/Hardware Co-Verification for Custom Instruction Set Processors

Marie-Christine Jakobs, Felix Pauck, Marco Platzner, Heike Wehrheim, Tobias Wiersema
2021 IEEE Access  
Then, we describe the integration of software and hardware analyses for both techniques and describe a fully automated tool chain implementing the approaches.  ...  In this paper we present a novel formal approach for hardware/software co-verification targeting processors with custom instruction set extensions.  ...  For printing outputs the C printf statement is used. The left of Figure 2 shows our example program FKT given in the C programming language. All variables (i.e., y, x and N) are of type int.  ... 
doi:10.1109/access.2021.3131213 fatcat:mcnoifxzxvg6fph4gg5adjzp3e

2LS: Heap Analysis and Memory Safety [chapter]

Viktor Malík, Peter Schrammel, Tomáš Vojnar
2020 Lecture Notes in Computer Science  
2LS is a framework for analysis of sequential C programs based on the CPROVER infrastructure and template-based synthesis techniques for checking both safety and termination.  ...  The paper presents the main improvements done in 2LS since 2018, which concern mainly the way 2LS handles dynamically allocated objects and structures as well as combinations of abstract domains.  ...  Overview 2LS is a static analysis and verification tool for sequential C programs.  ... 
doi:10.1007/978-3-030-45237-7_22 fatcat:trxnjctgyjgbzh3c3ckjzjpbiy

Considering Typestate Verification for Quantified Event Automata [chapter]

Giles Reger
2016 Lecture Notes in Computer Science  
for runtime verification.  ...  This paper discusses how the existing static analyses developed for typestate properties may be extended to a more expressive class of properties expressible by a specification formalism originally developed  ...  A starting point for multi-object typestate verification for QEA would be to extend either approach, possibly also combining them.  ... 
doi:10.1007/978-3-319-47166-2_33 fatcat:lkvxzuv3d5hcbbstxhdxbet5t4

Result Certification of Static Program Analysers with Automated Theorem Provers [chapter]

Frédéric Besson, Pierre-Emmanuel Cornilleau, Thomas Jensen
2014 Lecture Notes in Computer Science  
The automation of the deductive approach to program verification crucially depends on the ability to efficiently infer and discharge program invariants.  ...  For those analyses, we show how to generate tractable verification conditions that are still quantified but fall in a decidable logic fragment that is reducible to the Effectively Propositional logic.  ...  Vittet for porting the Null Inference Tool (Nit) to Sawja and helping with the experiments.  ... 
doi:10.1007/978-3-642-54108-7_16 fatcat:66itrrnsgvghrdmedy3umlt24e

BDD-based software verification

Dirk Beyer, Andreas Stahlbauer
2014 International Journal on Software Tools for Technology Transfer (STTT)  
The results show that BDDs are efficient for a restricted class of programs, which yields the insight that BDDs could be used selectively for variables that are restricted to certain program operations  ...  A symbolic representation using BDDs seems appropriate for ECA programs under certain conditions.  ...  Then, based on the results, we created a combination analysis that first analyses the program syntactically and if the program is suitable for a BDD-based analysis, then we verify it using BDDs, otherwise  ... 
doi:10.1007/s10009-014-0334-1 fatcat:m6xpuqjq45btrhk4lsov7i2hii

Algorithmic Logic-Based Verification with SeaHorn

Arie Gurfinkel
2015 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)  
with SeaHorn Gurfinkel, 2015 A program satisfies a property iff corresponding CHCs are satisfiable • satisfiability-preserving transformations == safety preserving Models for CHC correspond to verification  ...  ) correspond to some basic blocks An edge between cut-points c and d summarizes all finite (loop-free) executions from c to d that do not pass through any other cut-points 32 Verification with SeaHorn  ...  verification technology • "SMT-LIB" for program verification SeaHorn Usage > sea pf FILE.c Outputs sat for unsafe (has counterexample); unsat for safe Additional options • --cex=trace.xml outputs  ... 
doi:10.1109/synasc.2015.10 dblp:conf/synasc/Gurfinkel15 fatcat:hm4asdh5mjdpxcxdkhsgpht32q
« Previous Showing results 1 — 15 out of 154,766 results