Nov 22, 2015 · This paper proposes a novel optimization of bounded model checking (BMC) for better run-time efficiency. Specifically, we define projections ...
A novel optimization of bounded model checking (BMC) for better run-time efficiency is proposed, which defines projections, an adaptation of dynamic program ...
We propose a symbolic encoding of projections and implement it for a prototype language of concurrent programs. We have developed a tool called PBMC to evaluate ...
Full text not available from this repository. Abstract. This paper proposes a novel optimization of bounded model checking (BMC) for better run-time efficiency.
PBMC: Symbolic Slicing for the Verification of Concurrent Programs. Author, Saissi, Habib; Bokor, Peter; Suri, Neeraj. Date, 2015. Type, Conference Proceedings.
PBMC: Symbolic Slicing for the Verification of Concurrent Programs. H Saissi, P Bokor, N Suri. Automated Technology for Verification and Analysis: 13th ...
A program slice consists of the parts of a program that may affect or are affected by the value being computed at the point of interest.
PBMC: Symbolic slicing for the verification of concurrent programs. Saissi, H., Bokor, P. & Suri, N., 2015, Automated Technology for Verification and ...
Quick verification of concurrent programs by iteratively relaxed scheduling. ASE 2017: 776-781 ... PBMC: Symbolic Slicing for the Verification of Concurrent ...
PBMC: Symbolic Slicing for the Verification of Concurrent Programs
tubiblio.ulb.tu-darmstadt.de › ...
May 17, 2018 · Saissi, Habib ; Bokor, Peter ; Suri, Neeraj (2015) PBMC: Symbolic Slicing for the Verification of Concurrent Programs. Konferenzveröffentlichung ...