| 2009 |
|---|
| 57 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Luca Tesei:
Timed P Automata.
Electr. Notes Theor. Comput. Sci. 227: 21-36 (2009) |
| 56 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Giovanni Pardini:
Spatial Calculus of Looping Sequences.
Electr. Notes Theor. Comput. Sci. 229(1): 21-39 (2009) |
| 2008 |
|---|
| 55 | EE | Roberto Barbuti,
Giulio Caravagna,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Giovanni Pardini:
The Calculus of Looping Sequences.
SFM 2008: 387-423 |
| 54 | EE | Roberto Barbuti,
Giulio Caravagna,
Andrea Maggiolo-Schettini,
Paolo Milazzo:
An Intermediate Language for the Simulation of Biological Systems.
Electr. Notes Theor. Comput. Sci. 194(3): 19-34 (2008) |
| 53 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Angelo Troina:
Bisimulations in calculi modelling membranes.
Formal Asp. Comput. 20(4-5): 351-377 (2008) |
| 52 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Simone Tini:
A P Systems Flat Form Preserving Step-by-step Behaviour.
Fundam. Inform. 87(1): 1-34 (2008) |
| 51 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Simone Tini:
Compositional semantics and behavioral equivalences for P Systems.
Theor. Comput. Sci. 395(1): 77-100 (2008) |
| 2007 |
|---|
| 50 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo:
Extending the Calculus of Looping Sequences to Model Protein Interaction at the Domain Level.
ISBRA 2007: 638-649 |
| 49 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Angelo Troina:
The Calculus of Looping Sequences for Modeling Biological Membranes.
Workshop on Membrane Computing 2007: 54-76 |
| 2006 |
|---|
| 48 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Angelo Troina:
Bisimulation Congruences in the Calculus of Looping Sequences.
ICTAC 2006: 93-107 |
| 47 | EE | Roberto Barbuti,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Angelo Troina:
A Calculus of Looping Sequences for Modelling Microbiological Systems.
Fundam. Inform. 72(1-3): 21-35 (2006) |
| 2005 |
|---|
| 46 | EE | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Gigliola Vaglini:
Reduced Models for Efficient CCS Verification.
Formal Methods in System Design 26(3): 319-350 (2005) |
| 45 | EE | Roberto Barbuti,
Stefano Cataudella:
Abstract Interpretation of an Object Calculus for Synchronization Optimizations.
Fundam. Inform. 67(1-3): 1-12 (2005) |
| 44 | EE | Roberto Barbuti,
Stefano Cataudella,
Andrea Maggiolo-Schettini,
Paolo Milazzo,
Angelo Troina:
A Probabilistic Model for Molecular Systems.
Fundam. Inform. 67(1-3): 13-27 (2005) |
| 2004 |
|---|
| 43 | EE | Roberto Barbuti,
Stefano Cataudella:
Java bytecode verification on Java cards.
SAC 2004: 431-438 |
| 42 | EE | Roberto Barbuti,
Luca Tesei:
Timed automata with urgent transitions.
Acta Inf. 40(5): 317-347 (2004) |
| 41 | EE | Roberto Barbuti,
Cinzia Bernardeschi,
Nicoletta De Francesco:
Analyzing Information Flow Properties in Assembly Code by Abstract Interpretation.
Comput. J. 47(1): 25-45 (2004) |
| 40 | EE | Roberto Barbuti,
Stefano Cataudella,
Luca Tesei:
Abstract Interpretation Against Races.
Fundam. Inform. 60(1-4): 67-79 (2004) |
| 2003 |
|---|
| 39 | EE | Roberto Barbuti,
Luca Tesei:
A Decidable Notion of Timed Non-Interference.
Fundam. Inform. 54(2-3): 137-150 (2003) |
| 2002 |
|---|
| 38 | EE | Roberto Barbuti,
Cinzia Bernardeschi,
Nicoletta De Francesco:
Checking security of Java bytecode by abstract interpretation.
SAC 2002: 229-236 |
| 37 | EE | Roberto Barbuti,
Luca Tesei,
Cinzia Bernardeschi,
Nicoletta De Francesco:
Fixing the Java bytecode verifier by a suitable type domain.
SEKE 2002: 377-382 |
| 36 | | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Luca Tesei:
A Notion of Non-Interference for Timed Automata.
Fundam. Inform. 51(1-2): 1-11 (2002) |
| 35 | EE | Roberto Barbuti,
Cinzia Bernardeschi,
Nicoletta De Francesco:
Abstract interpretation of operational semantics for secure information flow.
Inf. Process. Lett. 83(2): 101-108 (2002) |
| 2001 |
|---|
| 34 | | Roberto Barbuti,
Nicoletta De Francesco,
Luca Tesei:
Timed Automata with non-Instantaneous Actions.
Fundam. Inform. 47(3-4): 189-200 (2001) |
| 2000 |
|---|
| 33 | | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Gigliola Vaglini:
Logic Based Abstractions of Real-Time Systems.
Formal Methods in System Design 17(3): 201-220 (2000) |
| 1999 |
|---|
| 32 | EE | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Gigliola Vaglini:
Formula Based Abstractions of Transition Systems for Real-Time Model Checking.
World Congress on Formal Methods 1999: 289-306 |
| 31 | EE | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Gigliola Vaglini:
Abstract Interpretation of Trace Semantics for Concurrent Calculi.
Inf. Process. Lett. 70(2): 69-78 (1999) |
| 30 | | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Gigliola Vaglini:
Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems.
J. Comput. Syst. Sci. 59(3): 537-556 (1999) |
| 29 | | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Gigliola Vaglini:
LORETO: A Tool for Reducing State Explosion in Verification of LOTOS Programs.
Softw., Pract. Exper. 29(12): 1123-1147 (1999) |
| 1998 |
|---|
| 28 | | Roberto Barbuti,
Nicoletta De Francesco,
Paolo Mancarella,
Antonella Santone:
Towards a Logical Semantics for Pure Prolog.
Sci. Comput. Program. 32(1-3): 145-176 (1998) |
| 1997 |
|---|
| 27 | | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone,
Gigliola Vaglini:
Selective µ-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems.
FORTE 1997: 519-534 |
| 26 | | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone:
Algebraic Computational Models of OR-Parallel Execution of Prolog.
Acta Inf. 34(6): 449-489 (1997) |
| 1996 |
|---|
| 25 | | Roberto Barbuti,
Paolo Mancarella:
A Multiple-Valued Logical Semantics for Prolog.
ESOP 1996: 62-76 |
| 1995 |
|---|
| 24 | | Roberto Barbuti,
Nicoletta De Francesco,
Antonella Santone:
Modeling OR-Parallel Execution of Prolog using CHOCS.
ICLP 1995: 547-561 |
| 23 | | Roberto Barbuti,
Michael Codish,
Roberto Giacobazzi,
Michael J. Maher:
Oracle Semantics for Prolog.
Inf. Comput. 122(2): 178-200 (1995) |
| 1994 |
|---|
| 22 | | María Alpuente,
Roberto Barbuti,
Isidro Ramos:
1994 Joint Conference on Declarative Programming, GULP-PRODE'94 Peñiscola, Spain, September 19-22, 1994, Volume 1
GULP-PRODE (1) 1994 |
| 21 | | María Alpuente,
Roberto Barbuti,
Isidro Ramos:
1994 Joint Conference on Declarative Programming, GULP-PRODE'94 Peñiscola, Spain, September 19-22, 1994, Volume 2
GULP-PRODE (2) 1994 |
| 1993 |
|---|
| 20 | | Roberto Barbuti,
E. Bellugi,
Mauro Gaspari,
Roberto Giacobazzi:
La Terminazione di Prolog Modellata in un Linguaggio Logico con Vincoli.
GULP 1993: 341-358 |
| 19 | EE | Roberto Barbuti,
Roberto Giacobazzi,
Giorgio Levi:
A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs.
ACM Trans. Program. Lang. Syst. 15(1): 133-181 (1993) |
| 18 | | Roberto Barbuti,
Michael Codish,
Roberto Giacobazzi,
Giorgio Levi:
Modelling Prolog Control.
J. Log. Comput. 3(6): 579-603 (1993) |
| 1992 |
|---|
| 17 | | Roberto Barbuti,
Michael Codish,
Roberto Giacobazzi,
Michael J. Maher:
Oracle Semantics for Prolog.
ALP 1992: 100-114 |
| 16 | | Roberto Barbuti,
Michael Codish,
Roberto Giacobazzi,
Giorgio Levi:
Modeling Prolog Control.
POPL 1992: 95-104 |
| 15 | | Roberto Barbuti,
Roberto Giacobazzi:
A Bottom-Up Polymorphic Type Inference in Logic Programming.
Sci. Comput. Program. 19(3): 281-313 (1992) |
| 1991 |
|---|
| 14 | | Roberto Barbuti,
Michael Codish,
Roberto Giacobazzi,
Giorgio Levi:
Modelling Prolog Control.
JTASPEFT/WSA 1991: 117-124 |
| 1990 |
|---|
| 13 | | Roberto Barbuti,
Maurizio Martelli:
Recognizing Non-Floundering Logic Programs and Goals.
Int. J. Found. Comput. Sci. 1(2): 151- (1990) |
| 12 | | Roberto Barbuti,
Paolo Mancarella,
Dino Pedreschi,
Franco Turini:
A Transformational Approach to Negation in Logic Programming.
J. Log. Program. 8(3): 201-228 (1990) |
| 1988 |
|---|
| 11 | | Roberto Barbuti,
Maurizio Martelli:
A Tool to Check the Non-Floundering Logic Programs and Goals.
PLILP 1988: 58-67 |
| 1987 |
|---|
| 10 | | Roberto Barbuti,
Paolo Mancarella,
Dino Pedreschi,
Franco Turini:
Intensional Negation of Logic Programs: Examples and Implementation Techniques.
TAPSOFT, Vol.2 1987: 96-110 |
| 1986 |
|---|
| 9 | | Roberto Barbuti,
C. D'Ascanio,
Franco Turini:
Cooperating Logic Theories.
AIMSA 1986: 165-172 |
| 8 | | Roberto Barbuti,
Maurizio Martelli:
Completeness of the SLDNF-resolution for a class of logic programs.
ICLP 1986: 600-614 |
| 7 | | Roberto Barbuti,
Marco Bellia,
Giorgio Levi,
Maurizio Martelli:
LEAF: A Language which Integrates Logic, Equations and Functions.
Logic Programming: Functions, Relations, and Equations 1986: 201-238 |
| 6 | | C. Aquilano,
Roberto Barbuti,
P. Bocchetti,
Maurizio Martelli:
Negation as Failure. Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions.
J. Autom. Reasoning 2(2): 155-170 (1986) |
| 1984 |
|---|
| 5 | | Roberto Barbuti,
Marco Bellia,
Giorgio Levi,
Maurizio Martelli:
On the Integration of Logic Programming and Functional Programming.
SLP 1984: 160-166 |
| 1983 |
|---|
| 4 | | Roberto Barbuti,
Alberto Martelli:
A Constructive Approach to Static Verification of Program Properties.
IFIP Congress 1983: 457-462 |
| 3 | | Roberto Barbuti,
Alberto Martelli:
A Structured Approach to Static Semantics Correctness.
Sci. Comput. Program. 3(3): 279-311 (1983) |
| 1982 |
|---|
| 2 | | Roberto Barbuti,
Pierpaolo Degano,
Giorgio Levi:
Toward an Inductionless Technique for Proving Properties of Logic Programs.
ICLP 1982: 175-181 |
| 1980 |
|---|
| 1 | | Roberto Barbuti,
Alberto Martelli:
Static Type Checking for Languages with Parametric Types and Polymorphic Procedures.
Symposium on Programming 1980: 1-16 |
