Yasm: A Software Model-Checker for Verification and Refutation

2006 ◽  
pp. 170-174 ◽  
Author(s):  
Arie Gurfinkel ◽  
Ou Wei ◽  
Marsha Chechik
Keyword(s):  
Model Checker ◽  
Software Model

scholarly journals JDart: Dynamic Symbolic Execution for Java Bytecode (Competition Contribution)

2020 ◽  
pp. 398-402 ◽  
Author(s):  
Malte Mues ◽  
Falk Howar
Keyword(s):  
Symbolic Execution ◽  
Model Checker ◽  
Constraint Solver ◽  
Java Bytecode ◽  
Software Model ◽  
Dynamic Symbolic Execution ◽  
Symbolic Constraints

Abstract JDart performs dynamic symbolic execution of Java programs: it executes programs with concrete inputs while recording symbolic constraints on executed program paths. A constraint solver is then used for generating new concrete values from recorded constraints that drive execution along previously unexplored paths. JDart is built on top of the Java PathFinder software model checker and uses the JConstraints library for the integration of constraint solvers.

scholarly journals Kratos – A Software Model Checker for SystemC

2011 ◽  
pp. 310-316 ◽  
Author(s):  
Alessandro Cimatti ◽  
Alberto Griggio ◽  
Andrea Micheli ◽  
Iman Narasamdya ◽  
Marco Roveri
Keyword(s):  
Model Checker ◽  
Software Model

scholarly journals Ultimate Taipan with Symbolic Interpretation and Fluid Abstractions

2020 ◽  
pp. 418-422 ◽  
Author(s):  
Daniel Dietsch ◽  
Matthias Heizmann ◽  
Alexander Nutz ◽  
Claus Schätzle ◽  
Frank Schüssele
Keyword(s):  
Program Analysis ◽  
Abstract Interpretation ◽  
Model Checker ◽  
New Techniques ◽  
New Approach ◽  
Smt Solving ◽  
Software Model ◽  
Symbolic Interpretation

Abstract Ultimate Taipan is a software model checker that combines trace abstraction with abstract interpretation on path programs. In this year’s version, we replaced our abstract interpretation engine and now use a combination of multiple abstraction functions, fixpoint computation, algebraic program analysis, and SMT solving. Our new approach will allow us to integrate new techniques more easily.

scholarly journals Towards Support for Software Model Checking: Improving the Efficiency of Formal Specifications

2011 ◽  
Vol 2011 ◽  
pp. 1-13 ◽  
Author(s):  
Salamah Salamah ◽  
Ann Q. Gates ◽  
Steve Roach ◽  
Matthew Engskow
Keyword(s):  
Model Checking ◽  
Spin Model ◽  
Software Systems ◽  
Formal Specifications ◽  
Model Checker ◽  
Software Model Checking ◽  
Software Model ◽  
Property Specification ◽  
Büchi Automaton ◽  
Spin Model Checker

The Property Specification (Prospec) tool uses patterns and scopes defined by Dwyer et al., to generate formal specifications in Linear Temporal Logic (LTL) and other languages. The work presented in this paper provides improved LTL specifications for patterns and scopes over those originally provided by Prospec. This improvement comes in the efficiency of the LTL formulas as measured in terms of the number of states in the Büchi automaton generated for the formula. Minimizing the size of the Büchi automata for an LTL specification provides a significant improvement for model checking software systems using such tools as the highly acclaimed Spin model checker.

scholarly journals Program Verification via Craig Interpolation for Presburger Arithmetic with Arrays

10.29007/zfkw ◽  
2018 ◽  
Author(s):  
Angelo Brillout ◽  
Daniel Kroening ◽  
Philipp Rümmer ◽  
Thomas Wahl
Keyword(s):  
Model Checking ◽  
Program Verification ◽  
Model Checker ◽  
Craig Interpolation ◽  
Presburger Arithmetic ◽  
C Programs ◽  
Full Theory ◽  
Software Model ◽  
Interpolation Procedure ◽  
Versatile Tool

Craig interpolation has become a versatile tool in formal verification, in particular for generating intermediate assertions in safety analysis and model checking. In this paper, we present a novel interpolation procedure for the theory of arrays, extending an interpolating calculus for the full theory of quantifier-free Presburger arithmetic, which will be presented at IJCAR this year. We investigate the use of this procedure in a software model checker for C programs. A distinguishing feature of the model checker is its ability to faithfully model machine arithmetic with an encoding into Presburger arithmetic with uninterpreted predicates. The interpolation procedure allows the synthesis of quantified invariants about arrays. This paper presents work in progress; we include initial experiments to demonstrate the potential of our method.

scholarly journals ATL Strategic Reasoning Meets Correlated Equilibrium

2017 ◽  
Author(s):  
Xiaowei Huang ◽  
Ji Ruan
Keyword(s):  
Model Checking ◽  
Correlated Equilibrium ◽  
Model Checker ◽  
Strategic Reasoning ◽  
Rational Agents ◽  
Software Model ◽  
Utilitarian Value ◽  
Total Rewards ◽  
Joint Strategy ◽  
Car Accident

This paper is motivated by analysing a Google self-driving car accident, i.e., the car hit a bus, with the framework and the tools of strategic reasoning by model checking. First of all, we find that existing ATL model checking may find a solution to the accident with {\it irrational} joint strategy of the bus and the car. This leads to a restriction of treating both the bus and the car as rational agents, by which their joint strategy is an equilibrium of certain solution concepts. Second, we find that a randomly-selected joint strategy from the set of equilibria may result in the collision of the two agents, i.e., the accident. Based on these, we suggest taking Correlated Equilibrium (CE) as agents' joint stratgey and optimising over the utilitarian value which is the expected sum of the agents' total rewards. The language ATL is extended with two new modalities to express the existence of an CE and a unique CE, respectively. We implement the extension into a software model checker and use the tool to analyse the examples in the paper. We also study the complexity of the model checking problems.

Sign in / Sign up

Export Citation Format

Share Document