Name
Abstract | ||
|---|---|---|
We consider first-order specifications together with the restriction to accept only programmable algebras as models. We provide a criterion which links this approach with the "generation principle": all programmable models of any specification SP that meets this criterion are reachable. We also show an example of a specification which does not satisfy the criterion and admits a programmable yet nonreachable model. Moreover, a general method of showing the existence of programmable but nonreachable models for a class of first-order specifications is given. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1137/S0097539797322528 | SIAM J. Comput. |
Keywords | Field | DocType |
programmable algebra,generation principle,first-order specifications,specification sp,nonreachable model,first-order specification,programmable data types,programmable model,general method,data types,data type,first order | Algebraic specification,Discrete mathematics,First order,Reachability,Data type,Specification,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 6 | 0097-5397 |
Citations | PageRank | References |
1 | 0.37 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grazyna Mirkowska | 1 | 93 | 28.90 |
| Andrzej Salwicki | 2 | 93 | 32.89 |
| Marian Srebrny | 3 | 75 | 9.71 |
| Andrzej Tarlecki | 4 | 1514 | 124.61 |