SIGN IN
SIGN UP
Proving termination of membership equational programs
Full Text:
Pdf
Buy this Article
Authors:
Francisco Durán
Universidad de Málaga, Spain
Salvador Lucas
Universidad Politécnica de Valencia, Spain
Josß Meseguer
University of Illinois at Urbana-Champaign, USA
Claude Marché
INRIA Futurs, Université Paris-Sud, France
Xavier Urbain
INRIA Futurs, Université Paris-Sud, France
2004 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 138
· Citation Count: 24
Published in:
· Proceeding
PEPM '04
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Pages 147 - 158
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-835-0
doi>
10.1145/1014007.1014022
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
languages
mechanical verification
membership equational logic
program transformation
software/program verification
term rewriting
termination
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder