FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465863zbMATH OpenOpenAlexFDO

Authors Sumit Gulwani, George C. Necula, Ashish Tiwari

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Equational classes, universal algebra in model theory (03C05) Automata and formal grammars in connection with logical questions (03D05) Subalgebras, congruence relations (08A30) Applications of universal algebra in computer science (08A70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• On algorithmic problems for joins of pseudovarieties
• A generalization of join and an algorithmic recognition problem
• scientific article; zbMATH DE number 1088042
• An algorithm for distributive unification
• Towards a unified complexity theory of total functions
• Towards a Unified Complexity Theory of Total Functions
• Algorithmic properties of models with signatures containing two unary functional symbols
• scientific article; zbMATH DE number 3866609
• scientific article; zbMATH DE number 4112560
• On algebras of algorithms and specifications over uninterpreted data

Cited in

(5)

• The map equality domain
• Combining equational reasoning
• Self-full ceers and the uniform join operator
• Fast approximations of quantifier elimination
• Semantic foundations of equality saturation

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465863)