Calculational design of a regular model checker by abstract interpretation

2021 ◽  
Author(s):  
Patrick Cousot
Keyword(s):  
Abstract Interpretation ◽  
Model Checker ◽  
Regular 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.

A discussion on equations of phase equilibrium between two regular binary phases

1981 ◽  
Vol 46 (6) ◽  
pp. 1433-1438
Author(s):  
Jan Vřešťál
Keyword(s):  
Phase Equilibrium ◽  
Linear Function ◽  
Concentration Dependence ◽  
Absolute Temperature ◽  
Enthalpy Change ◽  
Independent Parameter ◽  
Free Enthalpy ◽  
Regular Solutions ◽  
Regular Model ◽  
Concentration Dependences

The conditions of the existence of extreme on the concentration dependences of absolute temperature (x are mole fractions) T = Tα(xkα) and T = Tβ(xkβ) denoting equilibrium between two binary regular solutions are generally developed under two assumptions: 1) Free enthalpy change of pure components k = i, j at transition from phase α to β is a linear function of temperature. 2) Concentration dependence of excess free enthalpy (identical with enthalpy) of solutions α and β, respectively, is described in regular model by one concentration and temperature independent parameter for each individual phase.

scholarly journals Verification and Strategy Synthesis for Coalition Announcement Logic

2021 ◽  
Author(s):  
Natasha Alechina ◽  
Hans van Ditmarsch ◽  
Rustam Galimullin ◽  
Tuo Wang
Keyword(s):  
Model Checking ◽  
Proof Of Concept ◽  
Model Checker ◽  
Complete Model ◽  
Concept Model ◽  
The Family ◽  
Winning Strategies ◽  
Epistemic Goals

AbstractCoalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.

scholarly journals Hybrid Verification Technique for Decision-Making of Self-Driving Vehicles

2021 ◽  
Vol 10 (3) ◽  
pp. 42
Author(s):  
Mohammed Al-Nuaimi ◽  
Sapto Wibowo ◽  
Hongyang Qu ◽  
Jonathan Aitken ◽  
Sandor Veres
Keyword(s):  
Decision Making ◽  
Autonomous Vehicle ◽  
Autonomous Driving ◽  
Practical Implementation ◽  
Model Checker ◽  
Multi Agent Systems ◽  
Time Operation ◽  
Bdi Agent ◽  
Perception System ◽  
Probability Of Success

The evolution of driving technology has recently progressed from active safety features and ADAS systems to fully sensor-guided autonomous driving. Bringing such a vehicle to market requires not only simulation and testing but formal verification to account for all possible traffic scenarios. A new verification approach, which combines the use of two well-known model checkers: model checker for multi-agent systems (MCMAS) and probabilistic model checker (PRISM), is presented for this purpose. The overall structure of our autonomous vehicle (AV) system consists of: (1) A perception system of sensors that feeds data into (2) a rational agent (RA) based on a belief–desire–intention (BDI) architecture, which uses a model of the environment and is connected to the RA for verification of decision-making, and (3) a feedback control systems for following a self-planned path. MCMAS is used to check the consistency and stability of the BDI agent logic during design-time. PRISM is used to provide the RA with the probability of success while it decides to take action during run-time operation. This allows the RA to select movements of the highest probability of success from several generated alternatives. This framework has been tested on a new AV software platform built using the robot operating system (ROS) and virtual reality (VR) Gazebo Simulator. It also includes a parking lot scenario to test the feasibility of this approach in a realistic environment. A practical implementation of the AV system was also carried out on the experimental testbed.

scholarly journals Tracing compilation by abstract interpretation

2014 ◽  
Vol 49 (1) ◽  
pp. 47-59
Author(s):  
Stefano Dissegna ◽  
Francesco Logozzo ◽  
Francesco Ranzato
Keyword(s):  
Abstract Interpretation

scholarly journals Stable relations and abstract interpretation of higher-order programs

2020 ◽  
Vol 4 (ICFP) ◽  
pp. 1-30 ◽  
Author(s):  
Benoît Montagu ◽  
Thomas Jensen
Keyword(s):  
Abstract Interpretation ◽  
Higher Order
Sign in / Sign up

Export Citation Format

Share Document