Michele Dorigatti

dblp:139/7087 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Software engineering, systems software and programming languages · 2Security and privacy · 1Theory of computation · 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.

Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking › model checking
symbolic model checking
0.212014
The nuXmv Symbolic Model Checker · CAV 2014
Program verification
contract verification
0.212013
OCRA: A tool for checking the refinement of temporal contracts · ASE 2013
Program verification
temporal logic verification
0.212013
OCRA: A tool for checking the refinement of temporal contracts · ASE 2013
Embedded and real-time systems
component-based design
0.012013
OCRA: A tool for checking the refinement of temporal contracts · ASE 2013

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

refinement checking · 0.3linear-time temporal logic · 0.3
YearPublicationVenuePosition
2014 The nuXmv Symbolic Model Checker
Roberto Cavada, Alessandro Cimatti, Michele Dorigatti, Alberto Griggio, Alessandro Mariotti, Andrea Micheli, Sergio Mover, Marco Roveri, Stefano Tonetta
CAV3
2014 Making Implicit Safety Requirements Explicit - An AUTOSAR Safety Case
Thomas Arts, Michele Dorigatti, Stefano Tonetta
SAFECOMP2
2013 OCRA: A tool for checking the refinement of temporal contracts
abstract
Contract-based design enriches a component model with properties structured in pairs of assumptions and guarantees. These properties are expressed in term of the variables at the interface of the components, and specify how a component interacts with its environment: the assumption is a property that must be satisfied by the environment of the component, while the guarantee is a property that the component must satisfy in response. Contract-based design has been recently proposed in many methodologies for taming the complexity of embedded systems. In fact, contract-based design enables stepwise refinement, compositional verification, and reuse of components. However, only few tools exist to support the formal verification underlying these methods. OCRA (Othello Contracts Refinement Analysis) is a new tool that provides means for checking the refinement of contracts specified in a linear-time temporal logic. The specification language allows to express discrete as well as metric real-time constraints. The underlying reasoning engine allows checking if the contract refinement is correct. OCRA has been used in different projects and integrated in CASE tools.
Alessandro Cimatti, Michele Dorigatti, Stefano Tonetta
ASE2