Ideal specification formalism # = expressivity + compositionality + decidability + testability + …
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Proving correctness with respect to nondeterministic safety specifications
Information Processing Letters
On characterization of safety and liveness properties in temporal logic
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The Expressive Power of Implicit Specifications
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Deciding Branching Time Logic: A Triple Exponential Decision Procedure for CTL*
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Behavior-based model construction
International Journal on Software Tools for Technology Transfer (STTT)
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Monitoring Interfaces for Faults
Electronic Notes in Theoretical Computer Science (ENTCS)
Monitoring the Full Range of ω -Regular Properties of Stochastic Systems
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
Monitoring temporal properties of stochastic systems
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Promptness in w-regular automata
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Monitorability of stochastic dynamical systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Monitoring off-the-shelf components
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Runtime monitoring of stochastic cyber-physical systems with hybrid state
RV'11 Proceedings of the Second international conference on Runtime verification
| Hi-index | 0.00 |
Software is often being assembled using third-party components where the developers have little knowledge of, and even less control over, the internals of the components comprising the overall system. One obstacle to composing agents is that current formal methods are mainly concerned with "closed" systems that are built from the ground up. Such systems are fully under the control of the user.Hence, problems arising from ill-specified components can be resolved by a close inspection of the systems. When composing systems using "off-the-shelf" components, this is often no longer the case.The paper addresses the problem of under-specification, where an off-the-shelf component does only what it claims to do, however, it claims more behaviors than it actually has and that one wishes for, some of which may render it useless. Given such an under-specified module, we propose a method to automatically synthesize some safety properties from it that would tame its "bad" behaviors. The advantage of restricting to safety properties is that they are monitorable.The safety properties are derived using an automata-theoretic approach. We show that, when restricting to ω-regular languages, there is no maximal safety property. For this case we construct a sequence of increasingly larger safety properties. We also show how to construct an infinite-state automata that can capture any safety property that is contained in the original specifications.