Suchergebnisse - Theory of computation Semantics and reasoning Program reasoning Program verification*

Automatic Web Testing Using Curiosity-Driven Reinforcement Learning von Zheng, Yan, Liu, Yi, Xie, Xiaofei, Liu, Yepang, Ma, Lei, Hao, Jianye, Liu, Yang

“… Web testing has long been recognized as a notoriously difficult task. Even nowadays, web testing still mainly relies on manual efforts in many cases while …”
Volltext

Improving Fault Localization by Integrating Value and Predicate Based Causal Inference Techniques von Kucuk, Yigit, Henderson, Tim A. D., Podgurski, Andy

“… inference, to automatically score program elements based on how likely they are to be faulty. SFL techniques typically employ one type of profile data …”
Volltext

Gpass: A Goal-Adaptive Neural Theorem Prover Based on Coq for Automated Formal Verification von Chen, Yizhou, Sun, Zeyu, Wang, Guoqing, Hao, Dan

“… Formal verification is a crucial means to assure software quality. Regrettably, the manual composition of verification scripts proves to be both laborious and time-consuming …”
Volltext

Fast and Precise On-the-Fly Patch Validation for All von Chen, Lingchao, Ouyang, Yicheng, Zhang, Lingming

“… Generate-and-validate (G&V) automated program repair (APR) techniques have been extensively studied during the past decade …”
Volltext

PRoofster: Automated Formal Verification von Agrawal, Arpan, First, Emily, Kaufman, Zhanna, Reichel, Tom, Zhang, Shizhuo, Zhou, Timothy, Sanchez-Stern, Alex, Ringer, Talia, Brun, Yuriy

“… Formal verification is an effective but extremely work-intensive method of improving software quality …”
Volltext

CPA-DF: A Tool for Configurable Interval Analysis to Boost Program Verification von Beyer, Dirk, Chien, Po-Chun, Lee, Nian-Ze

“… Software verification is challenging, and auxiliary program invariants are used to improve the effectiveness of verification approaches …”
Volltext

A Bunched Logic for Conditional Independence von Bao, Jialu, Docherty, Simon, Hsu, Justin, Silva, Alexandra

“… Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs …”
Volltext

Guiding Dynamic Symbolic Execution toward Unverified Program Executions von Christakis, Maria, Muller, Peter, Wustholz, Valentin

“… Most techniques to detect program errors, such as testing, code reviews, and static program analysis, do not fully verify all possible executions of a program …”
Volltext

EvoSpex: An Evolutionary Algorithm for Learning Postconditions von Molina, Facundo, Ponzio, Pablo, Aguirre, Nazareno, Frias, Marcelo

“… Software reliability is a primary concern in the construction of software, and thus a fundamental component in the definition of software quality. Analyzing …”
Volltext

Data-Oriented Differential Testing of Object-Relational Mapping Systems von Sotiropoulos, Thodoris, Chaliasos, Stefanos, Atlidakis, Vaggelis, Mitropoulos, Dimitris, Spinellis, Diomidis

“… We introduce, what is to the best of our knowledge, the first approach for systematically testing Object-Relational Mapping (ORM) systems. Our approach …”
Volltext

LLM-Generated Invariants for Bounded Model Checking Without Loop Unrolling von Pirzada, Muhammad A. A., Bhayat, Ahmed, Cordeiro, Lucas C., Reger, Giles

“… We thus transform programs to loop-free variants in a sound manner. Our experimental results show that the resulting tool, ESBMC ibmc, is competitive with state …”
Volltext

Machine-Learning-Guided Selectively Unsound Static Analysis von Kihong Heo, Oh, Hakjoo, Kwangkeun Yi

“… We present a machine-learning-based technique for selectively applying unsoundness in static analysis. Existing bug-finding static analyzers are unsound in …”
Volltext

Responsibility and verification: Importance value in temporal logics von Mascle, Corto, Baier, Christel, Funke, Florian, Jantsch, Simon, Kiefer, Stefan

“… For this purpose, we apply the concept of Shapley values to verification as a means to evaluate how important a part of a system …”
Volltext

Insights from Rights and Wrongs: A Large Language Model for Solving Assertion Failures in RTL Design von Zhou, Jie, Ji, Youshu, Wang, Ning, Hu, Yuchen, Jiao, Xinyao, Yao, Bingkun, Fang, Xinwei, Zhao, Shuai, Guan, Nan, Jiang, Zhe

“… SystemVerilog Assertions (SVAs) are essential for verifying Register Transfer Level (RTL) designs, as they can be embedded into key functional paths to detect …”
Volltext

Reasoning-Based Software Testing von Giamattei, Luca, Pietrantuono, Roberto, Russo, Stefano

“… With software systems becoming increasingly pervasive and autonomous, our ability to test for their quality is severely challenged. Many systems are called to …”
Volltext

Discovering Likely Program Invariants for Persistent Memory von Huang, Zunchen, Ravi, Srivatsan, Wang, Chao

“… We propose a method for automatically discovering likely program invariants for persistent memory (PM …”
Volltext

Automated Verification of Go Programs via Bounded Model Checking von Dilley, Nicolas, Lange, Julien

“… However existing tools either miss too many bugs or cannot handle large programs. To address these limitations, we propose a static checker for Go programs which relies on performing bounded model checking of their concurrent behaviours …”
Volltext

Data-Driven Synthesis of Provably Sound Side Channel Analyses von Wang, Jingbo, Sung, Chungha, Raghothaman, Mukund, Wang, Chao

“… We propose a data-driven method for synthesizing static analyses to detect side-channel information leaks in cryptographic software. Compared to the …”
Volltext

JEST: N+1-Version Differential Testing of Both JavaScript Engines and Specification von Park, Jihyeok, An, Seungmin, Youn, Dongjun, Kim, Gyeongwon, Ryu, Sukyoung

“… Unlike in the conventional approach, in the modern CI/CD approach, a language specification is no more the oracle of the language semantics because both the specification and its implementations …”
Volltext

Demystifying Template-Based Invariant Generation for Bit-Vector Programs von Yao, Peisen, Ke, Jingyu, Sun, Jiahui, Fu, Hongfei, Wu, Rongxin, Ren, Kui

“… This is unfortunate because bit-precise reasoning is crucial for faithfully and accurately modeling machine integer semantics and, thus, for ensuring sound and precise program verification …”
Volltext