메뉴 건너뛰기




Volumn 3582, Issue , 2005, Pages 399-414

Strategic term rewriting and its application to a Vdm-sl to Sql conversion

Author keywords

Program calculation; Sql; Strategic term rewriting; Vdm

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; THEOREM PROVING;

EID: 26444488586     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11526841_27     Document Type: Conference Paper
Times cited : (12)

References (38)
  • 1
    • 26444455218 scopus 로고    scopus 로고
    • Bringing Camila and SetCalc Together - The bams. cam and ppd. cam Camila Toolset demos
    • DI/UM, Braga, December. [45 p. doc.]
    • J.J. Almeida, L.S. Barbosa, F.L. Neves, and J.N. Oliveira. Bringing Camila and SetCalc Together - the bams. cam and ppd. cam Camila Toolset demos. Technical report, DI/UM, Braga, December 1997. [45 p. doc.].
    • (1997) Technical Report
    • Almeida, J.J.1    Barbosa, L.S.2    Neves, F.L.3    Oliveira, J.N.4
  • 2
    • 26444556140 scopus 로고    scopus 로고
    • Development of an industrial strength grammar for VDM
    • Universidade do Minho
    • T. Alves and J. Visser. Development of an industrial strength grammar for VDM. Technical Report DI-PURe-05.04.29, Universidade do Minho, 2005.
    • (2005) Technical Report , vol.DI-PURE-05.04.29
    • Alves, T.1    Visser, J.2
  • 5
    • 84957646720 scopus 로고
    • Deriving relational database programs from formal specifications
    • Maurice Naftalin, B. Tim Denvir, and Miquel Bertran, editors, FME '94: Industrial Benefit of Formal Methods, Second International Symposium of Formal Methods Europe, Barcelona, Spain, October 24-18, 1994, Proceedings. Springer
    • R.S.M. de Barros. Deriving relational database programs from formal specifications. In Maurice Naftalin, B. Tim Denvir, and Miquel Bertran, editors, FME '94: Industrial Benefit of Formal Methods, Second International Symposium of Formal Methods Europe, Barcelona, Spain, October 24-18, 1994, Proceedings, volume 873 of Lecture Notes in Computer Science, pages 703-723. Springer, 1994.
    • (1994) Lecture Notes in Computer Science , vol.873 , pp. 703-723
    • De Barros, R.S.M.1
  • 8
    • 0345299336 scopus 로고
    • Addison-Wesley Publishing Company, Inc.
    • E. F. Codd. Missing Information. Addison-Wesley Publishing Company, Inc., 1990.
    • (1990) Missing Information
    • Codd, E.F.1
  • 9
    • 0014797273 scopus 로고
    • A relational model of data for large shared data banks
    • June
    • E.F. Codd. A relational model of data for large shared data banks. Communications of the ACM, 13(6):377-387, June 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.6 , pp. 377-387
    • Codd, E.F.1
  • 11
    • 84935305650 scopus 로고
    • Modularizing the formal description of a database system
    • Springer
    • J.S. Fitzgerald and C.B. Jones. Modularizing the formal description of a database system, volume 428 of Lecture Notes in Computer Science. Springer, 1990.
    • (1990) Lecture Notes in Computer Science , vol.428
    • Fitzgerald, J.S.1    Jones, C.B.2
  • 13
  • 14
    • 35048831392 scopus 로고    scopus 로고
    • Compiling exceptions correctly
    • Dexter Kozen and Carron Shankland, editors, Mathematics of Program Construction, 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004, Proceedings. Springer
    • G. Hutton and J. Wright. Compiling exceptions correctly. In Dexter Kozen and Carron Shankland, editors, Mathematics of Program Construction, 7th International Conference, MPC 2004, Stirling, Scotland, UK, July 12-14, 2004, Proceedings, volume 3125 of Lecture Notes in Computer Science, pages 211-227. Springer, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3125 , pp. 211-227
    • Hutton, G.1    Wright, J.2
  • 17
    • 0006450424 scopus 로고
    • Series in Computer Science. Prentice-Hall International. C.A. R. Hoare
    • C.B. Jones. Software Development - A Rigorous Approach. Series in Computer Science. Prentice-Hall International, 1980. C.A. R. Hoare.
    • (1980) Software Development - A Rigorous Approach
    • Jones, C.B.1
  • 18
    • 23044531871 scopus 로고    scopus 로고
    • Grammars as contracts
    • Proceedings of the Second International Conference on Generative and Component-based Software Engineering (GCSE 2000). Springer
    • M. de Jonge and J. Visser. Grammars as contracts. In Proceedings of the Second International Conference on Generative and Component-based Software Engineering (GCSE 2000), volume 2177 of Lecture Notes in Computer Science, pages 85-99. Springer, 2000.
    • (2000) Lecture Notes in Computer Science , vol.2177 , pp. 85-99
    • De Jonge, M.1    Visser, J.2
  • 19
    • 18944398268 scopus 로고    scopus 로고
    • Object-oriented tree traversal with JJForester
    • M. van den Brand and D. Parigot, editors. Elsevier Science. Proc. Workshop on Language Descriptions, Tools and Applications
    • T. Kuipers and J. Visser. Object-oriented tree traversal with JJForester. In M. van den Brand and D. Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science, 2001. Proc. Workshop on Language Descriptions, Tools and Applications.
    • (2001) Electronic Notes in Theoretical Computer Science , vol.44
    • Kuipers, T.1    Visser, J.2
  • 21
    • 0141650650 scopus 로고    scopus 로고
    • Scrap your boilerplate: A practical design pattern for generic programming
    • March. Proc. ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003)
    • R. Lämmel and S. Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. ACM SIGPLAN Notices, 38(3):26-37, March 2003. Proc. ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003).
    • (2003) ACM SIGPLAN Notices , vol.38 , Issue.3 , pp. 26-37
    • Lämmel, R.1    Jones, S.P.2
  • 22
    • 16644381796 scopus 로고    scopus 로고
    • Strategic polymorphism requires just two combinators!
    • arXiv, December
    • R. Lämmel and J. Visser. Strategic polymorphism requires just two combinators! Technical Report cs.PL/0212048, arXiv, December 2002.
    • (2002) Technical Report , vol.CS.PL-0212048
    • Lämmel, R.1    Visser, J.2
  • 23
    • 35248827617 scopus 로고    scopus 로고
    • A strafunski application letter
    • V. Dahl and P. Wadler, editors, Proc. of Practical Aspects of Declarative Programming (PADL'03). Springer-Verlag, January
    • R. Lämmel and J. Visser. A Strafunski Application Letter. In V. Dahl and P. Wadler, editors, Proc. of Practical Aspects of Declarative Programming (PADL'03), volume 2562 of LNCS, pages 357-375. Springer-Verlag, January 2003.
    • (2003) LNCS , vol.2562 , pp. 357-375
    • Lämmel, R.1    Visser, J.2
  • 25
    • 0003648103 scopus 로고
    • Series in Computer Science. Prentice-Hall International. C.A. R. Hoare, series editor
    • C. Morgan. Programming from Specification. Series in Computer Science. Prentice-Hall International, 1990. C.A. R. Hoare, series editor.
    • (1990) Programming from Specification
    • Morgan, C.1
  • 26
    • 26444537704 scopus 로고    scopus 로고
    • Master's thesis, Facultad de Cs. Físico Matemáticas y Naturales, University of San Luis, Argentina. (Submitted.)
    • C. Necco. Polytypic data processing. Master's thesis, Facultad de Cs. Físico Matemáticas y Naturales, University of San Luis, Argentina, 2005. (Submitted.).
    • (2005) Polytypic Data Processing
    • Necco, C.1
  • 29
    • 0040832771 scopus 로고
    • A reification calculus for model-oriented software specification
    • April
    • J.N. Oliveira. A reification calculus for model-oriented software specification. Formal Aspects of Computing, 2(1): 1-23, April 1990.
    • (1990) Formal Aspects of Computing , vol.2 , Issue.1 , pp. 1-23
    • Oliveira, J.N.1
  • 30
    • 0039646422 scopus 로고
    • Software reification using the SETS calculus
    • Tim Denvir, Cliff B. Jones, and Roger C. Shaw, editors. ISBN 0387197524, Springer-Verlag, 8-10 January. (Invited paper)
    • J.N. Oliveira. Software reification using the SETS calculus. In Tim Denvir, Cliff B. Jones, and Roger C. Shaw, editors, Proc. of the BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development, London, UK, pages 140-171. ISBN 0387197524, Springer-Verlag, 8-10 January 1992. (Invited paper).
    • (1992) Proc. of the BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development, London, UK , pp. 140-171
    • Oliveira, J.N.1
  • 32
    • 26444480947 scopus 로고    scopus 로고
    • Calculate databases with 'simplicity'
    • September, Nottingham, UK
    • J.N. Oliveira. Calculate databases with 'simplicity', September 2004. Presentation at the IFIP WG 2.1 #59 Meeting, Nottingham, UK.
    • (2004) IFIP WG 2.1 #59 Meeting
    • Oliveira, J.N.1
  • 35
    • 84874275328 scopus 로고    scopus 로고
    • A core language for rewriting
    • C. Kirchner and H. Kirchner, editors, Proc. International Workshop on Rewriting Logic and its Applications (WRLA'98), Pont-à-Mousson, France, September. Elsevier Science
    • E. Visser and Z. Benaissa. A Core Language for Rewriting. In C. Kirchner and H. Kirchner, editors, Proc. International Workshop on Rewriting Logic and its Applications (WRLA'98), volume 15 of ENTCS, Pont-à-Mousson, France, September 1998. Elsevier Science.
    • (1998) ENTCS , vol.15
    • Visser, E.1    Benaissa, Z.2
  • 36
    • 0035551809 scopus 로고    scopus 로고
    • Visitor combination and traversal control
    • Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA 2001)
    • J. Visser. Visitor combination and traversal control. ACM SIGPLAN Notices, 36(11):270-282, 2001. Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA 2001).
    • (2001) ACM SIGPLAN Notices , vol.36 , Issue.11 , pp. 270-282
    • Visser, J.1
  • 37
    • 84915842339 scopus 로고
    • All recursive types defined using products and sums can be implemented using pointers
    • Clifford Bergman, Roger D. Maddux, and Don Pigozzi, editors, Algebraic Logic and Universal Algebra in Computer Science. Springer
    • E. G. Wagner. All recursive types defined using products and sums can be implemented using pointers. In Clifford Bergman, Roger D. Maddux, and Don Pigozzi, editors, Algebraic Logic and Universal Algebra in Computer Science, volume 425 of Lecture Notes in Computer Science. Springer, 1990.
    • (1990) Lecture Notes in Computer Science , vol.425
    • Wagner, E.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.