|
Last change
on this file since 2898 was
2796,
checked in by tranquil, 8 years ago
|
- added global notation for existence in Type[1] (\exists[1] x.P)
- in Arithmetic, reimplemented efficient nat_to_bitvector, but still commented out
- in joint_semantics, moved out and around some parameters in primitive semantics functions
- fixed all back end semantics
- added skeleton files for single passes correctness proofs
|
|
File size:
494 bytes
|
| Line | |
|---|
| 1 | include "LTL/LTLToLIN.ma". |
|---|
| 2 | include "LTL/LTL_semantics.ma". |
|---|
| 3 | include "LIN/LIN_semantics.ma". |
|---|
| 4 | include "joint/Traces.ma". |
|---|
| 5 | include "common/StatusSimulation.ma". |
|---|
| 6 | |
|---|
| 7 | (* this should come directly from linearise proof *) |
|---|
| 8 | axiom LTLToLIN_ok : |
|---|
| 9 | ∀stacksizes : ident → option ℕ. (* are hypotheses needed here? *) |
|---|
| 10 | ∀p_in : LTL_program. |
|---|
| 11 | let p_out ≝ ltl_to_lin p_in in |
|---|
| 12 | ∃[1] R. |
|---|
| 13 | status_simulation |
|---|
| 14 | (joint_status LTL_semantics p_in stacksizes) |
|---|
| 15 | (joint_status LIN_semantics p_out stacksizes) |
|---|
| 16 | R. |
|---|
Note: See
TracBrowser
for help on using the repository browser.
