@article{ITA_1992__26_5_403_0, author = {Steffen, B. and Barry Jay, C. and Mendler, M.}, title = {Compositional characterization of observable program properties}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {403--424}, publisher = {EDP-Sciences}, volume = {26}, number = {5}, year = {1992}, mrnumber = {1187510}, zbl = {0768.68088}, language = {en}, url = {http://archive.numdam.org/item/ITA_1992__26_5_403_0/} }
TY - JOUR AU - Steffen, B. AU - Barry Jay, C. AU - Mendler, M. TI - Compositional characterization of observable program properties JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1992 SP - 403 EP - 424 VL - 26 IS - 5 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1992__26_5_403_0/ LA - en ID - ITA_1992__26_5_403_0 ER -
%0 Journal Article %A Steffen, B. %A Barry Jay, C. %A Mendler, M. %T Compositional characterization of observable program properties %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1992 %P 403-424 %V 26 %N 5 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_1992__26_5_403_0/ %G en %F ITA_1992__26_5_403_0
Steffen, B.; Barry Jay, C.; Mendler, M. Compositional characterization of observable program properties. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 26 (1992) no. 5, pp. 403-424. http://archive.numdam.org/item/ITA_1992__26_5_403_0/
[AH87] Abstract Interpretation of Declarative Languages, Ellis-Horwood, 1987.
and , eds,[BHA86] The Theory of Strictness Analysis for Higher Order Functions, Sci. Comput. Programming, 1986, 7, pp. 249-278. | MR | Zbl
, and ,[BW85] Toposes, Triples and Theories, Springer Verlag, 1985. | MR | Zbl
and ,[CC77a] Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximaion of Fixpoints. In 4th P.O.P.L., 1977, pp. 238-252.
and ,[CC77b] Automatic Synthesis of Optimal Invariant Assertions: Mathematical Foundations. A.C.M. Sigplan Notices, 1977, 12, pp. 1-12.
and ,[CC79] Systematic Design of Program Analysis Framework. In 6th P.O.P.L., 1979, pp. 269-282.
and ,[HJ88] Data Refinement in a Categorical Setting. Technical Report, Oxford Univ. Computing Lab., February 1988.
and ,[Jay90a] Extending Properties to Categories of Partial Maps. Tech. Rep. E.C.S.-L.F.C.S.-90-l07, University of Edinburgh, 1990.
,[Jay90e] Partial Functions, Ordered Categories, Limits and Cartesian Closure. In: G. BIRTWISTLE (ed.) IV Higher Order Workshop, Banff, 1990, Springer, 1991.
,[Jay91] Modelling Reduction in Confluent Categories. Tech. Rep. E.C.S.-L.F.C.S.-91-187, University of Edinburgh, 1991. | MR
,[JN90] Abstract Interpretation: A Semantics Based Tool for Program Analysis. In Handbook of Logic in Computer Science.
and ,[KS74] Review of the Elements of 2-Categories. In G. M. KELLY, ed., Proceedings Sydney Category Theory Seminar 1972/1973, Springer-Verlag, 1974, pp.75-103. | MR | Zbl
and ,[LS86] Introduction to Higher-Order Categorical Logic, vol. 7 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1986. | MR | Zbl
and ,[Mac71] Categories for the Working Mathematician. Springer Verlag, 1971. | MR | Zbl
,[MJ86] A Relational Framework for Abstract Interpretation. In Proceedings, 'Programs as Data Objects'. Springer Verlag, L.N.C.S. 217, 1986. | MR | Zbl
and ,[Nie86] A Bibliography on Abstract Interpretations. A.C.M. Sigplan Notices, 1986, 21, pp.31-38. | Zbl
,[Plo80] Lambda Defmability in the Full Type Hierarchy. In R. HINDLEY and J. SELDIN, eds., To H.B. Curry: Essays in Combinatory Logic, Lambda Calculas and Formalisms. Academic Press, 1980. | MR
,[SP82] The Category-theoretic Solution of Recursive Domain Equations. S.I.A.M. J. Comput., 1982, 11. | MR | Zbl
and ,[Ste87] Optimal Run Time Optimization - Proved by a New Look at Abstract Interpretations. In T.A.P.S.O.F.T.'87, L.N.C.S. 249, 1987, pp. 52-68. | Zbl
,[Ste89] Optimal Data Flow Analysis via Observable Equivalence. In M.F.C.S.'89, 1989.
,