CN103150200B - A kind of C language is to the conversion method of MSVL language - Google Patents
A kind of C language is to the conversion method of MSVL language Download PDFInfo
- Publication number
- CN103150200B CN103150200B CN201310120182.1A CN201310120182A CN103150200B CN 103150200 B CN103150200 B CN 103150200B CN 201310120182 A CN201310120182 A CN 201310120182A CN 103150200 B CN103150200 B CN 103150200B
- Authority
- CN
- China
- Prior art keywords
- statement
- converted
- language
- msvl
- exp
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Devices For Executing Special Programs (AREA)
- Stored Programmes (AREA)
Abstract
A kind of computer language converting system, it for being converted into MSVL LISP program LISP by C programmer, it includes, Lexical Analysis Module, character string is converted to word sequence by it, and described character string includes the definition of the keyword in C language, identifier, constant, operator, header file and comment line；Syntax Analysis Module, it is based on the associated lexical rule of the C language of defined in yacc, and then identifies specific statement in C language；Conversion processing module, C language is converted into MSVL language according to the language conversion rule between C language and MSVL language by it.
Description
Technical field
The present invention relates to computer programming language C language technical field, particularly relate to a kind of C language structured statement conversion method to MSVL correspondence statement.
Background technology
C language is a kind of general, programming language of process type, is widely used in the exploitation of system and application software.There is the features such as efficient, flexible, feature richness, expressiveness are strong and higher transplantability, programmer enjoys favor.Draft internation standard C11 that C language that 2011ISO formally announces is new, improves the compatibility to C++, and new characteristic is increased in C language.New function includes supporting multithreading, based on supporting Unicode under ISO/IECTR19769:2004 specification, it is provided that more macrodefinitions for inquiring about float characteristic and static statement function.Although C language is widely used in the exploitation of sorts of systems and software, but is to ensure that its correctness and safety become a huge challenge.Model inspection is an effective means of checking system correctness, but the abstract model of C programmer to be extracted become at present faced by a difficult point and challenge.
Sequential logic is widely used to the field such as soft project, Design of Digital Circuit as a kind of system modelling with verification tool.ITL is extended by projection temporal logic (PTL), temporal logic language MSVL is one of PTL can perform subset, it is one and integrates modeling (Modeling), emulation (Simulation) and the sequential logic programming language of checking (Verification), the description of the modeling of system Yu character is unified in same logical framework by it, by the character of model inspection technical identification system.Projection temporal logic is in real-time and hybrid system, particularly the form of safety critical system describes and checking aspect is also exceedingly useful, such as, manned space system is a complicated hybrid real-time system, in order to ensure the safety and reliability of system, traditional method of testing can not meet far away requirement, and it is particularly useful for using formal verification technique.
It addition, the linguistic structure of projection temporal logic programming language MSVL is similar with C language, it is easy to produce corresponding transformational relation.By realizing from C language to the conversion of MSVL language, target program after converting is verified, utilizes the thought that equivalence converts, it is possible to achieve the extraction to C language formalized model, and this model can be carried out model inspection, this will be greatly improved the safety and reliability of C programmer.
Summary of the invention
The present invention provides a kind of computer language converting system, and C language can be converted into MSVL language, detect with the program to C language by it.It specifically includes a kind of C language conversion method to MSVL language, and it provides Lexical Analysis Module, syntax Analysis Module and conversion processing module, said method comprising the steps of:
The first step: C programmer is imported Lexical Analysis Module, this step includes being converted to character string word sequence, and described character string includes the definition of the keyword in C language, identifier, constant, operator, header file and comment line；
Second step: the word conductance obtained in step one is entered syntax Analysis Module, this step includes based on the associated lexical rule of the C language of defined in yacc, and then identifies specific statement in C language；
3rd step: C language statement sequence second step syntactic analysis identified is converted into the MSVL statement of correspondence in conversion processing module according to corresponding transformational rule, and the transformational rule between described C language and MSVL language includes expression formula transformational rule, statement transformational rule and statement block transformational rule；
Described expression formula transformation rule is as follows:
Converting expression formula, it is assumed that x and y is standard symbol, e represents a constant or variable, as follows with reference to rule:
IF expression is e, is converted into MSVL expression formula and returns e；
IF expression is [x++ | x--], is converted into MSVL statement x:=x+1andskip or x:=x-1andskip；
IF expression is x=y, is converted into MSVL statement x:=yandskip；
IF expression is x==y, is converted into MSVL statement x==y；
IF expression be x [+,-, * ,/, %,！=] y, be converted into MSVL expression formula x [+,-, * ,/, %,！=] y；
IF expression is x*=y (*=[<|>]), is converted into MSVL expression formula x=y or x*y；
IF expression be x [+|-| * |/| %]=y, be converted into x:=x [+|-| * |/| %] yandskip；
IF expression is x | | y, it is converted into MSVL statement xory；
IF expression is x, y, is converted into MSVL statement x, y；
IF expression is (x), is converted into MSVL statement for (x)；
4th step: use sequential operator "；" connect the MSVL statement sequence obtained, obtain MSVL program.
On the basis of technique scheme, the structured statement in the C language described in syntax Analysis Module includes basic representation statement, while statement, if statement, if-else statement, for statement, switch statement, printf statement and scanf statement.
On the basis of technique scheme, in the C language described in described syntax Analysis Module, the conditional statement of the while statement of structured statement, the loop body part of for statement and if statement, if-else statement is a statement block.
On the basis of technique scheme, described statement transformational rule and statement block transformational rule are as follows,
Converting basic statement, it is assumed that exp is a constant expression, block is a statement block, one complete statement of behalf, and x is a variable, and parameter represents a character string, and rule is with reference to as follows:
If statement is exp, is converted into exp；
If statement is x=exp, is converted into x:=expandskip；
If statement is if statement, uses the transformation rule of IF statement to change statement；
If statement is that { block} is converted into MSVL statement while (exp) { block} to while (exp)；
If statement is int declarative statement, uses the transformational rule of declarative statement to change statement；
If statement is for (sexp1；Exp2) { block} is converted into swhile (exp) { block}；
If statement is printf (" parameter ", exp), is converted into output (exp)；
If statement is scanf (" parameter ", exp), is converted into input (exp)；
Wherein, as follows to the transformational rule of IF statement:
If statement shape such as if (exp) s, it is converted into if (exp) then{s}；
If { block} is converted into if (exp) then{block} to statement shape such as if (exp)；
If { block1}else{block2} is converted into if (exp) then{block1}else{block2} to statement shape such as if (exp)；
If statement is that { { block2} is converted into if (exp1) then{block1}elseif (exp2) then{block2} to block1}elseif (exp2) to if (exp1)；
Assuming that var_list represents the variable that string connects with ", ", exp_list represents the expression formula that string connects with ", ", then the transformational rule of declarative statement is as follows:
If declarative statement is intx, it is converted into intx；
If declarative statement is intvar_list, it is converted into intvar_list；
If declarative statement is intx=exp, it is converted into intx；X=expandskip；
If declarative statement is intexp_list, each expression formula using the rule of declarative statement convert, the independent MSVL being converted into correspondence respectively states language.
On the basis of technique scheme, the transformation rule of described basic statement is for the conversion of statement block, and converts every basic statement the most one by one, until all statements convert complete in statement block.
Relative to prior art, the present invention by being converted into MSVL language by the transformation definition to basic statement by C language, it is possible to achieve the conversion to c program, and the MSVL language obtaining equivalence equally performs to obtain the simulation result of c program.The propositional logic needing character MSVL of checking can be represented, c program is converted to MSVL program, therefore model construction and property description use same language so that model and carry out under same logical framework with verifying, just can conveniently realize the model inspection to C programmer.The modeling of MSVL and the logical foundations of model checking method are belonging to the sequential logic of formalization method, send elsewhere bright by non-formal C programmer, by formal method to its model inspection, it is ensured that the model that c program is built carries out the validity and reliability verified and detect.With formal language, it can be carried out model inspection, it is ensured that program safety is reliable with after the C language coding being familiar with.
Accompanying drawing explanation
Fig. 1 is the present invention flow process frame diagram to C programmer model inspection.
Detailed description of the invention
The present invention provides a kind of computer language converting system, and C language can be converted into MSVL language, detect with the program to C language by it.It specifically includes, a kind of computer language converting system, it for being converted into MSVL LISP program LISP by C programmer, it includes, Lexical Analysis Module, character string is converted to word sequence by Lexical Analysis Module, and character string includes the definition of the keyword in C language, identifier, constant, operator, header file and comment line；Also including syntax Analysis Module, syntax Analysis Module is based on the associated lexical rule of the C language of defined in yacc, and then identifies specific statement in C language；Also including conversion processing module, C language is converted into MSVL language according to the language conversion rule between C language and MSVL language by conversion processing module.
Refer to Fig. 1, the method that use of the present invention computer language converting system C language be converted into MSVL language is described below.
The first step: C programmer is imported Lexical Analysis Module, this step includes being converted to character string word sequence, and described character string includes the definition of the keyword in C language, identifier, constant, operator, header file and comment line.
After morphological analysis, program becomes the sequence of keyword, constant, identifier and operator, wherein will be left in the basket after the header file part in C programmer and comment section identification, and will not send into next module.In the above-mentioned C language source program asking greatest common divisor and least common multiple, the morphological analysis rule used has:
1. run into header file #include<stdio.h>statement, do not do any operation；
2. run into keyword return label title, return MAIN as int returns INT, main；
3. run into identifier and return to this labelling of Yacc syntax analyzer, such as num1, num2, a etc.；
4. run into operator and return the token name of operator, as！=,=, %, * etc.；
5. run into space to be left in the basket, do not do any operation.
So far, defined by morphological rule, it is achieved that utilize lex morphological analysis that the program of original language C language is carried out the function of morphological analysis.
Second step: the word conductance obtained in step one is entered syntax Analysis Module, this step includes based on the associated lexical rule of the C language of defined in yacc, and then identifies specific statement in C language.
As shown in Figure 1, the c program lex lexical analyzer of input is realized morphological analysis, the word stream generated and mark stream are as the input of yacc syntax analyzer, syntactic analyser is according to the associated lexical rule of the C language of defined in yacc file, and then identify specific statement, that identifies has: basic representation statement (such as a <b), while statement and if statement, and the statement block in if statement and while statement.
3rd step: C language statement sequence second step syntactic analysis identified is converted into the MSVL statement of correspondence in conversion processing module according to corresponding transformational rule；
4th step: use sequential operator "；" connect the MSVL statement sequence obtained, obtain MSVL program.
Structured statement in C language described in syntax Analysis Module includes basic representation statement, while statement, if statement, if-else statement, for statement, switch statement, printf statement and scanf statement.
In C language described in syntax Analysis Module, the conditional statement part of the while statement of structured statement, the loop body part of for statement and if statement, if-else statement is regarded as a statement block.
Definition transformation rule includes that definition is to expression formula transformational rule, statement transformational rule and statement block transformational rule.
On the basis of technique scheme, the transformation rule of described expression formula is as follows:
Converting expression formula, it is assumed that x and y is standard symbol, e represents a constant or variable, as follows with reference to rule:
IF expression is e, then be converted into MSVL expression formula and return e；
IF expression is [x++ | x--], then be converted into MSVL statement x:=x+1andskip or x:=x-1andskip；
IF expression is x=y, then be converted into MSVL statement x:=yandskip；
IF expression is x==y, then be converted into MSVL statement x==y；
IF expression be x [+,-, * ,/, %,！=] y, then be converted into MSVL expression formula x [+,-, * ,/, %,！=] y；
IF expression is x*=y (*=[<|>]), then be converted into MSVL expression formula x=y or x*y；
IF expression be x [+|-| * |/| %]=y, then be converted into x:=x [+|-| * |/| %] yandskip；
IF expression is x&&y, then be converted into MSVL statement xandskip；
IF expression is x | | y, then it is converted into MSVL statement xory；
IF expression is x, y, then be converted into MSVL statement x, y；
IF expression is (x), then be converted into MSVL statement for (x)；
Declarative statement transformational rule and statement block transformational rule below, basic statement is converted, basic statement includes statement and statement block, assume that exp is a constant expression, block is a statement block, one complete statement of behalf, and x is a variable, parameter represents a character string, and rule is with reference to as follows:
If statement is null statement, is converted into null statement；
If statement is exp, is converted into exp；
If statement is x=exp, is converted into x:=expandskip；
If statement is if statement, uses the transformation rule of IF statement to change statement；
If statement is that { block} is converted into MSVL statement while (exp) { block} to while (exp)；
If statement is int declarative statement, uses the transformational rule of declarative statement to change statement；
If statement is for (sexp1；Exp2) { block} is converted into swhile (exp) { block；exp2}；
If statement is printf (" parameter ", exp), is converted into output (exp)；
If statement is scanf (" parameter ", exp), is converted into input (exp)；
Wherein, as follows to the transformational rule of IF statement:
If statement shape such as if (exp) s, it is converted into if (exp) then{s}
If { block} is converted into if (exp) then{s} to statement shape such as if (exp)
If { block1}else{block2} is converted into if (exp) then{block1}else{block2} to statement shape such as if (exp)
If { { block2} is converted into if (exp1) then{block1}elseif (exp2) { block2} to block1}elseif (exp2) to statement shape such as if (exp1)
Assuming that var_list represents the variable that string connects with ", ", exp_list represents the expression formula that string connects with ", ", and ei is the symbol occurred in exp_list, then the transformational rule of declarative statement is as follows:
If declarative statement is intx, it is converted into intx；
If declarative statement is intvar_list, it is converted into intvar_list；
If declarative statement is intx=exp, it is converted into intx；X=expandskip；
If declarative statement is intexp_list, each expression formula uses the rule of declarative statement convert, is converted into the independent MSVL declarative statement of correspondence respectively
The transformation rule of basic statement is for the conversion of statement block, and converts every basic statement the most one by one, until all statements convert complete in statement block.
Claims (5)
1. C language is to a conversion method for MSVL language, and it provides Lexical Analysis Module, syntax Analysis Module and conversion processing module, it is characterised in that: said method comprising the steps of:
The first step: C programmer is imported Lexical Analysis Module, this step includes being converted to character string word sequence, and described character string includes the definition of the keyword in C language, identifier, constant, operator, header file and comment line；
Second step: the word conductance obtained in the first step is entered syntax Analysis Module, this step includes based on the associated lexical rule of the C language of defined in yacc, and then identifies specific statement in C language；
3rd step: C language statement sequence second step syntactic analysis identified is converted into the MSVL statement of correspondence in conversion processing module according to corresponding transformational rule, and the transformational rule between described C language and MSVL language includes expression formula transformational rule, statement transformational rule and statement block transformational rule；
Described expression formula transformational rule is as follows:
Converting expression formula, it is assumed that x and y is standard symbol, e represents a constant or variable, as follows with reference to rule:
IF expression is e, is converted into MSVL expression formula and returns e；
IF expression is [x++ | x--], is converted into MSVL statement x:=x+1andskip or x:=x-1andskip；
IF expression is x=y, is converted into MSVL statement x:=yandskip；
IF expression is x==y, is converted into MSVL statement x==y；
IF expression be x [+,-, * ,/, %,！=] y, be converted into MSVL expression formula x [+,-, * ,/, %,！=] y；
IF expression is x*=y (*=[<|>]), is converted into MSVL expression formula x=y or x*y；
IF expression be x [+|-| * |/| %]=y, be converted into x:=x [+|-| * |/| %] yandskip；
IF expression is x | | y, it is converted into MSVL statement xory；
IF expression is x, y, is converted into MSVL statement x, y；
IF expression is (x), is converted into MSVL statement for (x)；
4th step: use sequential operator "；" connect the MSVL statement sequence obtained, obtain MSVL program.
A kind of C language the most according to claim 1 is to the conversion method of MSVL language, it is characterised in that: in syntax Analysis Module, the structured statement in C language includes basic representation statement, while statement, if statement, if-else statement, for statement, switch statement, printf statement and scanf statement.
A kind of C language the most according to claim 1 is to the conversion method of MSVL language, it is characterised in that: in described syntax Analysis Module, in C language, the conditional statement of the while statement of structured statement, the loop body part of for statement and if statement, if-else statement is a statement block.
A kind of C language the most as claimed in claim 1 is to the conversion method of MSVL language, it is characterised in that: described statement transformational rule and statement block transformational rule are as follows,
Converting basic statement, it is assumed that exp is a constant expression, block is a statement block, one complete statement of behalf, and x is a variable, and parameter represents a character string, and rule is with reference to as follows:
If statement is exp, is converted into exp；
If statement is x=exp, is converted into x:=expandskip；
If statement is if statement, uses the transformation rule of if statement to change statement；
If statement is that { block} is converted into MSVL statement while (exp) { block} to while (exp)；
If statement is int declarative statement, uses the transformational rule of declarative statement to change statement；
If statement is for (sexp1；Exp2) { block} is converted into swhile (exp) { block}；
If statement is printf (" parameter ", exp), is converted into output (exp)；
If statement is scanf (" parameter ", exp), is converted into input (exp)；
Wherein, as follows to the transformation rule of if statement:
If statement shape such as if (exp) s, it is converted into if (exp) then{s}；
If { block} is converted into if (exp) then{block} to statement shape such as if (exp)；
If { block1}else{block2} is converted into if (exp) then{block1}else{block2} to statement shape such as if (exp)；
If statement is that { { block2} is converted into if (exp1) then{block1}elseif (exp2) then{block2} to block1}elseif (exp2) to if (exp1)；
Assuming that var_list represents the variable that string connects with ", ", exp_list represents the expression formula that string connects with ", ", then the transformational rule of declarative statement is as follows:
If declarative statement is intx, it is converted into intx；
If declarative statement is intvar_list, it is converted into intvar_list；
If declarative statement is intx=exp, it is converted into intx；X=expandskip；
If declarative statement is intexp_list, each expression formula using the rule of declarative statement convert, the independent MSVL being converted into correspondence respectively states language.
A kind of C language the most according to claim 4 is to the conversion method of MSVL language, it is characterized in that: the conversion of statement block is included by the transformation rule of described basic statement, the most every basic statement is converted, until all statements convert complete in statement block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310120182.1A CN103150200B (en) | 2013-04-08 | 2013-04-08 | A kind of C language is to the conversion method of MSVL language |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310120182.1A CN103150200B (en) | 2013-04-08 | 2013-04-08 | A kind of C language is to the conversion method of MSVL language |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103150200A CN103150200A (en) | 2013-06-12 |
| CN103150200B true CN103150200B (en) | 2016-08-03 |
Family
ID=48548300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310120182.1A Active CN103150200B (en) | 2013-04-08 | 2013-04-08 | A kind of C language is to the conversion method of MSVL language |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103150200B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103455362A (en) * | 2013-09-27 | 2013-12-18 | 西安电子科技大学 | Automatic hardware language transformation system |
| CN104572072B (en) * | 2014-12-01 | 2017-09-29 | 北京百度网讯科技有限公司 | A kind of language transfer method and equipment to the program based on MVC pattern |
| CN104503816B (en) * | 2014-12-30 | 2017-09-19 | 西安电子科技大学 | A kind of hardware language VHDL to MSVL automated conversion system |
| CN104657542B (en) * | 2015-01-27 | 2017-12-19 | 西安电子科技大学 | A kind of Petri net model detection method based on MSVL |
| CN104657190B (en) * | 2015-02-14 | 2018-05-11 | 南威软件股份有限公司 | A kind of method of the enhancing switch statement function based on C language family |
| CN106991166A (en) * | 2017-03-31 | 2017-07-28 | 北京奇艺世纪科技有限公司 | A kind of big data processing method and processing device |
| CN108037913B (en) * | 2017-12-21 | 2021-08-17 | 西安邮电大学 | Method for converting xUML4MC model into MSVL (modeling, simulation and verification language) program and computer-readable storage medium |
| CN108090053A (en) * | 2018-01-09 | 2018-05-29 | 亢世勇 | A kind of language conversion output device and method |
| CN109739512B (en) * | 2018-12-28 | 2022-04-12 | 江苏极光网络技术有限公司 | Analytic language text type analysis and conversion method |
| CN109885307B (en) * | 2019-01-07 | 2022-03-01 | 西安邮电大学 | Method for converting pthread library multithread C program into MSVL program and computer program |
| CN112306470B (en) * | 2020-10-19 | 2022-04-08 | 南京航空航天大学 | Method for simplifying, converting and automatically verifying complex synchronous language program |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1503459A (en) * | 2002-11-27 | 2004-06-09 | 华为技术有限公司 | Protocol conversion device and method based on text character stream report |
| CN101499015A (en) * | 2009-03-18 | 2009-08-05 | 北京和利时系统工程有限公司 | Method and converter for converting high level language to other high level languages |
| CN102012991A (en) * | 2010-11-09 | 2011-04-13 | 北京神舟航天软件技术有限公司 | Static analysis-based checking method of safety rules of C language |
| CN102222004A (en) * | 2011-07-01 | 2011-10-19 | 福建富士通信息软件有限公司 | Method for transforming switch special language into C language |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2000029678A (en) * | 1998-05-18 | 2000-01-28 | Ntt Communication Ware Kk | Program language conversion method, device therefor and recording medium |
-
2013
- 2013-04-08 CN CN201310120182.1A patent/CN103150200B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1503459A (en) * | 2002-11-27 | 2004-06-09 | 华为技术有限公司 | Protocol conversion device and method based on text character stream report |
| CN101499015A (en) * | 2009-03-18 | 2009-08-05 | 北京和利时系统工程有限公司 | Method and converter for converting high level language to other high level languages |
| CN102012991A (en) * | 2010-11-09 | 2011-04-13 | 北京神舟航天软件技术有限公司 | Static analysis-based checking method of safety rules of C language |
| CN102222004A (en) * | 2011-07-01 | 2011-10-19 | 福建富士通信息软件有限公司 | Method for transforming switch special language into C language |
Non-Patent Citations (1)
| Title |
|---|
| Model Checking C Programs with MSVL;Yan Yu,Zhenhua Duan,Cong Tian,and Mengfei Yang;《Structured Object-Oriented Formal Language and Method》;20130801;第88－103页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103150200A (en) | 2013-06-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103150200B (en) | A kind of C language is to the conversion method of MSVL language | |
| CN108985073B (en) | Highly-automated intelligent contract formalized verification system and method | |
| CN109753288B (en) | Intelligent contract compiling method suitable for formalized verification | |
| US9418230B2 (en) | Automated tools for building secure software programs | |
| Garzón et al. | Umple: A framework for model driven development of object-oriented systems | |
| Bozzano et al. | Symbolic model checking and safety assessment of altarica models | |
| CN103455362A (en) | Automatic hardware language transformation system | |
| CN105044653A (en) | Software conformance detection method for smart electric meters | |
| CN110442527A (en) | Automation restorative procedure towards bug report | |
| CN108037913A (en) | A kind of conversion method of xUML4MC models to MSVL LISP program LISPs, computer program | |
| CN108763064A (en) | A kind of code tester generation method and device based on black box function and machine learning | |
| Torlak et al. | Applications and extensions of Alloy: past, present and future | |
| CN111222141B (en) | Automobile electronic control unit code vulnerability analysis method and system | |
| Leroy | Mechanized semantics for compiler verification | |
| Miyazawa et al. | Refinement-oriented models of Stateflow charts | |
| CN104317711A (en) | Path-based method and system for verifying software implementation and design uniformity | |
| Rubin | Parameterised verification of autonomous mobile-agents in static but unknown environments | |
| Nair et al. | A static code analysis tool for control system software | |
| CN111176995B (en) | Test method and test system based on big data test case | |
| Kim et al. | An integrated framework with UML and Object-Z for developing a precise and understandable specification: the light control case study | |
| CN115357492A (en) | Formal verification method and device for Java software | |
| Kausch et al. | An Approach for Logic-based Knowledge Representation and Automated Reasoning over Underspecification and Refinement in Safety-Critical Cyber-Physical Systems. | |
| CN115310095A (en) | Block chain intelligent contract mixed formal verification method and system | |
| CN109359055B (en) | Data testing method and device | |
| Semeráth et al. | Validation of Derived Features and Well-Formedness Constraints in DSLs: By Mapping Graph Queries to an SMT-Solver |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |