On the complexity of monitoring Orchids signatures, and recurrence equations

DOI10.1007/s10703-017-0303-xzbMath1394.68180OpenAlexW2766982626MaRDI QIDQ1667643

Jean-Philippe Lachance, Jean Goubault-Larrecq

Publication date: 30 August 2018

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-017-0303-x

zbMATH Keywords

complexityrecurrence equationsTarjan's algorithmstrongly connected componentsmonitor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Asymptotic enumeration (05A16)

Related Items (1)

Introduction to the special issue on runtime verification

Uses Software

• Orchids

Cites Work

• Closed-form upper bounds in static cost analysis
• Resource Analysis of Complex Programs with Cost Equations
• Monitoring Metric First-Order Temporal Properties
• Depth-First Search and Linear Graph Algorithms
• Computer Aided Verification
• Unnamed Item

This page was built for publication: On the complexity of monitoring Orchids signatures, and recurrence equations