ACM Home Page
Please provide us with feedback. Feedback
Algebraic specification techniques for parametric types with logic-based constraints
Full text PdfPdf (363 KB)
Source
Symposium on Applied Computing archive
Proceedings of the 2009 ACM symposium on Applied Computing table of contents
Honolulu, Hawaii
SESSION: Programming languages track table of contents
Pages 1890-1897  
Year of Publication: 2009
ISBN:978-1-60558-166-8
Authors
David Briggs  University of Southern Maine, Portland, ME
Suad Alagić  University of Southern Maine, Portland, ME
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1529282.1529705
What is a DOI?

ABSTRACT

Mainstream object-oriented languages now offer capabilities of generic types with bounded type parameters, but they typically do not provide support for specifying semantic requirements on the type parameters' methods beyond conformance of signatures. Regrettably, even object-oriented assertion languages, such as JML, have nontrivial limitations in this regard. Yet many interesting parameterized types require additional semantic features if they are to function as intended. We illustrate the issues with a case study of project scheduling based on the Project Management Institute's generic characterization of task breakdowns. We consider algebraic techniques for instantiating parametric types in such a way that the semantic requirements expressed by logic-based constraints propagate to the instantiating types. These techniques argue for more general bindings of actual type parameters for the formal ones which do not have the restrictions of current programming languages. We show that types equipped with constraints should be viewed as theories, and the bindings as morphisms of types as theories. We translate these software specifications into theories in the PVS specification language. These proposals lead to conclusions about language features for more general, semantic bindings of the actual for the formal type parameters, at least in the assertion languages.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
S. Alagić, M. Royer, and D. Crews, Temporal verification of Java-like classes, Proceedings of the FTfJP 2006 Workshop, http://www.disi.unige.it/person/AnconaD/FTfJP06/.
 
3
 
4
M. Barnett, K. R. M. Leino, and W. Schulte, The Spec# programming system: an overview, Microsoft Research 2004. Also in Proceedings of CASSIS 2004.
 
5
6
7
 
8
9
 
10
 
11
12
 
13
G. T. Leavens, E. Poll, C. Clifton, Y. Cheon, C. Ruby, D. Cook, P. Muller, and J. Kiniry, JML Reference Manual, 2005, http://www.cs.iastate.edu/leavens/JML/.
14
 
15
 
16
 
17
S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Clavert: PVS Language Reference, SRI International, Computer Science Laboratory, Menlo Park, California, http://pvs.csl.sri.com.
 
18
Project Management Institute, A Guide to Project Management Body of Knowledge, Project Management Institute, 2000.
 
19
 
20
M. Royer, S. Alagić, and D. Dillon, Reflective constraint management for languages on virtual platforms, Journal of Object Technology, Vol. 6, No. 10, 2007.
 
21
 
22
23

Collaborative Colleagues:
David Briggs: colleagues
Suad Alagić: colleagues