On algebraic specification languages based on modular rewriting systems
| Project/Area Number |
22700027
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Software
|
|---|
| Research Institution | Toyama Prefectural University (2011-2012)
Kanazawa University (2010) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2011: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | 項書換えシステム / 代数仕様 / モジュールシステム / テスト生成 / プログラム変換 / 形式手法 / 仕様変換 / 仕様検証 / UML / 項書き換えシステム / CafeOBJ / Maude |
|---|
| Research Abstract |
We studied about term rewriting systems to give an operational semantics of specification execution for algebraic specificationlanguages with sophisticated module systems. Our main result is a termination proving methods based on module structures. Termination is one of the most important properties of term rewriting, which guarantees any specification execution terminates in finite time. By our results, we can prove termination of large and complex algebraic specifications with conditional equations efficiently.
|
Report
(4 results)
Research Products
(15 results)
