A sufficient completeness reasoning tool for partial specifications

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 165-174

  Hendrix, Joe ^a   Clavel, Manuel ^b   Meseguer, José ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SCIENCE; FUNCTION EVALUATION; MEMBERSHIP FUNCTIONS; THEOREM PROVING;

CONDITIONAL MEMBERSHIPS; INDUCTIVE THEOREM PROVER (ITP); REASONING;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 24944563138     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_13     Document Type: Conference Paper

References (21)

1. Meseguer, J.: Membership algebra as a logical framework for equational specification. In: In 12th International Workshop on Recent Trends in Algebraic Development Techniques (WADT'97). Volume 1376 of Lecture Notes in Computer Science., Springer-Verlag (1998) 18-61
2. Bouhoula, A., Jouannaud, J.P., Meseguer, J.: Specification and proof in membership equational logic. Theoretical Computer Science 236 (2000) 35-132
3. Meseguer, J., Roşu, G.: A total approach to partial algebraic specification. In: Proceedings of ICALP. Volume 2380 of Lecture Notes in Computer Science., Springer (2002) 572-584
4. Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational abstractions. In: Proceedings of CADE. Volume 2741 of Lecture Notes in Computer Science., Springer (2003) 2-16
5. Kapur, D., Subramaniam, M.: New uses of linear arithmetic in automated theorem proving by induction. Journal of Automated Reasoning 16 (1996) 39-78
6. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285 (2002) 187-243
7. Misra, J.: Powerlist: a structure for parallel recursion. ACM Transactions on Programming Languages and Systems 16 (1994) 1737-1767
8. Hendrix, J., Clavel, M., Meseguer, J.: A sufficient completeness reasoning tool for partial specifications (extended technical report). Available on tool website at http://maude.cs.uiuc.edu/tools/scc/ (2005)
9. Clavel, M.: The ITP tool's home page, http://maude.sip.ucm.es/itp (2005)
10. Guttag, J.: The Specification and Application to Programming of Abstract Data Types. PhD thesis, University of Toronto (1975) Computer Science Department, Report CSRG-59.
11. Guttag, J.V., Horning, J.J.: The algebraic specification of abstract data types. Acta Inf. 10 (1978) 27-52
12. Nipkow, T., Weikum, G.: A decidability result about sufficient- completeness of axiomatically specified abstract data types. In: Proc. 6th GI-Conf. Theoretical Computer Science. Volume 145 of Lecture Notes in Computer Science., Springer (1983) 257-268
13. Kapur, D., Narendran, P., Zhang, H.: On sufficient-completeness and related properties of term rewriting systems. Acta Informatica 24 (1987) 395-415
14. Kapur, D., Narendran, P., Rosenkrantz, D.J., Zhang, H.: Sufficient-completeness, ground-reducibility and their complexity. Acta Informatica 28 (1991) 311-350
15. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata (1997) release October, 1st 2002.
16. Bouhoula, A., Rusinowitch, M.: SPIKE: A system for automatic inductive proofs. In: Algebraic Methodology and Software Technology, AMAST '95, Proceedings. Volume 936 of Lecture Notes in Computer Science., Springer (1995) 576-577
17. Kapur, D.: An automated tool for analyzing completeness of equational specifications. In: Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA), August 17-19, 1994, Seattle, WA, USA. Software Engineering Notes, Special Issue, ACM Press (1994) 28-43
18. Ohsaki, H., Seki, H., Takai, T.: Recognizing boolean closed a-tree languages with membership conditional rewriting mechanism. In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings. Volume 2706 of Lecture Notes in Computer Science., Springer (2003) 483-498
19. Clavel, M., Durán, F., Eker, S., Meseguer, J.: Building equational proving tools by reflection in rewriting logic. In: Cafe: An Industrial-Strength Algebraic Formal Method. Elsevier (2000)
20. Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving termination of membership equational programs. In: Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2004, Verona, Italy, August 24-25, 2004, ACM Press (2004) 147-158
21. Lucas, S., Meseguer, J., Marché, C.: Operational termination of generalized conditional term rewriting systems. Submitted. (2004)