2001
DOI: 10.1145/503271.503219
|View full text |Cite
|
Sign up to set email alerts
|

A micromodularity mechanism

Abstract: A simple mechanism for structuring specifications is described. By modelling structures as atoms, it remains entirely first-order and thus amenable to automatic analysis. And by interpreting fields of structures as relations, it allows the same relational operators used in the formula language to be used for dereferencing. An extension feature allows structures to be developed incrementally, but requires no textual inclusion nor any notion of subtyping. The paper demonstrates the flexibility of the mechanism b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0

Year Published

2002
2002
2013
2013

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 30 publications
(25 citation statements)
references
References 5 publications
0
25
0
Order By: Relevance
“…Hughes and Bultan translated XACML policies to the Alloy language [16] and checked their properties using the Alloy Analyzer. Fisler et al [14] developed a tool called Margrave that uses multi-terminal binary decision diagrams [9] to verify user-specified properties and perform change-impact analysis.…”
Section: Related Workmentioning
confidence: 99%
“…Hughes and Bultan translated XACML policies to the Alloy language [16] and checked their properties using the Alloy Analyzer. Fisler et al [14] developed a tool called Margrave that uses multi-terminal binary decision diagrams [9] to verify user-specified properties and perform change-impact analysis.…”
Section: Related Workmentioning
confidence: 99%
“…Our model of objects can be compared to that of the formal specification language Alloy [17], which has a similar semantic basis as Z. Alloy's structuring mechanism, the signature, is inspired by the Z schema.…”
Section: Related Workmentioning
confidence: 99%
“…Because every relational constant is isomorphic to a graph, Thm. 1 equates the task of finding Sym(P ) to that of computing the automorphisms of the graphs that correspond to the constants in D-a problem with no known polynomial 1 Recall that cycle notation for permutations [34] indicates that each element in a pair of parenthesis is mapped to the one following it, with the last element being mapped to the first. The elements that are fixed under a permutation are not mentioned, i.e.…”
Section: Symmetry Detectionmentioning
confidence: 99%
“…We have established the feasibility of using a relational engine for design analysis [1], code analysis [2,3] and test case generation [4] in earlier work. The prototype tool that we describe in this paper has been applied to design analysis, code analysis [5], and course scheduling [6]; it is also a mean Sudoku player.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation