
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. MaggioloSchettini, M. Napoli, G. Tortora, "Web Structures: A Tool for Representing and Manipulating Programs," IEEE Transactions on Software Engineering, vol. 14, no. 11, pp. 16211639, November, 1988.  
BibTex  x  
@article{ 10.1109/32.9050, author = {A. MaggioloSchettini and M. Napoli and G. Tortora}, title = {Web Structures: A Tool for Representing and Manipulating Programs}, journal ={IEEE Transactions on Software Engineering}, volume = {14}, number = {11}, issn = {00985589}, year = {1988}, pages = {16211639}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.9050}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Web Structures: A Tool for Representing and Manipulating Programs IS  11 SN  00985589 SP1621 EP1639 EPD  16211639 A1  A. MaggioloSchettini, A1  M. Napoli, A1  G. Tortora, PY  1988 KW  web structures; category theory; software tools; highlevel data flow analyzer; program transformers; production rules; web structure transformations; data structures; graph theory; program verification; programming theory; set theory; software tools VL  14 JA  IEEE Transactions on Software Engineering ER   
The authors introduce web structures and their transformations and develop their theory in the framework of category theory. Once a program has been represented as a web structure, software tools, such as a highlevel data flow analyzer or other general program transformers, can be written as sets of web structure production rules. An implementation of web structure transformations is in progress. The mathematical theory of web structure transformations allows form proofs of properties both at the metatheoretical and theoretical levels.
[1] M. Cannavale, "Un package per l'implementazione di trasformazioni di strutture relazionali," Tesi di Laurea, Scienze dell'Informazione. Univ. Salerno, Italy, 1979.
[2] V. Claus, H. Ehrig, and G. Rozemberg, Eds.,Graph Grammars and their Application to Computer Science and Biology(Lecture Notes in Computer Science vol. 73). Berlin: Springer, 1979.
[3] K. Culik, "A model for the formal definition of programming languages,"Int. J. Comput. Math., vol. 3, pp. 315345, 1973.
[4] P. Degano and U. Montanari, "A model for distributed systems based on graph rewriting,"J. ACM, vol. 34, pp. 411449, 1987.
[5] H. Ehrig, H. J. Kreowski, A. MaggioloSchettini, B. K. Rosen, and J. Winkowski, "Transformations of structures: An algebraic approach,"Math. Syst. Theory, vol. 14, pp. 305334, 1981.
[6] H. Herrlich and G. E. Strecker,Category Theory, Berlin: Heldermann, 1979.
[7] A. MaggioloSchettini, B. K. Rosen, and H. R. Strong, "Procedure linkage optimization, Working paper," inConf. Rec. SIGACTSIGPLAN Symp. Principles of Programming Languages, Boston, MA, Oct. 13, 1973, pp. 183193.
[8] A. MaggioloSchettini and J. Winkowski, "Processes of transforming structures,"J. Comput. Syst. Sci., vol. 24, pp. 245282, 1982.
[9] A. MaggioloSchettini and J. Winkowski, "Towards a programming language for manipulating relational data bases," inFormal Description of Programming Languages II, D. Bjorner, Ed. Amsterdam, The Netherlands: NorthHolland, 1983, pp. 265278.
[10] B. K. Rosen, "Highlevel data flow analysis,"Commun. ACM, vol. 20, pp. 712724, 1977.
[11] P. Wegner, "The Vienna definition language,"ACM Comput. Surveys, vol. 4, pp. 563, 1972.