• Aucun résultat trouvé

Solving Set Constraints in B and Event-B: Foundations and Applications

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Solving Set Constraints in B and Event-B: Foundations and Applications"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Solving Set Constraints in B and Event-B:

Foundations and Applications

Michael Leuschel

Institut f¨ur Informatik, Heinrich-Heine-Universit¨at D¨usseldorf, Germany Invited Talk

This talk will given an overview of how ProB solves set constraints, including sets with mathematical integers, higher-order sets, and sets with complex data types. We also touch on how to deal with large or potentially infinite sets and how to do functional programming in B. We will examine practical applications of set constraint solving, from data validation, to (runtime) model execution over to symbolic model checking and proof support. We will also touch upon other formal methods such as Alloy or TLA+, as well as other constraint solving backends for B, not based on Prolog (SAT via Alloy’s Kodkod API and translations to SMT using Z3 and CVC4).

Références

Télécharger maintenant ( PDF - 1 Page - 158.92 KB )

Documents relatifs

Disconnected Julia set and rotation sets

The Yoccoz's inequality in [26], [15], [22] relates the multiplier of a repelling fixed point of a polynomial and its rotation number provided the Julia set of the polynomial

Reasoning with Sets and Sums of Sets

With those three bridging functions, we hope to see similarities and properties that allow us to establish a more general method of reasoning with arithmetic, sets, cardinalities

Intersecting data to closed sets with constraints

Thus one could apply the intersec- tions with several different minimum support thresh- olds to get refining collection of frequent closed sets in the data: the already found

Higher Randomness and Forcing with Closed Sets

If we consider the topology generated by Π 1 0 sets of positive measure, because Σ 2 0 sets of measure 1 are then dense open sets for this topology, we also get in some sense

Constructible representations and basic sets in type B

In fact, in characteristic zero, using these matrices, it is possible to prove the existence of certain indexing sets called “basic sets” which are in natural bijection with the set

[1,2]-sets and [1,2]-total sets in trees with algorithms

paper we introduce a linear algorithm for finding the cardinality of the smallest [1, 2]-sets and [1, 2]-total sets of a tree and extend it to a more generalized version for [i,

Multiple Sets Exponential Concentration and Higher Order Eigenvalues

(i) The n-dimensional sphere of radius q n−1 ρ , S n,ρ endowed with the natural geo- desic distance d n,ρ arising from its canonical Riemannian metric and its normal- ized

Boundary density and Voronoi set estimation for irregular sets

Assumption 1 is not satisfied on the whole boundary, but it is within an open ball of R d intersecting one and only one of the three curves, and having (4) on a self-similar E with