Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
inox
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
LARA
inox
Commits
65268fe8
Commit
65268fe8
authored
9 years ago
by
Regis Blanc
Browse files
Options
Downloads
Patches
Plain Diff
all properties of coins implemented
parent
a0fb2d32
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
testcases/proof/proba/Coins.scala
+57
-57
57 additions, 57 deletions
testcases/proof/proba/Coins.scala
with
57 additions
and
57 deletions
testcases/proof/proba/Coins.scala
+
57
−
57
View file @
65268fe8
...
...
@@ -119,12 +119,12 @@ object Coins {
def
sum
(
coin1
:
CoinDist
,
coin2
:
CoinDist
)
:
CoinDist
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
))
CoinDist
(
coin1
.
pHead
*
coin2
.
pHead
+
coin1
.
pTail
*
coin2
.
pTail
)
}
ensuring
(
res
=>
res
.
pTail
==
(
coin1
.
pHead
*
coin2
.
pTail
+
coin1
.
pTail
*
coin2
.
pHead
))
}
ensuring
(
res
=>
isDist
(
res
)
&&
res
.
pTail
==
(
coin1
.
pHead
*
coin2
.
pTail
+
coin1
.
pTail
*
coin2
.
pHead
))
def
sum
(
dist
:
CoinsJoinDist
)
:
CoinDist
=
{
require
(
isDist
(
dist
))
CoinDist
(
dist
.
hh
+
dist
.
tt
)
}
ensuring
(
res
=>
res
.
pTail
==
(
dist
.
ht
+
dist
.
th
))
}
ensuring
(
res
=>
isDist
(
res
)
&&
res
.
pTail
==
(
dist
.
ht
+
dist
.
th
))
...
...
@@ -133,73 +133,73 @@ object Coins {
* properties of sum operation *
***************************************************/
//
def sumIsUniform1(coin1: CoinDist, coin2: CoinDist): Boolean = {
//
require(isDist(coin1) && isDist(coin2) && isUniform(coin1) && isUniform(coin2))
//
val dist = sum(coin1, coin2)
//
isUniform(dist)
//
} holds
def
sumIsUniform1
(
coin1
:
CoinDist
,
coin2
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
)
&&
isUniform
(
coin1
)
&&
isUniform
(
coin2
))
val
dist
=
sum
(
coin1
,
coin2
)
isUniform
(
dist
)
}
holds
//
def sumIsUniform2(coin1: CoinDist, coin2: CoinDist): Boolean = {
//
require(isDist(coin1) && isDist(coin2) && isUniform(coin1))
//
val dist = sum(coin1, coin2)
//
isUniform(dist)
//
} holds
def
sumIsUniform2
(
coin1
:
CoinDist
,
coin2
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
)
&&
isUniform
(
coin1
))
val
dist
=
sum
(
coin1
,
coin2
)
isUniform
(
dist
)
}
holds
//
def sumUniform3(coin1: CoinDist, coin2: CoinDist, coin3: CoinDist): Boolean = {
//
require(isDist(coin1) && isDist(coin2) && isDist(coin3) && isUniform(coin1))
//
val dist = sum(sum(coin1, coin2), coin3)
//
isUniform(dist)
//
} holds
def
sumUniform3
(
coin1
:
CoinDist
,
coin2
:
CoinDist
,
coin3
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
)
&&
isDist
(
coin3
)
&&
isUniform
(
coin1
))
val
dist
=
sum
(
sum
(
coin1
,
coin2
),
coin3
)
isUniform
(
dist
)
}
holds
//
def sumUniformWithIndependence(dist: CoinsJoinDist): Boolean = {
//
require(isDist(dist) && isIndependent(dist) && (isUniform(firstCoin(dist)) || isUniform(secondCoin(dist))))
//
val res = sum(dist)
//
isUniform(res)
//
} holds
def
sumUniformWithIndependence
(
dist
:
CoinsJoinDist
)
:
Boolean
=
{
require
(
isDist
(
dist
)
&&
isIndependent
(
dist
)
&&
(
isUniform
(
firstCoin
(
dist
))
||
isUniform
(
secondCoin
(
dist
))))
val
res
=
sum
(
dist
)
isUniform
(
res
)
}
holds
//
//should find counterexample, indepenence is required
//
def sumUniformWithoutIndependence(dist: CoinsJoinDist): Boolean = {
//
require(isDist(dist) && (isUniform(firstCoin(dist)) || isUniform(secondCoin(dist))))
//
val res = sum(dist)
//
isUniform(res)
//
} holds
//should find counterexample, indepenence is required
def
sumUniformWithoutIndependence
(
dist
:
CoinsJoinDist
)
:
Boolean
=
{
require
(
isDist
(
dist
)
&&
(
isUniform
(
firstCoin
(
dist
))
||
isUniform
(
secondCoin
(
dist
))))
val
res
=
sum
(
dist
)
isUniform
(
res
)
}
holds
////sum of two non-uniform dices is potentially uniform (no result)
//
def sumNonUniform1(coin1: CoinDist, coin2: CoinDist): Boolean = {
//
require(isDist(coin1) && isDist(coin2) && !isUniform(coin1) && !isUniform(coin2))
//
val dist = sum(coin1, coin2)
//
!isUniform(dist)
//
} holds
def
sumNonUniform1
(
coin1
:
CoinDist
,
coin2
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
)
&&
!
isUniform
(
coin1
)
&&
!
isUniform
(
coin2
))
val
dist
=
sum
(
coin1
,
coin2
)
!
isUniform
(
dist
)
}
holds
//
def sumNonUniform2(coin1: CoinDist, coin2: CoinDist, coin3: CoinDist): Boolean = {
//
require(isDist(coin1) && isDist(coin2) && isDist(coin3) && !isUniform(coin1) && !isUniform(coin2) && !isUniform(coin3))
//
val dist = sum(sum(coin1, coin2), coin3)
//
!isUniform(dist)
//} //
holds
def
sumNonUniform2
(
coin1
:
CoinDist
,
coin2
:
CoinDist
,
coin3
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
)
&&
isDist
(
coin3
)
&&
!
isUniform
(
coin1
)
&&
!
isUniform
(
coin2
)
&&
!
isUniform
(
coin3
))
val
dist
=
sum
(
sum
(
coin1
,
coin2
),
coin3
)
!
isUniform
(
dist
)
}
holds
//
def sumNonUniformWithIndependence(dist: CoinsJoinDist): Boolean = {
//
require(isDist(dist) && isIndependent(dist) && !isUniform(firstCoin(dist)) && !isUniform(secondCoin(dist)))
//
val res = sum(dist)
//
!isUniform(res)
//
} holds
def
sumNonUniformWithIndependence
(
dist
:
CoinsJoinDist
)
:
Boolean
=
{
require
(
isDist
(
dist
)
&&
isIndependent
(
dist
)
&&
!
isUniform
(
firstCoin
(
dist
))
&&
!
isUniform
(
secondCoin
(
dist
)))
val
res
=
sum
(
dist
)
!
isUniform
(
res
)
}
holds
//
//independence is required
//
def sumNonUniformWithoutIndependence(dist: CoinsJoinDist): Boolean = {
//
require(isDist(dist) && !isUniform(firstCoin(dist)) && !isUniform(secondCoin(dist)))
//
val res = sum(dist)
//
!isUniform(res)
//
} holds
//independence is required
def
sumNonUniformWithoutIndependence
(
dist
:
CoinsJoinDist
)
:
Boolean
=
{
require
(
isDist
(
dist
)
&&
!
isUniform
(
firstCoin
(
dist
))
&&
!
isUniform
(
secondCoin
(
dist
)))
val
res
=
sum
(
dist
)
!
isUniform
(
res
)
}
holds
//
def sumIsCommutative(coin1: CoinDist, coin2: CoinDist, coin3: CoinDist): Boolean = {
//
require(isDist(coin1) && isDist(coin2))
//
sum(coin1, coin2) == sum(coin2, coin1)
//
} holds
def
sumIsCommutative
(
coin1
:
CoinDist
,
coin2
:
CoinDist
,
coin3
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
))
sum
(
coin1
,
coin2
)
==
sum
(
coin2
,
coin1
)
}
holds
//
def sumIsAssociative(coin1: CoinDist, coin2: CoinDist, coin3: CoinDist): Boolean = {
//
require(isDist(coin1) && isDist(coin2) && isDist(coin3))
//
sum(sum(coin1, coin2), coin3) == sum(coin1, sum(coin2, coin3))
//} //
holds
def
sumIsAssociative
(
coin1
:
CoinDist
,
coin2
:
CoinDist
,
coin3
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
)
&&
isDist
(
coin3
))
sum
(
sum
(
coin1
,
coin2
),
coin3
)
==
sum
(
coin1
,
sum
(
coin2
,
coin3
))
}
holds
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment