Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Igor Siveroni

dblp:17/4192 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0003-2595-3062ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2Security and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Services computing and microservices · 91% Compilers and program optimization · 4% Program analysis · 4%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Services computing and microservices › service discovery
dynamic service discovery
0.212013
Proactive and Reactive Runtime Service Discovery: A Framework and Its Evaluation · IEEE Trans. Software Eng. 2013
Services computing and microservices
service discovery
0.212013
Proactive and Reactive Runtime Service Discovery: A Framework and Its Evaluation · IEEE Trans. Software Eng. 2013
Services computing and microservices › service adaptation
service replacement
0.212013
Proactive and Reactive Runtime Service Discovery: A Framework and Its Evaluation · IEEE Trans. Software Eng. 2013
Distributed systems
fault tolerance
0.012013
Proactive and Reactive Runtime Service Discovery: A Framework and Its Evaluation · IEEE Trans. Software Eng. 2013
Compilers and program optimization
dead code elimination
0.011999
Constraint Systems for Useless Variable Elimination · POPL 1999

Methods — techniques the papers use, named apart from their topics

query execution · 0.3distance-based matching · 0.3
YearPublicationVenuePosition
2019 BEAST 2.5: An advanced software platform for Bayesian evolutionary analysis
abstract
Elaboration of Bayesian phylogenetic inference methods has continued at pace in recent years with major new advances in nearly all aspects of the joint modelling of evolutionary data. It is increasingly appreciated that some evolutionary questions can only be adequately answered by combining evidence from multiple independent sources of data, including genome sequences, sampling dates, phenotypic data, radiocarbon dates, fossil occurrences, and biogeographic range information among others. Including all relevant data into a single joint model is very challenging both conceptually and computationally. Advanced computational software packages that allow robust development of compatible (sub-)models which can be composed into a full model hierarchy have played a key role in these developments. Developing such software frameworks is increasingly a major scientific activity in its own right, and comes with specific challenges, from practical software design, development and engineering challenges to statistical and conceptual modelling challenges. BEAST 2 is one such computational software platform, and was first announced over 4 years ago. Here we describe a series of major new developments in the BEAST 2 core platform and model hierarchy that have occurred since the first release of the software, culminating in the recent 2.5 release.
Remco R. Bouckaert, Timothy G. Vaughan, Joëlle Barido-Sottani, Sebastián Duchêne, Mathieu Fourment, Alexandra Gavryushkina, Joseph Heled, Graham Jones, Denise Kühnert, Nicola De Maio, Michael Matschiner, Fábio K. Mendes, Nicola F. Müller, Huw A. Ogilvie, Louis du Plessis, Alex Popinga, Andrew Rambaut, David A. Rasmussen, Igor Siveroni, Marc A. Suchard, Chieh-Hsi Wu, Chi Zhang 0033, Tanja Stadler, Alexei J. Drummond
PLoS Comput. Biol.19
2018 Bayesian phylodynamic inference with complex models
abstract
Population genetic modeling can enhance Bayesian phylogenetic inference by providing a realistic prior on the distribution of branch lengths and times of common ancestry. The parameters of a population genetic model may also have intrinsic importance, and simultaneous estimation of a phylogeny and model parameters has enabled phylodynamic inference of population growth rates, reproduction numbers, and effective population size through time. Phylodynamic inference based on pathogen genetic sequence data has emerged as useful supplement to epidemic surveillance, however commonly-used mechanistic models that are typically fitted to non-genetic surveillance data are rarely fitted to pathogen genetic data due to a dearth of software tools, and the theory required to conduct such inference has been developed only recently. We present a framework for coalescent-based phylogenetic and phylodynamic inference which enables highly-flexible modeling of demographic and epidemiological processes. This approach builds upon previous structured coalescent approaches and includes enhancements for computational speed, accuracy, and stability. A flexible markup language is described for translating parametric demographic or epidemiological models into a structured coalescent model enabling simultaneous estimation of demographic or epidemiological parameters and time-scaled phylogenies. We demonstrate the utility of these approaches by fitting compartmental epidemiological models to Ebola virus and Influenza A virus sequence data, demonstrating how important features of these epidemics, such as the reproduction number and epidemic curves, can be gleaned from genetic data. These approaches are provided as an open-source package PhyDyn for the BEAST2 phylogenetics platform.
Erik M. Volz, Igor Siveroni
PLoS Comput. Biol.2
2013 Proactive and Reactive Runtime Service Discovery: A Framework and Its Evaluation
abstract
The identification of services during the execution of service-based applications to replace services in them that are no longer available and/or fail to satisfy certain requirements is an important issue. In this paper, we present a framework to support runtime service discovery. This framework can execute service discovery queries in pull and push mode. In pull mode, it executes queries when a need for finding a replacement service arises. In push mode, queries are subscribed to the framework to be executed proactively and, in parallel with the operation of the application, to identify adequate services that could be used if the need for replacing a service arises. Hence, the proactive (push) mode of query execution makes it more likely to avoid interruptions in the operation of service-based applications when a service in them needs to be replaced at runtime. In both modes of query execution, the identification of services relies on distance-based matching of structural, behavioral, quality, and contextual characteristics of services and applications. A prototype implementation of the framework has been developed and an evaluation was carried out to assess the performance of the framework. This evaluation has shown positive results, which are discussed in the paper.
Andrea Zisman, George Spanoudakis, James Dooley, Igor Siveroni
IEEE Trans. Software Eng.4
2010 A UML-based static verification framework for security
Igor Siveroni, Andrea Zisman, George Spanoudakis
Requir. Eng.1
2008 Property Specification and Static Verification of UML Models
abstract
We present a static verification tool (SVT), a system that performs static verification on UML models composed of UML class and state machine diagrams. Additionally, the SVT allows the user to add extra behavior specification in the form of guards and effects by defining a small action language. UML models are checked against properties written in a special-purpose property language that allows the user to specify linear temporal logic formulas that explicitly reason about UML components. Thus, the SVT provides a strong foundation for the design of reliable systems and a step towards model-driven security.
Igor Siveroni, Andrea Zisman, George Spanoudakis
ARES1
1999 Constraint Systems for Useless Variable Elimination
abstract
A useless variable is one whose value contributes nothing to the final outcome of a computation. Such variables are unlikely to occur in human-produced code, but may be introduced by various program transformations. We would like to eliminate useless parameters from procedures and eliminate the corresponding actual parameters from their call sites. This transformation is the extension to higher-order programming of a variety of dead-code elimination optimizations that are important in compilers for first-order imperative languages.
Mitchell Wand, Igor Siveroni
POPL2