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

M. Fareed Arif

dblp:160/8477 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
2since 2021 · last 2023
0009-0003-5250-127XORCID · corroborated

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

Theory of computation · 4 · 3 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-author · 1 since 2021Security and privacy · 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.

Computer networks
1 paper
Software-defined and programmable networks · 50% Network management and operations · 50%

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

TopicWeightPapersLastEvidence papers
Network management and operations
network verification
0.512021
PHOENIX: Device-Centric Cellular Network Protocol Monitoring using Runtime Verification · NDSS 2021
Software-defined and programmable networks
runtime verification
0.512021
PHOENIX: Device-Centric Cellular Network Protocol Monitoring using Runtime Verification · NDSS 2021

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

runtime verification · 0.5
YearPublicationVenuePosition
2023 CRV: Automated Cyber-Resiliency Reasoning for System Design Models
Daniel Larraz, Robert Lorch, Moosa Yahyazadeh, M. Fareed Arif, Omar Chowdhury, Cesare Tinelli
FMCAD4
2021 PHOENIX: Device-Centric Cellular Network Protocol Monitoring using Runtime Verification
Mitziu Echeverria, Bincheng Wang, M. Fareed Arif, Syed Rafiul Hussain, Omar Chowdhury
NDSS4
2020 SYSLITE: Syntax-Guided Synthesis of PLTL Formulas from Finite Traces
abstract
We present an efficient approach to learn past-time linear temporal logic formulas (PLTL) from a set of propositional variables and a sample of finite traces over those variables.The efficiency of our approach can be attributed to a careful encoding of the PLTL formula learning problem as a bit-vector function synthesis problem, and the use of an enhanced Syntax-Guided Synthesis (SyGuS) engine to solve the latter.We implemented our approach in a tool called SYSLITE and empirically evaluated its efficacy with two case studies.In these case studies, we observe that SYSLITE on average enjoys a speedup of 44x over current learning approaches for temporal formulas while learning the expected formulas in the vast majority of cases.
M. Fareed Arif, Daniel Larraz, Mitziu Echeverria, Andrew Reynolds 0001, Omar Chowdhury, Cesare Tinelli
FMCAD1
2016 BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies
M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, João Marques-Silva 0001
SAT1
2015 Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
M. Fareed Arif, Carlos Mencía, João Marques-Silva 0001
SAT1