Crossing the syntactic barrier: hom-disequalities for H₁-clauses

DOI10.1007/978-3-642-31606-7_26MaRDI QIDQ2914718zbMATH OpenOpenAlexFDO

Authors Andreas Reuss, Helmut Seidl

Publication date 20 September 2012

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31606-7_26

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45)

Recommendations

• Paths, tree homomorphisms and disequalities for H₁-clauses
• Extending H₁-clauses with disequalities
• Extending \({\mathcal H}_1\)-clauses with path disequalities
• Extending decidable clause classes via constraints
• The HOM problem is decidable

Cites work

• Bottom-Up Tree Automata with Term Constraints
• Deciding H₁ by resolution
• Extending H₁-clauses with disequalities
• Extending \({\mathcal H}_1\)-clauses with path disequalities
• scientific article; zbMATH DE number 1948386 (Why is no real title available?)
• On guarding nested fixpoints
• The HOM problem is decidable
• Towards an automatic analysis of security protocols in first-order logic
• Verification, Model Checking, and Abstract Interpretation

Cited in

(3)

• Extending H₁-clauses with disequalities
• Extending \({\mathcal H}_1\)-clauses with path disequalities
• Paths, tree homomorphisms and disequalities for H₁-clauses

This page was built for publication: Crossing the syntactic barrier: hom-disequalities for \({\mathcal H}_1\)-clauses

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