Automated Verification and Tightening of Failure Propagation Models

Authors: Benjamin Bittner, Marco Bozzano, Alessandro Cimatti, Gianni Zampedri

AAAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental The proposed approach is evaluated on a number of synthetic and industrial benchmarks.
Researcher Affiliation Collaboration Benjamin Bittner,1,2 Marco Bozzano,1 Alessandro Cimatti,1 Gianni Zampedri,1 1Fondazione Bruno Kessler, 2University of Trento Trento, Italy
Pseudocode No The paper does not include any explicitly labeled "Pseudocode" or "Algorithm" blocks.
Open Source Code No The paper states "Benchmark files and theorem proofs are downloadable at es.fbk.eu/people/bittner/aaai16.tar.gz." but does not explicitly provide open-source code for the methodology described.
Open Datasets Yes Additionally we ran our implementation on two discrete untimed industrial models, WBS (Bozzano et al. 2015a) describing an aircraft wheel-braking system, and X34 (Bajwa and Sweet 2003) describing the propulsion system of an experimental spacecraft.
Dataset Splits No The paper describes experimental runs on various models and benchmarks but does not provide specific training/validation/test dataset splits or methodologies.
Hardware Specification Yes All tests were run on a dedicated 64bit Linux computer with a 12 core Intel Xeon CPU at 2.67 GHz and 100GB of RAM.
Software Dependencies No The paper mentions that the prototype is implemented on top of "x SAP (Bittner et al. 2015)" and "nu Xmv (Cavada et al. 2014)", but does not explicitly state specific version numbers for these software dependencies.
Experiment Setup Yes Each test was executed on a single core with a time limit of 3600 seconds and a memory limit of 4GB.