Amanote Research
Register
Sign In
Reasoning About Comprehensions With First-Order SMT Solvers
doi 10.1145/1529282.1529411
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2009
Authors
K. Rustan M. Leino
Rosemary Monahan
Publisher
ACM Press
Related search
Symbolic Optimization With SMT Solvers
Adding Decision Procedures to SMT Solvers Using Axioms With Triggers
Journal of Automated Reasoning
Computational Theory
Software
Artificial Intelligence
Mathematics
Basic Logic, SMT Solvers and Finitely Generated Varieties of GBL-algebras
Reasoning With Concept Diagrams About Antipatterns
Reasoning About Justified Belief
Reasoning About the Past With Two-Way Automata
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Causal Reasoning About Quantities
About Nondecreasing Solutions for First Order Neutral Functional Differential Equations
Reasoning About Skills and Competencies
IFIP Advances in Information and Communication Technology
Computer Networks
Information Systems
Management
Communications
