Feature interaction detection by pairwise analysis of LTL properties -- A case study
From MaRDI portal
Publication:853722
DOI10.1007/S10703-006-0002-5zbMATH Open1103.68377OpenAlexW1976758788WikidataQ59675375 ScholiaQ59675375MaRDI QIDQ853722FDOQ853722
Authors: M. Calder, Alice Miller 
Publication date: 17 November 2006
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-006-0002-5
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14)
Cites Work
- Characterizing finite Kripke structures in propositional temporal logic
- Title not available (Why is that?)
- Reasoning about systems with many processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The temporal semantics of concurrent programs
- “Sometimes” and “not never” revisited
- On Reasoning About Rings
- A structural induction theorem for processes
- Title not available (Why is that?)
- Slicing software for model construction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular modelling of signalling pathways and their cross-talk
- Title not available (Why is that?)
- Type inference and strong static type checking for Promela
- Title not available (Why is that?)
- Title not available (Why is that?)
- Objects, Agents, and Features
Uses Software
This page was built for publication: Feature interaction detection by pairwise analysis of LTL properties -- A case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853722)
