|   | 
Details
   web
Records
Author Della Penna, Giuseppe; Intrigila, Benedetto; Tronci, Enrico; Venturini Zilli, Marisa
Title Synchronized Regular Expressions Type Journal Article
Year 2002 Publication Electr. Notes Theor. Comput. Sci. Abbreviated Journal
Volume 62 Issue Pages 195-210
Keywords
Abstract Text manipulation is one of the most common tasks for everyone using a computer. The increasing number of textual information in electronic format that every computer user collects everyday stresses the need of more powerful tools to interact with texts. Indeed, much work has been done to provide nonprogramming tools that can be useful for the most common text manipulation issues. Regular Expressions (RE), introduced by Kleene, are well–known in the formal language theory. RE received several extensions, depending on the application of interest. In almost all the implementations of RE search algorithms (e.g. the egrep [A] UNIX command, or the Perl [17] language pattern matching constructs) we find backreferences (as defind in [1]), i.e. expressions that make reference to the string matched by a previous subexpression. Generally speaking, it seems that all the kinds of synchronizations between subexpressions in a RE can be very useful when interacting with texts. Therefore, we introduce the Synchronized Regular Expressions (SRE) as a derivation of the Regular Expressions. We use SRE to present a formal study of the already known backreferences extension, and of a new extension proposed by us, which we call the synchronized exponents. Moreover, since we are talking about formalisms that should have a practical utility and can be used in the real world, we have the problem of how to present SRE to the final users. Therefore, in this paper we also propose a user–friendly syntax for SRE to be used in implementations of SRE–powered search algorithms.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN (up) ISBN Medium
Area Expedition Conference
Notes TOSCA 2001, Theory of Concurrency, Higher Order Languages and Types Approved yes
Call Number Sapienza @ mari @ entcs02 Serial 46
Permanent link to this record
 

 
Author Focardi, Riccardo; Gorrieri, Roberto; Lanotte, Ruggero; Maggiolo-Schettini, Andrea; Martinelli, Fabio; Tini, Simone; Tronci, Enrico
Title Formal Models of Timing Attacks on Web Privacy Type Journal Article
Year 2002 Publication Electronic Notes in Theoretical Computer Science Abbreviated Journal
Volume 62 Issue Pages 229-243
Keywords
Abstract We model a timing attack on web privacy proposed by Felten and Schneider by using three different approaches: HL-Timed Automata, SMV model checker, and tSPA Process Algebra. Some comparative analysis on the three approaches is derived.
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN (up) ISBN Medium
Area Expedition Conference
Notes TOSCA 2001, Theory of Concurrency, Higher Order Languages and Types Approved yes
Call Number Sapienza @ mari @ entcs02a Serial 47
Permanent link to this record
 

 
Author Tronci, Enrico
Title Automatic Synthesis of Control Software for an Industrial Automation Control System Type Conference Article
Year 1999 Publication Proc.of: 14th IEEE International Conference on: Automated Software Engineering (ASE) Abbreviated Journal
Volume Issue Pages 247-250
Keywords
Abstract We present a case study on automatic synthesis of control software from formal specifications for an industrial automation control system. Our aim is to compare the effectiveness (i.e. design effort and controller quality) of automatic controller synthesis from closed loop formal specifications with that of manual controller design, followed by automatic verification. Our experimental results show that for industrial automation control systems, automatic synthesis is a viable and profitable (especially as far as design effort is concerned) alternative to manual design, followed by automatic verification.
Address
Corporate Author Thesis
Publisher Place of Publication Cocoa Beach, Florida, USA Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN (up) ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ ase99 Serial 49
Permanent link to this record
 

 
Author Tronci, Enrico
Title Automatic Synthesis of Controllers from Formal Specifications Type Conference Article
Year 1998 Publication Proc of 2nd IEEE International Conference on Formal Engineering Methods (ICFEM) Abbreviated Journal
Volume Issue Pages 134-143
Keywords
Abstract Many safety critical reactive systems are indeed embedded control systems. Usually a control system can be partitioned into two main subsystems: a controller and a plant. Roughly speaking: the controller observes the state of the plant and sends commands (stimulus) to the plant to achieve predefined goals. We show that when the plant can be modeled as a deterministic finite state system (FSS) it is possible to effectively use formal methods to automatically synthesize the program implementing the controller from the plant model and the given formal specifications for the closed loop system (plant+controller). This guarantees that the controller program is correct by construction. To the best of our knowledge there is no previously published effective algorithm to extract executable code for the controller from closed loop formal specifications. We show practical usefulness of our techniques by giving experimental results on their use to synthesize C programs implementing optimal controllers (OCs) for plants with more than 109 states.
Address
Corporate Author Thesis
Publisher Place of Publication Brisbane, Queensland, Australia Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN (up) ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ icfem98 Serial 52
Permanent link to this record
 

 
Author Tronci, Enrico
Title Equational Programming in Lambda-Calculus via SL-Systems. Part 1 Type Journal Article
Year 1996 Publication Theoretical Computer Science Abbreviated Journal
Volume 160 Issue 1&2 Pages 145-184
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN (up) ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ tcs96 Serial 54
Permanent link to this record
 

 
Author Tronci, Enrico
Title Equational Programming in Lambda-Calculus via SL-Systems. Part 2 Type Journal Article
Year 1996 Publication Theoretical Computer Science Abbreviated Journal
Volume 160 Issue 1&2 Pages 185-216
Keywords
Abstract
Address
Corporate Author Thesis
Publisher Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN (up) ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ tcs96a Serial 55
Permanent link to this record
 

 
Author Tronci, Enrico
Title Equational Programming in lambda-calculus Type Conference Article
Year 1991 Publication Sixth Annual IEEE Symposium on Logic in Computer Science (LICS) Abbreviated Journal
Volume Issue Pages 191-202
Keywords
Abstract
Address
Corporate Author Thesis
Publisher IEEE Computer Society Place of Publication Amsterdam, The Netherlands Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN (up) ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ lics91 Serial 58
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 (up) ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ tesec01 Serial 65
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 (up) ISBN Medium
Area Expedition 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 (up) ISBN Medium
Area Expedition Conference
Notes Approved yes
Call Number Sapienza @ mari @ bucciarelli-delorenzis-piperno-salvo:99 Serial 71
Permanent link to this record