Efficient deductive methods for program analysis
Pages 102 - 103
Abstract
No abstract available.
References
[1]
L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. Logic and Computation, 4(3):217-247, 1994. Revised version of Research Report MPI-I-91-208, 1991.
[2]
L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of transitive relations. J. Association for Computing Machinery, 45(6):1007-1049, 1998.
[3]
L. Bachmair, H. Ganzinger, Chr. Lynch, and W. Snyder. Basic pararnodulation. Information and Computation, 121(2):172-192, 1995. Revised version of Research Report MPI-I-93-236, 1993.
[4]
Leo Bachmair and Ashish Tiwari. Abstract congruence closure and specializations. In David McAllester, editor, Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, LNAI 1831, pages 64-78, Pittsburgh, PA, USA, June 17-20, 2000. Springer-Verlag.
[5]
William F. Dowling and Jean H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming, 3:267-284, 1984.
[6]
P. J. Downey, R. Sethi, and R. E. Tarjaa. Variations on the common subexpressions problem. J. Association for Computing Machinery, 27(4):771-785, 1980.
[7]
M. Fihndrich, J.S. Foster, S. Zhendong, and A Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, pages 85-96, Montreal, Canada, June 17- 19 1998. ACM.
[8]
F. Henglein. Breaking through the n 3 barrier: Faster object type inference. Theory and Practice of Object Systems, 5(1):57-72, 1999. A preliminary version appeared in FOOL4.
[9]
D. A. McAllester. Automated recognition of tractability in inference relations. J. Association for Computing Machinery, 40(2):284-303, 1993.
[10]
David McAllester. On the complexity analysis of static analyses. In A. Cortesi and R. File, editors, Static Analysis - 6th International Symposium, SAS'99, LNCS 1694, pages 312-329, Venice, Italy, September 1999. Springer-Verlag.
[11]
R. Nieuwenhuis and A. Rubio. Theorem proving with ordering and equality constrained clauses. J. Symbolic Computation, 19(4):321-352, 1995.
Index Terms
- Efficient deductive methods for program analysis
Recommendations
Completing Herbelin's programme
TLCA'07: Proceedings of the 8th international conference on Typed lambda calculi and applicationsIn 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the λ-calculus, specifically a variant which manipulates ...
Using clausal deductive databases for defining semantics in disjunctive deductive databases
This paper investigates the novel concept of i>clausal deductive databases (cd-databases), which are special normal deductive databases - i.e., deductive databases which may contain default negation in rule bodies - over a typed meta-language i>L...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
March 2001303 pagesISSN:0362-1340EISSN:1558-1160DOI:10.1145/373243Issue’s Table of Contents- Editors:
- Cindy Norris,
- James B. Fenwick
Copyright © 2001 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 2001
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
POPL '01 Paper Acceptance Rate 24 of 126 submissions, 19%;
Overall Acceptance Rate 824 of 4,130 submissions, 20%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 365Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in