Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Decidability of the purely existential fragment of the theory of term algebras
Journal of the ACM (JACM)
Object-oriented modeling and design
Object-oriented modeling and design
Feature trees over arbitrary structures
Specifying syntactic structures
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
Reasoning About Recursively Defined Data Structures
Journal of the ACM (JACM)
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Automating first-order relational logic
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Abstract data types and software validation
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
The pointer assertion logic engine
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
The Definition of Standard ML
Korat: automated testing based on Java predicates
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Introduction to Functional Programming
Introduction to Functional Programming
CASL: the common algebraic specification language
Theoretical Computer Science
TVLA: A System for Implementing Static Analyses
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Object models as heap invariants
Programming methodology
Structural Subtyping of Non-Recursive Types is Decidable
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Abstract data types, then and now
Software pioneers
Automatic testing of software with structurally complex inputs
Automatic testing of software with structurally complex inputs
Automated size analysis for OCL
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Automating Algebraic Specifications of Non-freely Generated Data Types
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Bounded relational analysis of free data types
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Automated Flaw Detection in Algebraic Specifications
Journal of Automated Reasoning
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Automatic proof and disproof in Isabelle/HOL
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Monotonicity Inference for Higher-Order Formulas
Journal of Automated Reasoning
An imperative extension to alloy
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Monotonicity inference for higher-order formulas
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Nitpick: a counterexample generator for higher-order logic based on a relational model finder
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
TestEra: A tool for testing Java programs using alloy specifications
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
| Hi-index | 0.01 |
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when using the language of sets and relations to reason about structured values such as algebraic datatypes. The key idea of our technique is to identify a natural syntactic class of formulas in relational logic for which reasoning about infinite structures can be reduced to reasoning about finite structures. As a result, when a formula belongs to this class, we can use existing finite model finding tools to check whether the formula holds in the desired infinite model.