Understanding specification languages through their model theory

Authors:
Ethan K. Jackson;Wolfram Schulte
Affiliations:
Microsoft Research, Redmond, WA;Microsoft Research, Redmond, WA
Venue:
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Year:
2012

Citing 9
Cited 0

Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Alloy: A New Technology for Software Modelling

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Kodkod: a relational model finder

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
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
SecPAL: Design and semantics of a decentralized authorization language

Journal of Computer Security - Digital Identity Management (DIM 2007)
Components, platforms and possibilities: towards generic automation for MDA

EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Datalog programs and their stable models

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Dedalus: datalog in time and space

Datalog'10 Proceedings of the First international conference on Datalog Reloaded

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the design of specification languages through their model theory. We show how language constructs and specification idioms are deeply rooted in the underlying model theory. We also show that some problems are fundamentally difficult to specify due to the underlying foundation of the language. The languages we study are Alloy, Maude, and FORMULA. FORMULA attempts to handle a large class of specifications problems while utilizing constraint solvers for formal analysis.