Decidable fragments of many-sorted logic

Authors:
Aharon Abadi;Alexander Rabinovich;Mooly Sagiv
Affiliations:
School of Computer Science, Tel-Aviv University, Israel;School of Computer Science, Tel-Aviv University, Israel;School of Computer Science, Tel-Aviv University, Israel
Venue:
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Year:
2007

Citing 7
Cited 2

The Z notation: a reference manual

The Z notation: a reference manual
Alloy: a lightweight object modelling notation

ACM Transactions on Software Engineering and Methodology (TOSEM)
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
Decidable verification for reducible timed automata specified in a first order logic with time

Theoretical Computer Science
SPASS & FLOTTER Version 0.42

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
The design and implementation of VAMPIRE

AI Communications - CASC
Simulating reachability using first-order logic with applications to verification of linked data structures

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Decidable fragments of many-sorted logic

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of many-sorted (typed) first- order logic. The motivation is that types simplify the complexity of mixed quantifiers when they quantify over different types. We noticed that many real world verification problems can be formalized by quantifying over different types in such a way that the relations between types remain simple. Our main result is a decidable fragment of many-sorted first-order logic that captures many real world specifications.