italiano | contact
PUBLICATIONS

Special Issues/Journals/Books Proceedings Chapter Technical Report

[1]      «      37   |   38   |   39   |   40   |   41      »      [42]

1994

prova. prova,

prova. prova,

1993

P. Inverardi, D. Yankelevich, C. Priami. Extended Transition Systems for Parametric Bisimulation, 20th ICALP, LNCS

P. Inverardi, B. Krishnamurthy, D. Yankelevich. Yeast: A Case Study for a Practical Use of Formal Methods, TAPSOFT 1993, LNCS

P. Inverardi, A.Bucci, S. Martini. An Executable Impredicative Semantics for the Ada Configuration, Formal Aspects in Computing (5):, pagg. 91-120

P. Inverardi, F Mazzanti. Experimenting Dynamic Linking with Ada, Software Practice & Experience (23):1, pagg. 1-14

M. Flammini, G.Gambosi, S.Salomone. Boolean Routing, 7th Int. Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science

F. Rossi, A. Agnetis, G. Oriolo, D. Pacciarelli. A Dynamic Lookahead Dispatching Rule in a Flexible Flow Line for Automobile Assembly, 12th Triennal World Congress of the International Federation of Automatic Control, pagg. 493-496

S. Orefice, G. Nota, G. Pacini, F. Ruggiero, G. Tortora. Legality Concepts for Three-valued Logic Programs, Theoretical Computer Science (120):, pagg. 45-68

M. Nesi. Value-Passing CCS in HOL, 6th International Workshop on Higher Order Logic Theorem Proving and its Applications, Lecture Notes in Computer Science, pagg. 352-365

M. Nesi. Formalizing a Modal Logic for CCS in the HOL Theorem Prover, International Workshop on Higher Order Logic Theorem proving and Its Applications, IFIP Transactions, pagg. 279-294

P. Inverardi and M. Nesi. A Strategy to Deal with Divergent Rewrite Systems, 3rd International Workshop on Conditional Term Rewriting Systems - CTRS'92, Lecture Notes in Computer Science, pagg. 458-467

1992

F. Parisi-Presicce, A. Pierantonio. Structured inheritance for algebraic class specifications, ADT Workshop, Recent Trends in Data Type Specification, LNCS, pagg. 295-309

P. Inverardi, M. Boreale, M. Nesi. Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences, Information Processing Letters, North-Holland (43):3, pagg. 155-160

F. Corradini, Rocco De Nicola. Locality based Semantics for Process Algebras, ERCIM Workshop on Theory and Practice in Verification, pagg. 166-199

M. Flammini, A.Marchetti Spaccamela, L.Kucera. Learning DNF Formulae under Classes of Probability Distribution, 5th ACM Workshop on Computational Learning Theory (COLT)

M. Flammini. km-DNF Formulae are Learnable under Product Distribution, 4th Italian Conference on Theoretical Computer Science

S. Orefice, F. Ferrucci, G. Nota, G. Pacini, G. Tortora. On the Refinement of Logic Specifications, International Journal of Software Engineering and Knowledge Engineering (2):3, pagg. 433-448

M. Boreale, P. Inverardi and M. Nesi. Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences, Information Processing Letters (43):3, pagg. 155-160

P. Inverardi and M. Nesi. On Dealing with Divergent Rewrite Systems, 4th Italian Conference on Theoretical Computer Science, pagg. 256-257

 
 
 
 

Organization

Head of the department is Prof. Claudio Arbib (since March 1, 2008). The ...

continua ›
 
 
 
 

Publications

Numerous articles published in international scientific journals, books, and ...

continua ›
 
 
 
 

Job Postings

Consulta le offerte di lavoro pervenute dalle aziende, potrai entrare in ...

continua ›