Demo Data from VLDB 2026 / reviewers in the wild / expert
Carlo Montangero
dblp:m/CarloMontangero
· DBLP profile ↗
19ranked-venue papers
9as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 8 · 1 first-authorTheory of computation · 5 · 2 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
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.
| Network and information security
1 paper |
Systems and software security · 100% | |
| Software engineering, system software, and programming languages
4 papers |
Requirements engineering and software design · 56% Program analysis · 38% Programming languages and type systems · 6% |
Topics — the 5 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis
security analysis |
0.0 | 1 | 2005 | End-to-End Integrated Security and Performance Analysis on the DEGAS Choreographer Platform · FM 2005 |
Programming languages and type systems
language design |
0.0 | 1 | 1975 | MAGMA-LISP: A "Machine Language" For Artificial Intelligence · IJCAI 1975 |
Programming languages and type systems › functional programming
lisp |
0.0 | 1 | 1975 | MAGMA-LISP: A "Machine Language" For Artificial Intelligence · IJCAI 1975 |
Processor architecture and microarchitecture
microprogramming |
0.0 | 1 | 1974 | An Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital Computers · IEEE Trans. Computers 1974 |
Electronic design automation
logic synthesis |
0.0 | 1 | 1974 | An Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital Computers · IEEE Trans. Computers 1974 |
Methods — techniques the papers use, named apart from their topics
performance analysis · 0.1choreography · 0.1policy-based checking · 0.0formal modeling · 0.0tabular technique · 0.0heuristically guided search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Logic-based Conflict Detection for Distributed Policies
Carlo Montangero, Stephan Reiff-Marganiec, Laura Semini |
Fundam. Informaticae | 1 |
| 2006 | A Logical View of Choreography
Carlo Montangero, Laura Semini |
COORDINATION | 1 |
| 2005 | End-to-End Integrated Security and Performance Analysis on the DEGAS Choreographer Platform
Mikael Buchholtz, Stephen Gilmore, Valentin Haenel, Carlo Montangero |
FM | 4 |
| 2004 | Logic Based Coordination for Event-Driven Self-healing Distributed Systems
Carlo Montangero, Laura Semini, Simone Semprini |
COORDINATION | 1 |
| 2002 | A UML Profile to Support the Formal Presentation of Software ArchitectureabstractWe present a UML profile that accommodates the specialized dynamic models that support the Oikos_adtl approach to software architecture. The profile reflects some core modeling Oikos_adtl concepts in the UML framework. We propose the related notations and diagrams, which map into the new models. Since we rely on the standard UML extension mechanisms, we are also setting the requirements for add-ins to the standard UML tools, to support our approach to the formal specification and analysis of software architectures. Amjad Hudaib, Carlo Montangero |
COMPSAC | 2 |
| 2002 | istributed States LogicabstractWe introduce a temporal logic to reason on global applications. First, we define a modal logic for localities that embeds the local theories of each component into a theory of the distributed states of the system. We provide the logic with a sound and complete axiomatization. Then, we extend the logic with a temporal operator. The contribution is that it is possible to reason about properties that involve several components in a natural way, even in the absence of a global clock, as required in an asynchronous setting. Carlo Montangero, Laura Semini |
TIME | 1 |
| 2002 | Mark, a Reasoning Kit for Mobility
Gian-Luigi Ferrari 0002, Carlo Montangero, Laura Semini, Simone Semprini |
Autom. Softw. Eng. | 2 |
| 2000 | Mobile Agents Coordination in Mobadtl
Gian-Luigi Ferrari 0002, Carlo Montangero, Laura Semini, Simone Semprini |
COORDINATION | 2 |
| 1999 | Composing Specifications for Coordination
Carlo Montangero, Laura Semini |
COORDINATION | 1 |
| 1999 | A Refinement Calculus for Tuple Spaces
Laura Semini, Carlo Montangero |
Sci. Comput. Program. | 2 |
| 1999 | Managing Standards ComplianceabstractSoftware engineering standards determine practices that "compliant" software processes shall follow. Standards generally define practices in terms of constraints that must hold for documents. The document types identified by standards include typical development products, such as user requirements, and also process-oriented documents, such as progress reviews and management reports. The degree of standards compliance can be established by checking these documents against the constraints. It is neither practical nor desirable to enforce compliance at all points in the development process. Thus, compliance must be managed rather than imposed. We outline a model of standards and compliance and illustrate it with some examples. We give a brief account of the notations and method we have developed to support the use of the model and describe a support environment we have constructed. The principal contributions of our work are: the identification of the issue of standards compliance; the development of a model of standards and support for compliance management; the development of a formal model of product state with associated notation; a powerful policy scheme that triggers checks; and a flexible and scalable compliance management view. Wolfgang Emmerich, Anthony Finkelstein, Carlo Montangero, Stefano Antonelli, Stephen Armitage, Richard Stevens |
IEEE Trans. Software Eng. | 3 |
| 1995 | Compositional Refinements in Multiple Blackboard Systems
X. J. Chen, Carlo Montangero |
Acta Informatica | 2 |
| 1994 | Software Process Monitoring Mechanisms in OikosabstractCollecting information about the performance of a software process is a necessary step for the assessment of the process quality. Oikos is an environment for the definition and the enactment of software process models. This paper presents the Oikos approach to history recording. We define the events that compose the histories and explain how the events to be monitored can be selected. Finally, we discuss the implementation of the recording mechanism. Carlo Montangero, Franco Scarselli |
Int. J. Softw. Eng. Knowl. Eng. | 1 |
| 1992 | Compositional Refinements in Multiple Blackboard Systems
X. J. Chen, Carlo Montangero |
ESOP | 2 |
| 1985 | Automatic generation of execution tools in a GANDALF environment
Vincenzo Ambriola, Carlo Montangero |
J. Syst. Softw. | 2 |
| 1978 | Information Management in Context Trees
Carlo Montangero, Giuliano Pacini, Maria Simi, Franco Turini |
Acta Informatica | 1 |
| 1975 | MAGMA-LISP: A "Machine Language" For Artificial Intelligence
Carlo Montangero, Giuliano Pacini, Franco Turini |
IJCAI | 1 |
| 1974 | Graph Representation and Computation Rules for Typeless Recursive Languages
Giuliano Pacini, Carlo Montangero, Franco Turini |
ICALP | 2 |
| 1974 | An Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital ComputersabstractThis paper illustrates an algorithm for finding a read-only memory (ROM) specification, optimal in the sense that it results in a minimum ROM bit dimension, starting with an instruction set description which employs acyclic directed graphs. The algorithm selects (by a tabular technique) a descriptive graph subset, shown to be sufficient; then it performs a heuristically guided search among possible solutions generated by the graphs in the subset. The algorithm works for instructions which are such that a microevent occurs at most once in a single instruction; some results apply to the general case as well. Carlo Montangero |
IEEE Trans. Computers | 1 |