The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Assignment Commands with Array References
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Reasoning About Recursively Defined Data Structures
Journal of the ACM (JACM)
Communications of the ACM
An algorithm for reasoning about equality
Communications of the ACM
Off-line and on-line algorithms for deducing equalities
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
Equational theories and database constraints
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Decidability of the purely existential fragment of the theory of term algebras
Journal of the ACM (JACM)
Fast algorithms for testing unsatisfiability of ground horn clauses with equations
Journal of Symbolic Computation
Efficient optimization of simple chase join expressions
ACM Transactions on Database Systems (TODS)
On the relationship of congruence closureand unification
Journal of Symbolic Computation
Relational specifications of infinite query answers
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A decision procedure for conjunctive query disjointness
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Look ma, no hashing, and no arrays neither
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nonlinear pattern matching in trees
Journal of the ACM (JACM)
Theorem proving using equational matings and rigid E-unification
Journal of the ACM (JACM)
Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
A program integration algorithm that accommodates semantics-preserving transformations
ACM Transactions on Software Engineering and Methodology (TOSEM)
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM (JACM)
Taxonomic syntax for first order inference
Journal of the ACM (JACM)
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Optimization of functional programs by grammar thinning
ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of using history for equational systems with applications
Journal of the ACM (JACM)
Equivalence checking of datapaths based on canonical arithmetic expressions
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
ACM Transactions on Database Systems (TODS)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Reasoning About Recursively Defined Data Structures
Journal of the ACM (JACM)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Properties of functional-dependency families
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Efficient deductive methods for program analysis
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A system and language for building system-specific, static analyses
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Denali: a goal-directed superoptimizer
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Transformational programming: applications to algorithms and systems
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Using redundancies to find errors
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
On the complexity and axiomatizability of consistent database states
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
An optimizing prolog front-end to a relational query system
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Algorithms and reductions for rewriting problems. II
Information Processing Letters
Using redundancies to find errors
ACM SIGSOFT Software Engineering Notes
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
Security against Inference Attacks on Negative Information in Object-Oriented Databases
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Using Decision Procedures with a Higher-Order Logic
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
A Rewrite Rule Based Framework for Combining Decision Procedures
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
Breuer's grow factor algorithm in computer algebra
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Global methods in the flow graph approach to retargetable microcode generation
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Interactive Design of Object-Oriented Schema
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Journal of Automated Reasoning
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
Imperative program optimization by partial evaluation
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A survey of trace exploration tools and techniques
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
Equivalence checking of arithmetic expressions using fast evaluation
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
E-generalization using grammars
Artificial Intelligence
Concepts: linguistic support for generic programming in C++
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Denali: A practical algorithm for generating optimal code
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decision procedures for term algebras with integer constraints
Information and Computation - Special issue: Combining logical systems
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Fast congruence closure and extensions
Information and Computation
Multiplierless multiple constant multiplication
ACM Transactions on Algorithms (TALG)
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Functional dependencies and incomplete information
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Combining Proof-Producing Decision Procedures
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Using Dynamic Symbolic Execution to Improve Deductive Verification
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Unique normal forms and confluence of rewrite systems: persistence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
E-generalization using grammars
Artificial Intelligence
Combination of convex theories: Modularity, deduction completeness, and explanation
Journal of Symbolic Computation
Validated Proof-Producing Decision Procedures
Electronic Notes in Theoretical Computer Science (ENTCS)
Challenges in satisfiability modulo theories
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Deciding equality in the constructor theory
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A language for generic programming in the large
Science of Computer Programming
Expression equivalence checking using interval analysis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Unification and matching on compressed terms
ACM Transactions on Computational Logic (TOCL)
Satisfiability modulo theories: introduction and applications
Communications of the ACM
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Computing all subtree repeats in ordered ranked trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Nelson-Oppen, shostak and the extended canonizer: a family picture with a newborn
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
A metamodel for the compact but lossless exchange of execution traces
Software and Systems Modeling (SoSyM)
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Subtyping recursive types modulo associative commutative products
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Proof-producing congruence closure
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae
Computing all subtree repeats in ordered trees
Information Processing Letters
Towards modular algebraic specifications for pointer programs: a case study
Rewriting Computation and Proof
Journal of Automated Reasoning
Fast algorithms for finding a minimum repetition representation of strings and trees
Discrete Applied Mathematics
Extending Type Inference to Variational Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tree compression with top trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
XML tree structure compression using RePair
Information Systems
| Hi-index | 0.04 |