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

Felix Gigler

dblp:278/8813 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-6495-9048ORCID · corroborated

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security › program analysis
specification mining
0.412020
Mining Shape Expressions From Positive Examples · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Embedded and real-time systems
cyber-physical systems
0.112020
Mining Shape Expressions From Positive Examples · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020
Automata and formal languages › regular languages
regular expressions
0.112020
Mining Shape Expressions From Positive Examples · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020

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

unsupervised clustering · 1.3linear regression · 1.3finite automata learning · 1.3
YearPublicationVenuePosition
2021 Sampling of shape expressions with ShapEx
abstract
In this paper we present ShapEx, a tool that generates random behaviors from shape expressions, a formal specification language for describing sophisticated temporal behaviors of CPS. The tool samples a random behavior in two steps: (1) it first explores the space of qualitative parameterized shapes and then (2) instantiates parameters by sampling a possibly non-linear constraint. We implement several sampling strategies in the tool that we present in the paper and demonstrate its applicability on two use scenarios.
Nicolas Basset, Thao Dang 0001, Felix Gigler, Cristinel Mateis, Dejan Nickovic
MEMOCODE3
2020 Mining Shape Expressions From Positive Examples
abstract
Shape expressions (SEs) is a novel specification language that was recently introduced to express behavioral patterns over real-valued signals observed during the execution of cyber-physical systems. An SE is a regular expression composed of arbitrary parameterized shapes, such as lines, exponential curves, and sinusoids as atomic symbols with symbolic constraints on the shape parameters. SEs enable a natural and intuitive specification of complex temporal patterns over possibly noisy data. In this article, we propose a novel method for mining a broad and interesting fragment of SEs from time-series data using a combination of techniques from linear regression, unsupervised clustering, and learning finite automata from positive examples. The learned SE for a given dataset provides an explainable and intuitive model of the observed system behavior. We demonstrate the applicability of our approach on two case studies from different application domains and experimentally evaluate the implemented specification mining procedure.
Ezio Bartocci, Jyotirmoy V. Deshmukh, Felix Gigler, Cristinel Mateis, Dejan Nickovic
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3