toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Mari, Federico; Melatti, Igor; Salvo, Ivano; Tronci, Enrico pdf  openurl
  Title Control Software Visualization Type Conference Article
  Year 2012 Publication Proceedings of INFOCOMP 2012, The Second International Conference on Advanced Communications and Computation Abbreviated Journal  
  Volume Issue Pages 15-20  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher ThinkMind Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 978-1-61208-226-4 ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ infocomp2012 Serial 100  
Permanent link to this record
 

 
Author Intrigila, Benedetto; Salvo, Ivano; Sorgi, Stefano pdf  doi
openurl 
  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 Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ Intrigila-Salvo-Sorgi:01 Serial 68  
Permanent link to this record
 

 
Author Tronci, Enrico doi  openurl
  Title Defining Data Structures via Böhm-Out Type Journal Article
  Year 1995 Publication J. Funct. Program. Abbreviated Journal  
  Volume 5 Issue 1 Pages 51-64  
  Keywords  
  Abstract We show that any recursively enumerable subset of a data structure can be regarded as the solution set to a B??hm-out problem.  
  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 ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ jfp95 Serial 57  
Permanent link to this record
 

 
Author Bobbio, Andrea; Ciancamerla, Ester; Minichino, Michele; Tronci, Enrico openurl 
  Title Functional analysis of a telecontrol system and stochastic measures of its GSM/GPRS connections Type Journal Article
  Year 2005 Publication Archives of Transport – International Journal of Transport Problems Abbreviated Journal  
  Volume 17 Issue 3-4 Pages  
  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 ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ jtp05 Serial 31  
Permanent link to this record
 

 
Author Cesta, Amedeo; Finzi, Alberto; Fratini, Simone; Orlandini, Andrea; Tronci, Enrico pdf  openurl
  Title Validation and Verification Issues in a Timeline-based Planning System Type Conference Article
  Year 2008 Publication In E-Proc. of ICAPS Workshop on Knowledge Engineering for Planning and Scheduling Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract One of the key points to take into account to foster effective introduction of AI planning and scheduling systems in real world is to develop end user trust in the related technologies. Automated planning and scheduling systems often brings solutions to the users which are neither “obviousÃ¢â‚¬Âť nor immediately acceptable for them. This is due to the ability of these tools to take into account quite an amount of temporal and causal constraints and to employ resolution processes often designed to optimize the solution with respect to non trivial evaluation functions. To increase technology trust, the study of tools for verifying and validating plans and schedules produced by AI systems might be instrumental. In general, validation and verification techniques represent a needed complementary technology in developing domain independent architectures for automated problem solving. This paper presents a preliminary report of the issues concerned with the use of two software tools for formal verification of finite state systems to the validation of the solutions produced by MrSPOCK, a recent effort for building a timeline based planning tool in an ESA project.  
  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 ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ Keps08 Serial 25  
Permanent link to this record
 

 
Author Martinelli, Marco; Tronci, Enrico; Dipoppa, Giovanni; Balducelli, Claudio pdf  doi
openurl 
  Title Electric Power System Anomaly Detection Using Neural Networks Type Conference Article
  Year 2004 Publication 8th International Conference on: Knowledge-Based Intelligent Information and Engineering Systems (KES) Abbreviated Journal  
  Volume Issue Pages 1242-1248  
  Keywords  
  Abstract The aim of this work is to propose an approach to monitor and protect Electric Power System by learning normal system behaviour at substations level, and raising an alarm signal when an abnormal status is detected; the problem is addressed by the use of autoassociative neural networks, reading substation measures. Experimental results show that, through the proposed approach, neural networks can be used to learn parameters underlaying system behaviour, and their output processed to detecting anomalies due to hijacking of measures, changes in the power network topology (i.e. transmission lines breaking) and unexpected power demand trend.  
  Address  
  Corporate Author Thesis  
  Publisher Springer Place of Publication Wellington, New Zealand Editor Negoita, M.G.; Howlett, R.J.; Jain, L.C.  
  Language Summary Language Original Title  
  Series Editor Series Title Lecture Notes in Computer Science Abbreviated Series Title  
  Series Volume 3213 Series Issue Edition  
  ISSN 3-540-23318-0 ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ kes04 Serial 35  
Permanent link to this record
 

 
Author Böhm, Corrado; Tronci, Enrico openurl 
  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 Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ lics87 Serial 63  
Permanent link to this record
 

 
Author Tronci, Enrico pdf  doi
openurl 
  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 ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ lics91 Serial 58  
Permanent link to this record
 

 
Author Tronci, Enrico pdf  doi
openurl 
  Title Hardware Verification, Boolean Logic Programming, Boolean Functional Programming Type Conference Article
  Year 1995 Publication Tenth Annual IEEE Symposium on Logic in Computer Science (LICS) Abbreviated Journal  
  Volume Issue Pages 408-418  
  Keywords  
  Abstract One of the main obstacles to automatic verification of finite state systems (FSSs) is state explosion. In this respect automatic verification of an FSS M using model checking and binary decision diagrams (BDDs) has an intrinsic limitation: no automatic global optimization of the verification task is possible until a BDD representation for M is generated. This is because systems and specifications are defined using different languages. To perform global optimization before generating a BDD representation for M we propose to use the same language to define systems and specifications. We show that first order logic on a Boolean domain yields an efficient functional programming language that can be used to represent, specify and automatically verify FSSs, e.g. on a SUN Sparc Station 2 we were able to automatically verify a 64 bit commercial multiplier.  
  Address  
  Corporate Author Thesis  
  Publisher IEEE Computer Society Place of Publication San Diego, California Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ lics95 Serial 56  
Permanent link to this record
 

 
Author Böhm, Corrado; Piperno, Adolfo; Tronci, Enrico openurl 
  Title Solving Equations in λ-calculus Type Conference Article
  Year 1989 Publication Proc. of: Logic Colloquium 88 Abbreviated Journal  
  Volume Issue Pages  
  Keywords  
  Abstract  
  Address  
  Corporate Author Thesis  
  Publisher Place of Publication Padova - Italy Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN ISBN Medium  
  Area Expedition Conference  
  Notes Approved yes  
  Call Number (up) Sapienza @ mari @ logic-colloquium-88 Serial 62  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: