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
49a2f1e3
Commit
49a2f1e3
authored
9 years ago
by
Regis Blanc
Browse files
Options
Downloads
Patches
Plain Diff
coins properties
parent
1624f257
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
testcases/proof/proba/Coins.scala
+71
-0
71 additions, 0 deletions
testcases/proof/proba/Coins.scala
testcases/proof/proba/Dices.scala
+7
-0
7 additions, 0 deletions
testcases/proof/proba/Dices.scala
with
78 additions
and
0 deletions
testcases/proof/proba/Coins.scala
0 → 100644
+
71
−
0
View file @
49a2f1e3
import
leon.annotation._
import
leon.lang._
object
Coins
{
/*
* number of outcomes for each face
*/
case
class
CoinDist
(
pHead
:
BigInt
,
pTail
:
BigInt
)
def
isUniform
(
dist
:
CoinDist
)
:
Boolean
=
{
require
(
isDist
(
dist
))
dist
.
pHead
==
dist
.
pTail
}
def
isDist
(
dist
:
CoinDist
)
:
Boolean
=
dist
.
pHead
>=
0
&&
dist
.
pTail
>=
0
&&
(
dist
.
pHead
>
0
||
dist
.
pTail
>
0
)
//sum modulo: face is 0, tail is 1
def
sum
(
coin1
:
CoinDist
,
coin2
:
CoinDist
)
:
CoinDist
=
{
require
(
isDist
(
coin1
)
&&
isDist
(
coin2
))
CoinDist
(
coin1
.
pHead
*
coin2
.
pHead
+
coin1
.
pTail
*
coin2
.
pTail
,
coin1
.
pHead
*
coin2
.
pTail
+
coin1
.
pTail
*
coin2
.
pHead
)
}
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
//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
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
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
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
}
This diff is collapsed.
Click to expand it.
testcases/proof/proba/Dices.scala
+
7
−
0
View file @
49a2f1e3
...
@@ -84,4 +84,11 @@ object Dices {
...
@@ -84,4 +84,11 @@ object Dices {
isUniform
(
dist
)
isUniform
(
dist
)
}
holds
}
holds
//sum of two non-uniform dices is potentially uniform (no result)
def
sumModNonUniform
(
dice1
:
DiceDist
,
dice2
:
DiceDist
)
:
Boolean
=
{
require
(
isDist
(
dice1
)
&&
isDist
(
dice2
)
&&
!
isUniform
(
dice1
)
&&
!
isUniform
(
dice2
))
val
dist
=
sumMod
(
dice1
,
dice2
)
!
isUniform
(
dist
)
}
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