Publications

You are here

Home » Research
1994
F. Giannotti and Latella, D., “Gate Splitting in LOTOS Specifications Using Abstract Interpretation”, Sci. Comput. Program., vol. 23, pp. 127-149, 1994.
A. Brogi, Chiarelli, A., Mancarella, P., Mazzotta, V., Pedreschi, D., Renso, C., and Turini, F., “Implementations of Program Composition Operations”, pp. 292–307, 1994.
A. Brogi, Chiarelli, A., Mancarella, P., Mazzotta, V., Pedreschi, D., Renso, C., and Turini, F., “Implementations of Program Composition Operations”, in PLILP, 1994, pp. 292-307.
A. Brogi, Chiarelli, A., Mancarella, P., Mazzotta, V., Pedreschi, D., Renso, C., and Turini, F., “Implementations of Program Composition Operations”, in PLILP, 1994, pp. 292-307.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Modular Logic Programming”, ACM Trans. Program. Lang. Syst., vol. 16, pp. 1361-1398, 1994.
D. Pedreschi, “A Proof Method for Runtime Properties of Prolog Programs”, in ICLP, 1994, pp. 584-598.
P. Mascellani and Pedreschi, D., “Proving termination of Prolog programs”, in GULP-PRODE (1), 1994, pp. 46-61.
1993
G. Amato, Giannotti, F., and Mainetto, G., “Data Sharing Analysis for a Database Programming Lanaguage via Abstract Interpretation”, in VLDB, 1993, pp. 405-415.
L. Corciulo, Giannotti, F., and Pedreschi, D., “Datalog with Non-Deterministic Choice Computes NDB-PTIME”, in DOOD, 1993, pp. 49-66.
F. Giannotti and Latella, D., “Gate Splitting in LOTOS Specifications Using Abstract Interpretation”, in TAPSOFT, 1993, pp. 437-452.
K. R. Apt and Pedreschi, D., “Reasoning about Termination of Pure Prolog Programs”, Inf. Comput., vol. 106, pp. 109-157, 1993.
G. Amato, Giannotti, F., and Mainetto, G., “Static Analysis of Transactions: an Experiment of Abstract Interpretation Usage”, in FMLDO, 1993, pp. 19-29.
A. Chiarelli, Mazzotta, V., and Renso, C., “A WAM Estesa per la Composizione di Programi Logici”, in GULP, 1993, pp. 189-202.
1992
G. Amato, Giannotti, F., and Mainetto, G., “Analysis of Concurrent Transactions in a Functional Database Programming Language”, in WSA, 1992, pp. 174-184.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Meta for Modularising Logic Programming”, in META, 1992, pp. 105-119.
B. Bertolino, Meo, L., Pedreschi, D., and Turini, F., The Type System of LML. 1992, pp. 313-332.
F. Giannotti and Latella, D., “Using Abstract Interpretation for Gate splitting in LOTOS Specifications”, in WSA, 1992, pp. 194-204.
1991
F. Giannotti, Pedreschi, D., Saccà, D., and Zaniolo, C., “Non-Determinism in Deductive Databases”, in DOOD, 1991, pp. 129-146.
K. R. Apt and Pedreschi, D., “Proving Termination of General Prolog Programs”, in TACS, 1991, pp. 265-289.
F. Giannotti and Hermenegildo, M. V., “A Technique for Recursive Invariance Detection and Selective Program Specification”, in PLILP, 1991, pp. 323-334.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Theory Construction in Computational Logic”, in ICLP Workshop on Construction of Logic Programs, 1991, pp. 241-250.
1990
P. Mancarella, Pedreschi, D., Rondinelli, M., and Tagliatti, M., “Algebraic Properties of a Class of Logic Programs”, in NACLP, 1990, pp. 23-39.
F. Giannotti and Pedreschi, D., “Declarative Semantics for Pruning Operators in Logic Programming”, in LPNMR, 1990, pp. 27-37.
A. Brogi, Mancarella, P., Pedreschi, D., and Turini, F., “Logic Programming within a Functional Framework”, in PLILP, 1990, pp. 372-386.
C. Bertazzoni and Giannotti, F., “RASP: A Resource Allocator for Software Projects”, in IEA/AIE (Vol. 2), 1990, pp. 628-637.

Pages