Filters








12 Hits in 1.1 sec

Mechanisms for controlling evolution in persistent object systems

R Morrison, RCH Connor, QI Cutts, GNC Kirby, D Stemple
1993 Microprocessors and microsystems  
The areas discussed are: the use of type systems, the use of reflection and a new style of programming, only available in persistent object systems, called hyperprogramming.  ...  A requirement of such systems is that the data (including programs) must be capable of evolving and that the evolution should be within the control of the application's programmer.  ...  In statically checked systems these mechanisms range from the integrity constraints of the language ADABTPL [SFS90] , through the statically enforced existentially quantified types of Napier88, encapsulation  ... 
doi:10.1016/0141-9331(93)90047-b fatcat:utjsb2qpszc3novr7y3ymtup6q

Protection in Persistent Object Systems [chapter]

Ron Morrison, Fred Brown, Richard Connor, Quintin Cutts, Graham Kirby, Alan Dearle, John Rosenberg, David Stemple
2000 Fully Integrated Data Environments  
system.  ...  In this paper we explore the full range of protection mechanisms in persistent systems from static to dynamic checking and contrast it with the corresponding balance between safety and flexibility in the  ...  ACKNOWLEDGEMENTS This work was undertaken during a period of study leave by John Rosenberg at the University of St Andrews which was supported by SERC grant GR/F 28571 and a visit to St Andrews by David  ... 
doi:10.1007/978-3-642-59623-0_12 fatcat:b6wdtaecrrb5fc56ej6dplj44u

Coping with Complexity in Automated Reasoning about Database Systems

Tim Sheard, David W. Stemple
1985 Very Large Data Bases Conference  
to optimize queries, and by transaction compilers or interpreters to optimize the checking of integrity constraints.  ...  Automated reasoning about database systems refers to using a program or programs to draw inferences about properties of systems and can be used by designers to analyxe system designs, by query processors  ...  of the two abstract data types of the system.  ... 
dblp:conf/vldb/SheardS85 fatcat:ceb7ex57wnaazbnkg4u4sgf2dm

Uniform traversal combinators: Definition, use and properties [chapter]

Leonidas Fegaras, Tim Sheard, David Stemple
1992 Lecture Notes in Computer Science  
These reductions, called uniform traversal combinators, can substantially help the theorem proving process by eliminating the need for induction and can also be an aid in achieving e ective program synthesis  ...  In this paper we explore ways of capturing well-formed patterns of recursion in the form of generic reductions.  ...  Therefore, map_list(f)(append(x,y)) is which is the same with append(map_list(f)(x),map_list(f)(y)).  ... 
doi:10.1007/3-540-55602-8_162 fatcat:injqocxqyraspb2t4vj4ciehsy

Interactive retrieval of complex documents

W.B. Croft, R. Krovetz, H. Turtle
1990 Information Processing & Management  
Information systems that represent these aspects of documents must be able to handle queries more complex than in typical database or text retrieval systems.  ...  We also report the results of an experiment that addresses some of the cognitive aspects of such an interface.  ...  Acknowledgements-The research was supported in part by Ing. C. Olivetti & C., S.p.A., by OCLC Online Computer Library Center, and by NSF Grant IRI-8814790.  ... 
doi:10.1016/0306-4573(90)90104-a fatcat:tn2b4rqazjfh5ezzvpv7brxr5u

On the Formal Specification and Derivation of Relational Database Applications

Roberto Souto, Maior de Barros
1998 Electronical Notes in Theoretical Computer Science  
Most of the previous work on the area either tried to solve the problem too generally or was restricted to some trivial aspects, for example deriving the database structure and/or simple operations.  ...  The development of database applications is usually carried out informally. The derivation of database programs directly from formal speci cations is a well known and unsolved problem.  ...  The nancial support for the Ph.D. course was provided by CAPES (Brazilian Federal Agency for Postgraduate Education) and by UFPE (Federal University of Pernambuco). 21 Barros  ... 
doi:10.1016/s1571-0661(05)80226-9 fatcat:owoxo3zemzhffh3mavcvyptu34

