8,042 research outputs found
PRISMA: A mobile calculus with parameterized synchronization
No full textWe present PRISMA, a parametric calculus that can be instantiated with different interaction policies, defined as synchronization algebras with mobility of names (SAMs). We define both operational semantics and observational semantics of PRISMA, showing that the second one is compositional for any SAM. We give examples based on heterogeneous SAMs, a case study on Fusion Calculus and some simple applications. Finally, we show that basic categorical tools can help to relate and to compose SAMs and PRISMA processes in an elegant way
Models of Computation: A Tribute to Ugo Montanari’s Vision
No full textUgo’s research activity in the area of Models of Computation (MoC, for short) has been prominent, influential and broadly scoped. In this introductory contribution we would like to recall some of the influential MoC models put forward by Ugo which cut across the three approaches
Audiomobiles, Sculptures and Conundrums
No full textRoberto Gerhard was a pioneer of electronic music in England creating a number of substantial concert, theatre and radio works from as early as 1954. Gerhard’s electronic music is one of the richest repositories for understanding the development of the composer’s late compositional technique. Apart from the Symphony no.3, ‘Collages’, none of Gerhard’s electronic music is published. This paper will discuss aspects of Gerhard’s electronic music, focusing on Audiomobiles (1958-59) and Sculptures (1963)
Evaluating the performance of model transformation styles in Maude
No full textRule-based programming has been shown to be very successful
in many application areas. Two prominent examples are the specification of model transformations in model driven development approaches and the definition of structured operational semantics of formal languages.
General rewriting frameworks such as Maude are
exible enough to allow the programmer to adopt and mix various rule styles. The choice between styles can be biased by the programmer's background. For instance, experts in visual formalisms might prefer graph-rewriting styles, while experts in semantics might prefer structurally inductive rules. This paper evaluates the performance of different rule styles on a significant
benchmark taken from the literature on model transformation. Depending on the actual transformation being carried out, our results show that different rule styles can offer drastically different performances. We pointout the situations from which each rule style benefits to offer a valuable set of hints for choosing one style over the other
Local Completeness for Program Correctness and Incorrectness (Invited Talk)
No full textProgram correctness techniques aim to prove the absence of bugs, but can yield false alarms because they tend to over-approximate program semantics. Vice versa, program incorrectness methods are aimed to detect true bugs, without false alarms, but cannot be used to prove correctness, because they under-approximate program semantics. In this invited talk we will overview our ongoing research on the use of the abstract interpretation framework to combine under- and over-approximation in the same analysis and distill a logic for program correctness and incorrectness
Trichogramma bruni Nagaraja 1983
No full textTrichogramma bruni Nagaraja, 1983 Diagnosis. Flagelliform setae long; dorsal lamina with distinct basal constriction, extending about two-thirds of length of genital capsule; intervolsellar process short, not extending up base of volsellae. Comments. The following combination of characters separates T. bruni from T. lasallei and T. rojasi: long flagelliform setae, basiconic sensilla in position 4, short anterior setae on scutellum, genital capsule yellowish, and long ventral ridge. According to Velásquez & Téran (2003), T. castrensis Velásquez & Téran is a junior synonym of T. bruni. Type repository. Institute of Biological Sciences, Universidade Federal de Minas Gerais (UFMG) collection (holotype and paratypes); Natural History Museum, London and Commonwealth Institute of Biological Control, Indian Station, Bangalore (paratypes) (holotype examined). Type locality. Belo Horizonte, MG, Brazil. Distribution in South America. Argentina, Bolivia, Brazil, Chile, Venezuela. Hosts. Associated with several lepidopteran hosts in agricultural (fruit orchards) and forest habitats (Zucchi et al. 2010). Trichogramma bruni was recently reared from eggs of Heraclides astyalus (Godart, 1819) (Lepidoptera: Papilionidae) on Citrus sp. (Rutaceae) (Querino et al. 2017). It is commonly found in areas with more stable plant cover, such as forests and fruit orchards. However, it has been collected in soybean areas in Argentina (Valverde et al. 2009, 2014) and in Brazil (Dudczak et al. 2017).Published as part of Querino, Ranyse B. & Zucchi, Roberto A., 2019, Annotated checklist and illustrated key to the species of Trichogramma Westwood (Hymenoptera: Trichogrammatidae) from South America, pp. 201-231 in Zootaxa 4656 (2) on page 206, DOI: 10.11646/zootaxa.4656.2.1, http://zenodo.org/record/336809
On structured model-driven transformations
No full textStructural aspects play a key role in the model-driven development of software systems. Effective techniques and tools must therefore be based on suitable representation formalisms that facilitate the specification, manipulation and analysis of the structure of models. Graphical and algebraic approaches have been shown to be very successful for such purposes: 1) graphs offer natural a representation of topological structures, 2) algebras offer a natural representation of compositional structures, 3) both graphs and algebras can be manipulated in a declarative way by means of rule-based techniques, 4) they allow for a layered presentation of models that enables compositional techniques and favours scalability. Most of the existing approaches represent such layering in a plain manner by overlapping the intra- and the inter-layered structure. It has been shown that some layering structures can be conveniently represented by an explicit hierarchical structure enabling then structurally inductive manipulations of the resulting models. Moreover, providing an inductive presentation of the structure facilitates the compositional analysis and verification of models. In this paper we compare and reconcile some recent approaches and synthesise them into an algebraic and graph-based formalism for representing and manipulating models with inductively defined hierarchical structure
Recensione del libro "Pasolini e la pedagogia", a cura di Roberto Carnero e Angela Felice. Edito da Marsilio
No full textRecensione del libro "Pasolini e la pedagogia", a cura di Roberto Carnero e Angela Felice
Normal forms for stateless connectors
No full textRoberto Bruni, Ivan Lanese, and Ugo Montanari Dipartimento di Informatica, Universit`a di Pisa, Italia
Ten virtues of structured graphs
No full textThis paper extends the invited talk by the first author about the virtues
of structured graphs. The motivation behind the talk and this paper relies on our
experience on the development of ADR, a formal approach for the design of styleconformant,
reconfigurable software systems. ADR is based on hierarchical graphs
with interfaces and it has been conceived in the attempt of reconciling software architectures
and process calculi by means of graphical methods. We have tried to
write an ADR agnostic paper where we raise some drawbacks of flat, unstructured
graphs for the design and analysis of software systems and we argue that hierarchical,
structured graphs can alleviate such drawbacks
- …
