Semantics of temporal classes

Information and Computation

Volumn 163, Issue 1, 2000, Pages 60-102

  Alagić, Suad ^a  

^a Wichita State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; OBJECT ORIENTED PROGRAMMING; QUERY LANGUAGES;

DECLARATIVE SYSTEMS;

SEMANTICS;

EID: 0034716051     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2891     Document Type: Article

References (44)

1. Abadi, M., and Manna, Z. (1987). Temporal logic programming, in "Proceedings, Symposium on Logic Programming '87," pp. 4-16, IEEE Computer Society Press.
2. Alagić, S., Sunderraman, R., and Bagai, R. (1994). Declarative object-oriented programming: Inheritance, subtyping and prototyping, in "Proceedings, ECOOP '94," Lecture Notes in Computer Science, Vol. 821, pp. 236-259, Springer-Verlag, Berlin/New York.
3. Alagić, S., and Sunderraman, R. (1994). Expressibility of typed logic paradigms for object-oriented databases, in " Proceedings, BNCOD-12," Lecture Notes in Computer Science, Vol. 826, pp. 73-89, Springer-Verlag, Berlin/New York.
4. Alagić, S. (1995). A statically typed, temporal object-oriented database technology, in "Transactions on Information and Systems," Vol. 78, pp. 1469-1476, IEICE.
5. Alagić, S., and Alagić, M. (1997). Order-sorted model theory for temporal executable specifications, Theoret. Comput. Sci. 179, 273-299.
6. Alagić, S. (1997). A temporal constraint system for object-oriented databases, in "Proceedings, Constraint Databases and Applications," Lecture Notes in Computer Science, Vol. 1191, pp. 208-218, Springer-Verlag, Berlin/New York.
7. Alagić, S. (1998). Constrained matching is type safe, in "Proceedings, the Sixth Int. Workshop on Database Programming Languages," Lecture Notes in Computer Science, Vol. 1369, pp. 78-96, Springer-Verlag, Berlin/New York.
8. Alagić, S., Solorzano, J., and Gitchell, D. (1998). Orthogonal to the Java imperative, in "Proceedings, ECOOP '98," Lecture Notes in Computer Science, Vol. 1445, pp. 212-233, Springer-Verlag, Berlin/New York.
9. Alagić, S. (1999). Temporal object-oriented programming, Object-Oriented Systems 6, 1-42.
10. Baudinet, M. (1992). A simple proof of the completeness of temporal logic programming, in "Intensional Logics for Programming, Studies in Logic and Computation 1" (L. F. Del Cerro and M. Penttonen, Eds.), pp. 51-83, Clarendon Press, Oxford.
11. Berry, G., and Gonthier, G. (1992). The ESTEREL synchronous programming language: design, semantics, implementation, Sci. Comput. Programming 19, 87-152.
12. Bruce, K. (1993). Safe type checking in a statically typed object-oriented programming language, in "Proceedings, Conference on Functional Programming," pp. 285-298, Assoc. Comput. Mach. Press, New York.
13. Bruce, K., Schuett, A., and van Gent, R. (1995). PolyTOIL: a type-safe polymorphic object-oriented language, in "Proceedings, ECOOP '95," Lecture Notes in Computer Science, Vol. 952, pp. 27-51, Springer-Verlag, Berlin/New York.
14. Cook, W. R., Hill, W. L., and Canning, P. S. (1990). Inheritance is not subtyping, in "Proceedings, Conference on Principles of Programming Languages," pp. 125-135, Assoc. Comput. Mach. Press, New York.
15. Diaconescu, R. (1996). Foundations of behavioral specification in rewriting logic, Electron. Notes Theoret. Comput. Sci. 4, 225-243.
16. Ehrich, H. D., Denker, G., and Sernadas, A. (1993). Constructing systems as object communities, in "Proceedings, Theory and Practice of Software Development - TAPSOFT '93" (M. C. Gaudel and J. P. Jouannaud, Eds.), Lecture Notes in Computer Science, Vol. 668, pp. 453-467, Springer-Verlag, Berlin/New York.
17. Fiadeiro, J. L., and Maibaum, T. (1995). Sometimes "tomorrow" is "sometime": Action refinement in a temporal logic of objects, in " Proceedings, 2nd Int. Temporal Logic Conference '94," Lecture Notes in Artificial Intelligence, Vol. 827, pp. 48-66, Springer-Verlag, Berlin/New York.
18. Fisher, M. (1994). A survey of concurrent METATEM - the language and its applications, in "Proceedings, 2nd Int. Temporal Logic Conference," Lecture Notes in Artificial Intelligence, Vol. 827, pp. 480-505, Springer-Verlag, Berlin/New York.
19. Futatsugi, K., Goguen J., Jouannaud J., and Meseguer J. (1985). Principles of OBJ2, in "Proceedings, POPL '85" (B. K. Reid, Ed.), pp. 52-66, Assoc. Comput. Mach. Press, New York.
20. Goguen J., and Burstall R. (1992). Institutions: abstract model theory for specification and programming, J. Assoc. Comput. Mach. 39, 92-146.
21. Goguen J. (1991). Types as theories, in "Topology and Category Theory in Computer Science" (G. M. Reed, A. W. Roscoe, and R. F. Wachter, Eds.), pp. 357-390, Clarendon Press, Oxford.
22. Goguen J., and Meseguer J. (1986). EQLOG: Equality, types, and generic modules for logic programming, in "Logic Programming: Functions, Relations and Equations" (D. Degroot and G. Lindstrom, Eds.), pp. 295-363, Prentice-Hall, Englewood Cliffs, NJ.
23. Goguen J., and Meseguer J. (1987). Unifying functional, object-oriented and relational programming with logical semantics, in "Research Directions in Object-Oriented Programming" (B. Shriver and P. Wegner, Eds.), pp. 417-477, MIT Press, Cambridge, MA.
24. Goguen J. and Meseguer J. (1987). Models and equality for logical programming, in "Proceedings, TAPSOFT '87" (H. Ehrig, G. Levi, R. Kowalski, and U. Montanari, Eds.), Lecture Notes in Computer Science, Vol. 250, 1-22, Springer-Verlag, Berlin/New York.
25. Goguen J., and Meseguer J. (1992). Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoret. Comput. Sci. 105, 217-273.
26. Haxthausen A. E., and Nickl, F. (1996). Pushouts of order-sorted algebraic specifications, in "Algebraic Methodology and Software Technology (AMAST 96)" (M. Wirsing and M. Nivat, Eds.), Lecture Notes in Computer Science, Vol. 1101, pp. 132-147, Springer-Verlag, Berlin/New York.
27. Jacobs, B. (1996). Coalgebraic specifications and models of deterministic hybrid systems, in "Algebraic Methodology and Software Technology (AMAST 96)" (M. Wirsing and M. Nivat, Eds.), Lecture Notes in Computer Science, Vol. 1101, pp. 520-535, Springer-Verlag, Berlin/New York.
28. Jacobs, B. (1996). Inheritance and cofree constructions, in "Proceedings, ECOOP '96," (P. Cointe, Ed.), Lecture Notes in Computer Science, Vol. 1098, pp. 210-231, Springer-Verlag, Berlin/New York.
29. Jacobs, B. (1996). Objects and classes, co-algebraically, in "Object Orientation with Parallelism and Persistence" (B. Freitag, C. B. Jones, C. Lengauer, and H.-J. Schek, Eds.) pp. 83-103, Kluwer, Dordrecht.
30. Jungclaus, R., Saake, G., Hartmann, T., and Sernadas, C. (1996). TROLL - A language for object-oriented specification of information systems, ACM Trans. Inform. Systems 14, 175-211.
31. Kifer, M., Lausen, G., and Wu, J. (1995). Logical foundation of object-oriented and frame-based languages, J. Assoc. Comput. Mach. 42, 741-843.
32. Kroger, F. (1987). "Temporal Logic of Programs," EATCS Monograph on Theoretical Computer Science, Springer-Verlag, Berlin/New York.
33. Lamport, L. (1983). Specifying concurrent program modules, ACM Trans. Programming Languages Systems 5, 190-222.
34. Lloyd, J. W. (1987). "Foundations of Logic Programming," Springer-Verlag, Berlin/New York.
35. Liskov, B., and Wing, J. M. (1994). A behavioral notion of subtyping, ACM Trans. Programming Languages Systems 16, 1811-1841.
36. Mac Lane, S. (1971). "Categories for the Working Mathematician," Springer-Verlag, Berlin/New York.
37. Manna, Z., and Pnueli, A. (1992). "The Temporal Logic of Reactive and Concurrent Systems," Springer-Verlag, Berlin/New York.
38. Meseguer, J. (1993). Solving the inheritance anomaly in concurrent object-oriented programming, in "Proceedings, ECOOP '93," Lecture Notes in Computer Science, Vol. 707, pp. 220-246, Springer-Verlag, Berlin/New York.
39. Meseguer, J., and Qian, X. (1993). A logical semantics for object-oriented databases, in "Proceedings of the ACM-SIGMOD Conference," pp. 89-98, Assoc. Comput. Mach. Press, New York.
40. Meyer, B. (1992). "Eiffel: The Language," Prentice-Hall, New York.
41. Orgun, M. A., and Wadge, W. W. (1992). Theory and practice of temporal logic programming, in "Intensional Logics for Programming, Studies in Logic and Computation 1," pp. 23-50, Clarendon Press, New York.
42. Plotkin, B. (1994). "Universal Algebra, Algebraic Logic and Databases," Kluwer Academic, Dordrecht/Norwell, MA.
43. Saraswat, V., Jagadeesan, R., and Gupta, V. (1996). Time default concurrent constraint programming, J. Symbolic Comput. 22, 475-520.
44. Wieringa, R., de Jonge, W., and Spruit, P. (1994). Roles and dynamic subclasses: a modal logic approach, in "Proceedings, ECOOP '94," Lecture Notes in Computer Science, Vol. 821, pp. 33-59, Springer-Verlag, Berlin/New York.