Linguistic reflection in Java

Graham Kirby, Ron Morrison, David Stemple
1998 Software, Practice & Experience  
The advantages of the programming technique include attaining high levels of genericity and accommodating system evolution.  ...  However, Ada generics do not allow computation over the type representations, are not recursive, and do not generate Just-In-Time.  ...  ACKNOWLEDGEMENTS This work is partially supported by the EPSRC through Grant GR/J 67611 "Delivering the Benefits of Persistence to System Construction" and by ESPRIT through Working Group EP22552 "PASTEL  ... 
doi:10.1002/(sici)1097-024x(199808)28:10<1045::aid-spe191>3.3.co;2-6 fatcat:bzexezw66jamlkzugq26h4pwry

Linguistic reflection in Java

Graham Kirby, Ron Morrison, David Stemple
1998 Software, Practice & Experience  
The advantages of the programming technique include attaining high levels of genericity and accommodating system evolution.  ...  However, Ada generics do not allow computation over the type representations, are not recursive, and do not generate Just-In-Time.  ...  ACKNOWLEDGEMENTS This work is partially supported by the EPSRC through Grant GR/J 67611 "Delivering the Benefits of Persistence to System Construction" and by ESPRIT through Working Group EP22552 "PASTEL  ... 
doi:10.1002/(sici)1097-024x(199808)28:10<1045::aid-spe191>3.0.co;2-f fatcat:q2vfaitimjdm3j2nx2ri6vp2m4

Extensible Grammars for Language Specialization [chapter]

Luca Cardelli, Florian Matthes, Martín Abadi
1994 Database Programming Languages (DBPL-4)  
A frequent dilemma in the design  ...  We also present a soundness result for the type system with respect to the evaluation semantics.  ...  Formalizing 0bject)s for Databases using ADABTPL. In Advances in Objecf-Orzenied Database Systems, pages 110-172, 1988. D. Stemple, R.B. Stanton, T. Sheard, P. Philbrow, R. Morrison, G.N.C. Kirby, L.  ... 
doi:10.1007/978-1-4471-3564-7_2 fatcat:72oglzpgijgcpculdqhce6u5vq

Letter from the Editor-in-Chief

David B. Lomet
1994 IEEE Data Engineering Bulletin  
Membership in the TC on Data Engineering is open to all current members of the IEEE Computer Society who are interested in database systems.  ...  Its scope includes the design, implementation, modelling, theory and application of database systems and their technology.  ...  ADABTPL [9] is a high level Pascal-like language in which a database designer specifies the schema (defining the tuple types with constraints on the attributes, relation types with intra-relational constraints  ... 
dblp:journals/debu/Lomet94a fatcat:x5xcvkfmc5b2ppj4mvc45dpuqi

The processing strategy for the NF2 relational frc-interface

Timo Niemi, Kalervo Järvelin
1996 Information and Software Technology  
The NF 2 relational query interface in this paper is based on a different approach. In it the user describes only the structure of the result NF 2 relation in a straightforward and intuitive way.  ...  This is because the user usually has to formulate large nested expressions in order to specify how the result NF 2 relation is derived from the source NF 2 relation(s).  ...  From the view point of the object-based structuring mechanism it is essential that the number of available structural types is large enough for modelling all structural aspects related to the system being  ... 
doi:10.1016/0950-5849(95)01041-6 fatcat:7h4tiy55mrd7dd5z7tjb5e7jyu

Working with persistent objects: to swizzle or not to swizzle

J.E.B. Moss
1992 IEEE Transactions on Software Engineering  
The model has a number of parameters, which we have measured for a particular instance of the Mneme persistent object store, varying the swizzling technique used.  ...  The results confirm most of the intuitive, qualitative tradeoffs, with the quantitative data showing that some performance differences between schemes are smaller than might be expected.  ...  Note that we model only structural properties of objects and do not include any sort of type or class system, inheritance hierarchy, or operation/method invocation mechanism.  ... 
doi:10.1109/32.153378 fatcat:m6u6k3u525bzpcj2n7uhrxgggq