Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
why3
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
106
Issues
106
List
Boards
Labels
Milestones
Merge Requests
14
Merge Requests
14
Packages & Registries
Packages & Registries
Container Registry
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Why3
why3
Commits
bbb2391f
Commit
bbb2391f
authored
Sep 15, 2011
by
Asma TafatBouzid
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
latex statistics
parent
f18f5d72
Changes
3
Hide whitespace changes
Inline
Sidebyside
Showing
3 changed files
with
38 additions
and
30 deletions
+38
30
examples/programs/vacid_0_binary_heaps/proofs/bag_Bag_Add_diff_1.v
...programs/vacid_0_binary_heaps/proofs/bag_Bag_Add_diff_1.v
+1
3
examples/programs/vacid_0_binary_heaps/proofs/bag_Bag_Diff_comm_1.v
...rograms/vacid_0_binary_heaps/proofs/bag_Bag_Diff_comm_1.v
+1
3
src/ide/replay.ml
src/ide/replay.ml
+36
24
No files found.
examples/programs/vacid_0_binary_heaps/proofs/bag_Bag_Add_diff_1.v
View file @
bbb2391f
...
...
@@ 150,6 +150,4 @@ subst; intuition.
generalize
(
occ_non_negative
X
b
y
).
omega
.
Qed
.
(
*
DO
NOT
EDIT
BELOW
*
)
(
*
DO
NOT
EDIT
BELOW
*
)
\ No newline at end of file
examples/programs/vacid_0_binary_heaps/proofs/bag_Bag_Diff_comm_1.v
View file @
bbb2391f
...
...
@@ 161,6 +161,4 @@ generalize (Zmax_spec 0 (nb_occ x b  nb_occ x b1  nb_occ x b2));
generalize
(
Zmax_spec
0
(
nb_occ
x
b

nb_occ
x
b2

nb_occ
x
b1
));
intuition
.
Qed
.
(
*
DO
NOT
EDIT
BELOW
*
)
(
*
DO
NOT
EDIT
BELOW
*
)
\ No newline at end of file
src/ide/replay.ml
View file @
bbb2391f
...
...
@@ 302,38 +302,50 @@ let print_statistics files =
(* Statistics in LaTeX*)
let
rec
provers_latex_stats
provers
g
=
let
rec
provers_latex_stats
provers
depth
g
=
let
proofs
=
M
.
external_proofs
g
in
Hashtbl
.
iter
(
fun
p
_
>
Hashtbl
.
replace
provers
p
()
)
proofs
;
let
tr
=
M
.
transformations
g
in
Hashtbl
.
iter
(
fun
_st
tr
>
let
goals
=
tr
.
M
.
subgoals
in
List
.
iter
(
provers_latex_stats
provers
)
goals
)
tr
(*let rec goal_latex_stat prov g =*)
let
rec
goal_latex_stat
g
=
(* printf "%s & %b" (M.goal_name g) (M.goal_proved g);*)
printf
"%s
"
(
M
.
goal_name
g
);
Hashtbl
.
iter
(
fun
_st
tr
>
depth
:=
!
depth
+
1
;
let
goals
=
tr
.
M
.
subgoals
in
List
.
iter
(
provers_latex_stats
provers
depth
)
goals
)
tr
let
rec
goal_latex_stat
prov
depth
g
=
for
i
=
1
to
depth
do
printf
"
\\
quad"
done
;
printf
"
\\
verb%s
"
(
M
.
goal_name
g
);
let
proofs
=
M
.
external_proofs
g
in
Hashtbl
.
iter
(
fun
p
pr
>
let
s
=
pr
.
M
.
proof_state
in
match
s
with
Session
.
Done
res
>
if
res
.
Call_provers
.
pr_answer
=
Call_provers
.
Valid
then
printf
" %s : %.2f"
p
res
.
Call_provers
.
pr_time
else
printf
" %s : "
p

_
>
printf
" %s: *"
p
)
proofs
;
printf
"
\\\\
@."
;
Hashtbl
.
iter
(
fun
p
_pr
>
try
let
pr
=
Hashtbl
.
find
proofs
p
in
let
s
=
pr
.
M
.
proof_state
in
match
s
with
Session
.
Done
res
>
if
res
.
Call_provers
.
pr_answer
=
Call_provers
.
Valid
then
printf
"& %.2f "
res
.
Call_provers
.
pr_time
else
printf
"&  "

_
>
printf
"& "
with
Not_found
>
printf
"&"
)
prov
;
printf
"
\\\\
\\
hline @."
;
let
tr
=
M
.
transformations
g
in
Hashtbl
.
iter
(
fun
_st
tr
>
let
goals
=
tr
.
M
.
subgoals
in
List
.
iter
goal_latex_stat
goals
)
tr
List
.
iter
(
goal_latex_stat
prov
(
depth
+
1
))
goals
)
tr
let
theory_latex_stat
t
=
printf
" Collect provers used to proof this theory
\n
"
;
let
provers
=
Hashtbl
.
create
9
in
List
.
iter
(
provers_latex_stats
provers
)
(
M
.
goals
t
);
Hashtbl
.
iter
(
fun
p
_
>
printf
" %s :"
p
)
provers
;
printf
"
\\
begin{tabular}{lcr}@."
;
List
.
iter
goal_latex_stat
(
M
.
goals
t
);
let
provers
=
Hashtbl
.
create
9
in
let
depth
=
ref
0
in
List
.
iter
(
provers_latex_stats
provers
depth
)
(
M
.
goals
t
);
printf
"
\n
@."
;
printf
"
\\
begin{tabular}"
;
printf
"{ l "
;
if
(
!
depth
=
0
)
then
for
i
=
0
to
(
Hashtbl
.
length
provers
)

1
do
printf
"c "
done
else
for
i
=
0
to
(
Hashtbl
.
length
provers
)
+
!
depth

2
do
printf
"c "
done
;
printf
"}
\n
\\
hline@."
;
for
i
=
0
to
!
depth

2
do
printf
" & "
done
;
Hashtbl
.
iter
(
fun
p
_
>
printf
"& %s "
p
)
provers
;
printf
"
\\\\\\
hline@."
;
List
.
iter
(
goal_latex_stat
provers
0
)
(
M
.
goals
t
);
printf
"
\\
end{tabular}@."
let
file_latex_stat
f
=
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment