ogma-language-smv-1.10.0/0000755000000000000000000000000015064246136013275 5ustar0000000000000000ogma-language-smv-1.10.0/LICENSE0000644000000000000000000002613715064246136014313 0ustar0000000000000000 Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ogma-language-smv-1.10.0/CHANGELOG.md0000644000000000000000000000407515064246136015114 0ustar0000000000000000# Revision history for ogma-language-smv ## [1.10.0] - 2025-09-21 * Version bump 1.10.0 (#310). * Replace NOSA license with Apache license (#293). ## [1.9.0] - 2025-08-06 * Version bump 1.9.0 (#284). ## [1.8.0] - 2025-07-13 * Version bump 1.8.0 (#275). ## [1.7.0] - 2025-03-21 * Version bump 1.7.0 (#269). * Remove references to old design of Ogma from documentation (#220). * Bump upper version constraint on Cabal (#213). * Remove extraneous EOL character (#224). * Specify tools needed using build-tool-depends (#149). ## [1.6.0] - 2025-01-21 * Version bump 1.6.0 (#208). * Add repository information to cabal package (#148). * Add version bounds to all dependencies (#119). ## [1.5.0] - 2024-11-21 * Version bump 1.5.0 (#178). ## [1.4.1] - 2024-09-21 * Version bump 1.4.1 (#155). * Replace homepage (#147). ## [1.4.0] - 2024-05-21 * Version bump 1.4.0 (#145). ## [1.3.0] - 2024-03-21 * Version bump 1.3.0 (#133). ## [1.2.0] - 2024-01-21 * Version bump 1.2.0 (#117). * Introduce identifier substitution functions (#115). ## [1.1.0] - 2023-11-21 * Version bump 1.1.0 (#112). ## [1.0.11] - 2023-09-21 * Version bump 1.0.11 (#103). * Support MTL operators with number ranges (#101). ## [1.0.10] - 2023-07-21 * Version bump 1.0.10 (#98). ## [1.0.9] - 2023-05-21 * Version bump 1.0.9 (#93). ## [1.0.8] - 2023-03-21 * Version bump 1.0.8 (#81). * Support inequality operator (#71). * Mark package as uncurated (#74). ## [1.0.7] - 2023-01-21 * Version bump 1.0.7 (#69). * Specify upper bound constraint for Cabal. Refs #69. ## [1.0.6] - 2022-11-21 * Version bump 1.0.6 (#64). * Update license in cabal file to OtherLicense (#62). * Add empty file to keep directory structure in distributable package (#65). ## [1.0.5] - 2022-09-21 * Version bump 1.0.5 (#60). * Support floating point numbers in SMV expressions (#58). ## [1.0.4] - 2022-07-21 * Version bump 1.0.4 (#53). ## [1.0.3] - 2022-05-21 * Version bump 1.0.3 (#49). ## [1.0.2] - 2022-03-21 * Version bump 1.0.2 (#43). ## [1.0.1] - 2022-01-21 * Version bump 1.0.1 (#39). ## [1.0.0] - 2021-11-22 * Initial release. ogma-language-smv-1.10.0/Setup.hs0000644000000000000000000000216315064246136014733 0ustar0000000000000000-- | Custom Setup that runs bnfc to generate the language sub-libraries -- for the parsers included in Ogma. module Main (main) where import Distribution.Simple ( defaultMainWithHooks, hookedPrograms, postConf, preBuild, simpleUserHooks ) import Distribution.Simple.Program ( Program (..), findProgramVersion, simpleProgram ) import System.Process ( system ) -- | Run BNFC on the grammar before the actual build step. -- -- All options for bnfc are hard-coded here. There is an open bug in Cabal's -- github repo about supporting BNFC. main :: IO () main = defaultMainWithHooks $ simpleUserHooks { hookedPrograms = [ bnfcProgram ] , postConf = \args flags packageDesc localBuildInfo -> do _ <- system "bnfc --haskell -p Language.SMV -o src/ grammar/SMV.cf" postConf simpleUserHooks args flags packageDesc localBuildInfo } -- | TODO: This should be in Cabal.Distribution.Simple.Program.Builtin. bnfcProgram :: Program bnfcProgram = (simpleProgram "bnfc") { programFindVersion = findProgramVersion "--version" id } ogma-language-smv-1.10.0/ogma-language-smv.cabal0000644000000000000000000000637515064246136017603 0ustar0000000000000000-- Copyright 2020 United States Government as represented by the Administrator -- of the National Aeronautics and Space Administration. All Rights Reserved. -- -- Disclaimers -- -- Licensed under the Apache License, Version 2.0 (the "License"); you may -- not use this file except in compliance with the License. You may obtain a -- copy of the License at -- -- https://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, WITHOUT -- WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the -- License for the specific language governing permissions and limitations -- under the License. cabal-version: 2.0 build-type: Custom name: ogma-language-smv version: 1.10.0 homepage: https://github.com/nasa/ogma bug-reports: https://github.com/nasa/ogma/issues license: Apache-2.0 license-file: LICENSE author: Ivan Perez, Alwyn Goodloe maintainer: ivan.perezdominguez@nasa.gov category: Aerospace extra-source-files: CHANGELOG.md grammar/SMV.cf src/.keep tests/smv_good tests/smv_bad synopsis: Ogma: Runtime Monitor translator: SMV Language Frontend description: Ogma is a tool to facilitate the integration of safe runtime monitors into other systems. Ogma extends , a high-level runtime verification framework that generates hard real-time C99 code. . This library contains a frontend to read SMV Boolean expressions. -- Ogma packages should be uncurated so that only the official maintainers make -- changes. -- -- Because this is a NASA project, we want to make sure that users obtain -- exactly what we publish, unmodified by anyone external to our project. x-curation: uncurated source-repository head type: git location: git@github.com:nasa/ogma.git subdir: ogma-language-smv custom-setup setup-depends: base >= 4.11.0.0 && < 5 , Cabal >= 2.0 && < 3.15 , process >= 1.6 && < 1.7 library exposed-modules: -- Automatically generated Language.SMV.AbsSMV Language.SMV.LexSMV Language.SMV.ParSMV Language.SMV.PrintSMV Language.SMV.Substitution autogen-modules: Language.SMV.AbsSMV Language.SMV.LexSMV Language.SMV.ParSMV Language.SMV.PrintSMV build-depends: base >= 4.11.0.0 && < 5 , array >= 0.5.2.0 && < 0.6 build-tool-depends: alex:alex >= 3 , BNFC:bnfc >= 2.9.4 , happy:happy >= 1.19 hs-source-dirs: src default-language: Haskell2010 test-suite unit-tests type: exitcode-stdio-1.0 main-is: Main.hs build-depends: base >= 4.11.0.0 && < 5 , QuickCheck >= 2.8.2 && < 2.16 , test-framework >= 0.8.2 && < 0.9 , test-framework-quickcheck2 >= 0.3.0.4 && < 0.4 , ogma-language-smv hs-source-dirs: tests default-language: Haskell2010 ghc-options: -Wall ogma-language-smv-1.10.0/grammar/0000755000000000000000000000000015064246136014723 5ustar0000000000000000ogma-language-smv-1.10.0/grammar/SMV.cf0000644000000000000000000000626115064246136015707 0ustar0000000000000000-- Copyright 2020 United States Government as represented by the Administrator -- of the National Aeronautics and Space Administration. All Rights Reserved. -- -- Disclaimers -- -- Licensed under the Apache License, Version 2.0 (the "License"); you may -- not use this file except in compliance with the License. You may obtain a -- copy of the License at -- -- https://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, WITHOUT -- WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the -- License for the specific language governing permissions and limitations -- under the License. -- This is a simplified grammar of SMV temporal logic expressions. This grammar -- allows for the presence of tags around some expressions, which some tools -- that produce SMV include in expressions. entrypoints BoolSpec; BoolSpecSignal. BoolSpec9 ::= Ident; BoolSpecConst. BoolSpec9 ::= BoolConst ; BoolSpecNum. BoolSpec9 ::= NumExpr; BoolSpecCmp. BoolSpec8 ::= BoolSpec8 OrdOp BoolSpec9; BoolSpecNeg. BoolSpec7 ::= "!" BoolSpec8; BoolSpecAnd. BoolSpec6 ::= BoolSpec6 "&" BoolSpec7; BoolSpecOr. BoolSpec5 ::= BoolSpec5 "|" BoolSpec6; BoolSpecXor. BoolSpec4 ::= BoolSpec4 "xor" BoolSpec5; BoolSpecImplies. BoolSpec3 ::= BoolSpec3 "->" BoolSpec4; BoolSpecEquivs. BoolSpec2 ::= BoolSpec2 "<->" BoolSpec3; BoolSpecOp1. BoolSpec1 ::= OpOne BoolSpec2; BoolSpecOp2. BoolSpec ::= BoolSpec OpTwo BoolSpec1; _ . BoolSpec9 ::= "(" BoolSpec ")"; _ . BoolSpec9 ::= "" BoolSpec ""; _ . BoolSpec9 ::= "" BoolSpec ""; _ . BoolSpec8 ::= BoolSpec9 ; _ . BoolSpec7 ::= BoolSpec8 ; _ . BoolSpec6 ::= BoolSpec7 ; _ . BoolSpec5 ::= BoolSpec6 ; _ . BoolSpec4 ::= BoolSpec5 ; _ . BoolSpec3 ::= BoolSpec4 ; _ . BoolSpec2 ::= BoolSpec3 ; _ . BoolSpec1 ::= BoolSpec2 ; _ . BoolSpec ::= BoolSpec1 ; NumId . NumExpr2 ::= Ident ; NumConstI . NumExpr2 ::= Integer ; NumConstD . NumExpr2 ::= Double; NumAdd . NumExpr1 ::= NumExpr1 AdditiveOp NumExpr2; NumMult . NumExpr ::= NumExpr MultOp NumExpr1; _ . NumExpr2 ::= "(" NumExpr ")" ; _ . NumExpr1 ::= NumExpr2 ; _ . NumExpr ::= NumExpr1; OpPlus . AdditiveOp ::= "+" ; OpMinus . AdditiveOp ::= "-" ; OpTimes . MultOp ::= "*" ; OpDiv . MultOp ::= "/" ; BoolConstTrue. BoolConst ::= "TRUE"; BoolConstFalse. BoolConst ::= "FALSE"; BoolConstFTP. BoolConst ::= "FTP"; BoolConstLAST. BoolConst ::= "LAST"; Op1Alone . OpOne ::= Op1Name; Op1MTL. OpOne ::= Op1Name "[" OrdOp Number "]"; Op1MTLRange. OpOne ::= Op1Name "[" Number "," Number "]"; NumberInt . Number ::= Integer; _ . Number ::= "" Number ""; _ . Number ::= "" Number ""; OrdOpLT . OrdOp ::= "<"; OrdOpLE . OrdOp ::= "<="; OrdOpEQ . OrdOp ::= "="; OrdOpNE . OrdOp ::= "!="; OrdOpGT . OrdOp ::= ">"; OrdOpGE . OrdOp ::= ">="; Op1Pre. Op1Name ::= "pre"; Op1X. Op1Name ::= "X"; Op1G. Op1Name ::= "G"; Op1F. Op1Name ::= "F"; Op1Y. Op1Name ::= "Y"; Op1Z. Op1Name ::= "Z"; Op1Hist. Op1Name ::= "H"; Op1O. Op1Name ::= "O"; Op2S. OpTwo ::= "S"; Op2T. OpTwo ::= "T"; Op2V. OpTwo ::= "V"; Op2U. OpTwo ::= "U"; ogma-language-smv-1.10.0/tests/0000755000000000000000000000000015064246136014437 5ustar0000000000000000ogma-language-smv-1.10.0/tests/smv_good0000644000000000000000000000375215064246136016206 0ustar0000000000000000((H ((((! flight_mode) & (Y flight_mode)) & (Y TRUE)) -> (Y (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) S (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) & (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode))))))))) & (((! ((! flight_mode) & (Y flight_mode))) S ((! ((! flight_mode) & (Y flight_mode))) & (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) -> (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) S (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) & (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))))) ogma-language-smv-1.10.0/tests/Main.hs0000644000000000000000000000376015064246136015665 0ustar0000000000000000-- Copyright 2020 United States Government as represented by the Administrator -- of the National Aeronautics and Space Administration. All Rights Reserved. -- -- Disclaimers -- -- Licensed under the Apache License, Version 2.0 (the "License"); you may -- not use this file except in compliance with the License. You may obtain a -- copy of the License at -- -- https://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, WITHOUT -- WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the -- License for the specific language governing permissions and limitations -- under the License. -- -- | Test SMV language library. module Main where -- External imports import Data.Either ( isLeft, isRight ) import Test.Framework ( Test, defaultMainWithOpts ) import Test.Framework.Providers.QuickCheck2 ( testProperty ) import Test.QuickCheck ( Property ) import Test.QuickCheck.Monadic ( assert, monadicIO, run ) -- Internal imports import qualified Language.SMV.ParSMV as SMV ( myLexer, pBoolSpec ) -- | Run all unit tests for the SMV parser. main :: IO () main = defaultMainWithOpts tests mempty -- | All unit tests for the SMV parser. tests :: [Test.Framework.Test] tests = [ testProperty "Parse SMV (correct case)" propParseSMVOk , testProperty "Parse SMV (incorrect case)" propParseSMVFail ] -- | Test the SMV parser on a well-formed boolean specification. propParseSMVOk :: Property propParseSMVOk = monadicIO $ do content <- run $ readFile "tests/smv_good" let program = SMV.pBoolSpec $ SMV.myLexer content assert (isRight program) -- | Test the SMV parser on an incorrect boolean specification. propParseSMVFail :: Property propParseSMVFail = monadicIO $ do content <- run $ readFile "tests/smv_bad" let program = SMV.pBoolSpec $ SMV.myLexer content assert (isLeft program) ogma-language-smv-1.10.0/tests/smv_bad0000644000000000000000000000375215064246136016004 0ustar0000000000000000((D ((((! flight_mode) & (Y flight_mode)) & (Y TRUE)) -> (Y (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) S (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) & (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode))))))))) & (((! ((! flight_mode) & (Y flight_mode))) S ((! ((! flight_mode) & (Y flight_mode))) & (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) -> (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) S (((O[=10] (((conflict_detected) & ((Y (! (conflict_detected))) | (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))) & (! (( replanning_mode ))))) -> (O[<10] ((flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))) | (( replanning_mode ))))) & (flight_mode & ((! (Y TRUE)) | (Y (! flight_mode)))))))) ogma-language-smv-1.10.0/src/0000755000000000000000000000000015064246136014064 5ustar0000000000000000ogma-language-smv-1.10.0/src/.keep0000644000000000000000000000000015064246136014777 0ustar0000000000000000ogma-language-smv-1.10.0/src/Language/0000755000000000000000000000000015064246136015607 5ustar0000000000000000ogma-language-smv-1.10.0/src/Language/SMV/0000755000000000000000000000000015064246136016254 5ustar0000000000000000ogma-language-smv-1.10.0/src/Language/SMV/Substitution.hs0000644000000000000000000000573415064246136021335 0ustar0000000000000000module Language.SMV.Substitution where import qualified Language.SMV.AbsSMV as SMV substituteBoolExpr subs e = foldr subBS e subs -- Substitute name x if it matches the old name oName subsName (oName, nName) x = if x == oName then nName else x -- Substitute a name in all identifiers in a boolean expression subBS sub' = mapBoolSpecIdent (subsName sub') -- Traverse a boolean expression applying a function to all identifiers mapBoolSpecIdent :: (String -> String) -> SMV.BoolSpec -> SMV.BoolSpec mapBoolSpecIdent f boolSpec = case boolSpec of SMV.BoolSpecSignal (SMV.Ident i) -> SMV.BoolSpecSignal (SMV.Ident (f i)) SMV.BoolSpecConst bc -> SMV.BoolSpecConst bc SMV.BoolSpecNum e -> SMV.BoolSpecNum (mapNumExprIdent f e) SMV.BoolSpecCmp spec1 op2 spec2 -> SMV.BoolSpecCmp (mapBoolSpecIdent f spec1) op2 (mapBoolSpecIdent f spec2) SMV.BoolSpecNeg spec -> SMV.BoolSpecNeg (mapBoolSpecIdent f spec) SMV.BoolSpecAnd spec1 spec2 -> SMV.BoolSpecAnd (mapBoolSpecIdent f spec1) (mapBoolSpecIdent f spec2) SMV.BoolSpecOr spec1 spec2 -> SMV.BoolSpecOr (mapBoolSpecIdent f spec1) (mapBoolSpecIdent f spec2) SMV.BoolSpecXor spec1 spec2 -> SMV.BoolSpecXor (mapBoolSpecIdent f spec1) (mapBoolSpecIdent f spec2) SMV.BoolSpecImplies spec1 spec2 -> SMV.BoolSpecImplies (mapBoolSpecIdent f spec1) (mapBoolSpecIdent f spec2) SMV.BoolSpecEquivs spec1 spec2 -> SMV.BoolSpecEquivs (mapBoolSpecIdent f spec1) (mapBoolSpecIdent f spec2) SMV.BoolSpecOp1 op spec -> SMV.BoolSpecOp1 op (mapBoolSpecIdent f spec) SMV.BoolSpecOp2 spec1 op2 spec2 -> SMV.BoolSpecOp2 (mapBoolSpecIdent f spec1) op2 (mapBoolSpecIdent f spec2) -- Traverse a numeric expression applying a function to all identifiers mapNumExprIdent :: (String -> String) -> SMV.NumExpr -> SMV.NumExpr mapNumExprIdent f numExpr = case numExpr of SMV.NumId (SMV.Ident i) -> SMV.NumId (SMV.Ident (f i)) SMV.NumConstI c -> SMV.NumConstI c SMV.NumConstD c -> SMV.NumConstD c SMV.NumAdd expr1 op expr2 -> SMV.NumAdd (mapNumExprIdent f expr1) op (mapNumExprIdent f expr2) SMV.NumMult expr1 op expr2 -> SMV.NumMult (mapNumExprIdent f expr1) op (mapNumExprIdent f expr2)