Open Source
BehaVerify: A Formal Verification Tool for Behavior Trees
arXiv cs.SE0 views
arXiv:2611.22403v1 Announce Type: new Abstract: This paper presents BehaVerify, a verification toolbox for behavior trees (BTs) and Neuro-Symbolic BTs. BTs are a graphical language for planning and sequencing behaviors - similar to extended state machines - and are increasingly used in safety-critical domains. BehaVerify enables users to specify a BT using a Domain Specific Language (DSL) with formal syntax and semantics. This language further includes Linear Temporal Logic and Computation Tree Logic specifications. BehaVerify uses an efficient encoding into nuXmv, called fastforwarding, to quickly verify if a specification holds over the BT. Additionally, BehaVerify can generate implementations of the BT in Python and Haskell. Through Python, BehaVerify has been integrated with PyTrees and Robot Operating System (ROS) and has been deployed to several autonomous robotic systems, including for verifying runtime monitors. While prior works have developed the underlying theory, this manuscript focuses on the toolbox usage, functionality and implementation. BehaVerify is open source: https://github.com/verivital/behaverify
Source:https://arxiv.org/abs/2611.22403PreviousFormal Analysis of a Fault-Tolerant Extension of the ROSACE Flight ControllerNextAdaptive Budget Allocation for Smart-Contract Fuzzing: Why Online Feedback Fails to Improve Vulnerability Triage
Related posts
GTA 6 Review: The Megayacht of Gaming Has Something for Nearly Everyone
0CNET News

Grand Theft Auto VI does something impossible — it lives up to the hype
0The Verge
Birdsong's "language-like" Zipf law is matched by simple syllable rules, and song with no words passes the whale controls
0dev.to

AGPL vs MIT vs Open Core: Choosing Open Source Collaboration Software
0dev.to OpenSource
From exposed secrets to managed credentials: Reducing credential risk across the application lifecycle
0HashiCorp Blog
AgentLens: Revealing The Lucky Pass Problem in SWE-Agent Evaluation
0arXiv cs.SE