|   | 
Details
   web
Records
Author Böhm, Corrado; Tronci, Enrico
Title X-Separability and Left-Invertibility in lambda-calculus Type Conference Article
Year 1987 Publication Symposium on Logic in Computer Science (LICS) Abbreviated Journal
Volume Issue Pages 320-328
Keywords
Abstract
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Ithaca, New York, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ lics87 Serial 63
Permanent link to this record
 

 
Author Böhm, Corrado; Tronci, Enrico
Title X-separability and left-invertibility in the λ-calculus (extended abstract, invited paper) Type Conference Article
Year 1987 Publication Proceedings of: Temi e prospettive della Logica e della Filosofia della Scienza contemporanea Abbreviated Journal
Volume Issue Pages
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Cesena - Italy Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ cesena87 Serial 64
Permanent link to this record
 

 
Author Bobbio, Andrea; Bologna, Sandro; Minichino, Michele; Ciancamerla, Ester; Incalcaterra, Piero; Kropp, Corrado; Tronci, Enrico
Title Advanced techniques for safety analysis applied to the gas turbine control system of Icaro co generative plant Type Conference Article
Year 2001 Publication X Convegno Tecnologie e Sistemi Energetici Complessi Abbreviated Journal
Volume Issue Pages 339-350
Keywords
Abstract The paper describes two complementary and integrable approaches, a probabilistic one and a deterministic one, based on classic and advanced modelling techniques for safety analysis of complex computer based systems. The probabilistic approach is based on classical and innovative probabilistic analysis methods. The deterministic approach is based on formal verification methods. Such approaches are applied to the gas turbine control system of ICARO co generative plant, in operation at ENEA CR Casaccia. The main difference between the two approaches, behind the underlining different theories, is that the probabilistic one addresses the control system by itself, as the set of sensors, processing units and actuators, while the deterministic one also includes the behaviour of the equipment under control which interacts with the control system. The final aim of the research, documented in this paper, is to explore an innovative method which put the probabilistic and deterministic approaches in a strong relation to overcome the drawbacks of their isolated, selective and fragmented use which can lead to inconsistencies in the evaluation results.
Address
Corporate Author Thesis
Publisher Place of Publication Genova, Italy Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ tesec01 Serial 65
Permanent link to this record
 

 
Author Tronci, Enrico
Title On Computing Optimal Controllers for Finite State Systems Type Conference Article
Year 1997 Publication CDC '97: Proceedings of the 36th IEEE International Conference on Decision and Control Abbreviated Journal
Volume Issue Pages
Keywords
Abstract
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Washington, DC, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ cdc97 Serial 66
Permanent link to this record
 

 
Author Tronci, Enrico
Title Optimal Finite State Supervisory Control Type Conference Article
Year 1996 Publication CDC '96: Proceedings of the 35th IEEE International Conference on Decision and Control Abbreviated Journal
Volume Issue Pages
Keywords
Abstract Supervisory Controllers are Discrete Event Dynamic Systems (DEDSs) forming the discrete core of a Hybrid Control System. We address the problem of automatic synthesis of Optimal Finite State Supervisory Controllers (OSCs). We show that Boolean First Order Logic (BFOL) and Binary Decision Diagrams (BDDs) are an effective methodological and practical framework for Optimal Finite State Supervisory Control. Using BFOL programs (i.e. systems of boolean functional equations) and BDDs we give a symbolic (i.e. BDD based) algorithm for automatic synthesis of OSCs. Our OSC synthesis algorithm can handle arbitrary sets of final states as well as plant transition relations containing loops and uncontrollable events (e.g. failures). We report on experimental results on the use of our OSC synthesis algorithm to synthesize a C program implementing a minimum fuel OSC for two autonomous vehicles moving on a 4 x 4 grid.
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Washington, DC, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ cdc96 Serial 67
Permanent link to this record
 

 
Author Intrigila, Benedetto; Salvo, Ivano; Sorgi, Stefano
Title A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser Type Journal Article
Year 2001 Publication Information and Computation Abbreviated Journal
Volume 171 Issue 2 Pages 137-155
Keywords
Abstract Basic properties of rewriting systems can be stated in the framework of abstract reduction systems (ARS). Properties like confluence (or Church-Rosser, CR) and weak confluence (or weak Church-Rosser, WCR) and their relationships can be studied in this setting: as a matter of fact, well-known counterexamples to the implication WCR CR have been formulated as ARS. In this paper, starting from the observation that such counterexamples are structurally similar, we set out a graph-theoretic characterization of WCR ARS that is not CR in terms of a suitable class of reduction graphs, such that in every WCR not CR ARS, we can embed at least one element of this class. Moreover, we give a tighter characterization for a restricted class of ARS enjoying a suitable regularity condition. Finally, as a consequence of our approach, we prove some interesting results about ARS using the mathematical tools developed. In particular, we prove an extension of the Newman’s lemma and we find out conditions that, once assumed together with WCR property, ensure the unique normal form property. The Appendix treats two interesting examples, both generated by graph-rewriting rules, with specific combinatorial properties.
Address
Corporate Author Thesis
Publisher Academic Press, Inc. Place of Publication Duluth, MN, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0890-5401 ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ Intrigila-Salvo-Sorgi:01 Serial 68
Permanent link to this record
 

 
Author Bucciarelli, Antonio; Piperno, Adolfo; Salvo, Ivano
Title Intersection types and λ-definability Type Journal Article
Year 2003 Publication Mathematical Structures in Computer Science Abbreviated Journal
Volume 13 Issue 1 Pages 15-53
Keywords
Abstract This paper presents a novel method for comparing computational properties of λ-terms that are typeable with intersection types, with respect to terms that are typeable with Curry types. We introduce a translation from intersection typing derivations to Curry typeable terms that is preserved by β-reduction: this allows the simulation of a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach proves strong normalisation for the intersection system naturally by means of purely syntactical techniques. The paper extends the results presented in Bucciarelli et al. (1999) to the whole intersection type system of Barendregt, Coppo and Dezani, thus providing a complete proof of the conjecture, proposed in Leivant (1990), that all functions uniformly definable using intersection types are already definable using Curry types.
Address
Corporate Author Thesis
Publisher Cambridge University Press Place of Publication New York, NY, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0960-1295 ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ Bucciarelli-Piperno-Salvo:MSCS-03 Serial 69
Permanent link to this record
 

 
Author Bucciarelli, Antonio; Salvo, Ivano
Title Totality, Definability and Boolean Circuits Type Journal Article
Year 1998 Publication Abbreviated Journal
Volume 1443 Issue Pages 808-819
Keywords
Abstract In the type frame originating from the flat domain of boolean values, we single out elements which are hereditarily total. We show that these elements can be defined, up to total equivalence, by sequential programs. The elements of an equivalence class of the totality equivalence relation (totality class) can be seen as different algorithms for computing a given set-theoretic boolean function. We show that the bottom element of a totality class, which is sequential, corresponds to the most eager algorithm, and the top to the laziest one. Finally we suggest a link between size of totality classes and a well known measure of complexity of boolean functions, namely their sensitivity.
Address
Corporate Author Thesis
Publisher Springer Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ bucciarelli-salvo:98 Serial 70
Permanent link to this record
 

 
Author Bucciarelli, Antonio; de Lorenzis, Silvia; Piperno, Adolfo; Salvo, Ivano
Title Some Computational Properties of Intersection Types (Extended Abstract) Type Journal Article
Year 1999 Publication Abbreviated Journal
Volume Issue Pages 109-118
Keywords lambda calculusCurry types, intersection types, lambda-definability, lambda-terms, strong normalization
Abstract This paper presents a new method for comparing computation-properties of λ-terms typeable with intersection types with respect to terms typeable with Curry types. In particular, strong normalization and λ-definability are investigated. A translation is introduced from intersection typing derivations to Curry typeable terms; the main feature of the proposed technique is that the translation is preserved by β-reduction. This allows to simulate a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach naturally leads to prove strong normalization in the intersection system by means of purely syntactical techniques. In addition, the presented method enables us to give a proof of a conjecture proposed by Leivant in 1990, namely that all functions uniformly definable using intersection types are already definable using Curry types.
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes Approved yes
Call Number Sapienza @ mari @ bucciarelli-delorenzis-piperno-salvo:99 Serial 71
Permanent link to this record
 

 
Author Bono, V.; Salvo, I.
Title A CuCh Interpretation of an Object-Oriented Language Type Journal Article
Year 2001 Publication Electronic Notes in Theoretical Computer Science Abbreviated Journal
Volume 50 Issue 2 Pages 159-177
Keywords
Abstract CuCh machine extends pure lambda–calculus with algebraic data types and provides a the possibility of defining functions over the disjoint sum of algebras. We exploit such natural form of overloading to define a functional interpretation of a simple, but significant fragment of a typical object-oriented language.
Address
Corporate Author Thesis
Publisher Elsevier Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN ISBN Medium
Area Expedition (up) Conference
Notes BOTH 2001, Bohm’s theorem: applications to Computer Science Theory (Satellite Workshop of ICALP 2001) Approved yes
Call Number Sapienza @ mari @ Bono-Salvo:BOTH01 Serial 72
Permanent link to this record