Detecting specification errors in declarative languages with constraints

Authors:
Ethan K. Jackson;Wolfram Schulte;Nikolaj Bjørner
Affiliations:
Microsoft Research, Redmond, WA;Microsoft Research, Redmond, WA;Microsoft Research, Redmond, WA
Venue:
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Year:
2012

Citing 17
Cited 1

Abstract interpretation and application to logic programs

Journal of Logic Programming
Implementing Regular Tree Expressions

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
CDuce: an XML-centric general-purpose language

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Regular expression types for XML

ACM Transactions on Programming Languages and Systems (TOPLAS)
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Symbolic model checking of declarative relational models

Proceedings of the 28th international conference on Software engineering
Fast congruence closure and extensions

Information and Computation
Model transformation in the large

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars

Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types

Journal of the ACM (JACM)
CSP(M): Constraint Satisfaction Problem over Models

MODELS '09 Proceedings of the 12th International Conference on Model Driven Engineering Languages and Systems
Type inference for datalog with complex type hierarchies

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
An algebraic semantics for MOF

Formal Aspects of Computing
Reasoning about metamodeling with formal specifications and automatic proofs

Proceedings of the 14th international conference on Model driven engineering languages and systems
An abstract domain to discover interval linear equalities

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation

Engineering domain-specific languages with formula 2.0

Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Declarative specification languages with constraints are used in model-driven engineering to specify formal semantics, define model transformations, and describe domain constraints. While these languages support concise specifications, they are nevertheless prone to difficult semantic errors. In this paper we present a type-theoretic approach to the static detection of specification errors. Our approach infers approximations of satisfying assignments and represents them via a canonical regular type system. Type inference is experimentally efficient and type judgments are comprehensible by the user.