Using formal specifications to support testing

RM Hierons, K Bogdanov, JP Bowen… - ACM Computing …, 2009 - dl.acm.org
Formal methods and testing are two important approaches that assist in the development of
high-quality software. While traditionally these approaches have been seen as rivals, in …

Software Verification with CPAchecker 3.0: Tutorial and User Guide

D Baier, D Beyer, PC Chien, MC Jakobs… - … Symposium on Formal …, 2024 - Springer
This tutorial provides an introduction to CPAchecker for users. CPAchecker is a flexible and
configurable framework for software verification and testing. The framework provides many …

The tool TINA–construction of abstract state spaces for Petri nets and time Petri nets

B Berthomieu*, PO Ribet, F Vernadat - International journal of …, 2004 - Taylor & Francis
In addition to the graphic-editing facilities, the software tool Tina proposes the construction of
a number of representations for the behaviour of Petri nets or Time Petri nets. Various …

Scyther: Semantics and verification of security protocols

CJF Cremers - 2006 - research.tue.nl
Recent technologies have cleared the way for large scale application of electronic
communication. The open and distributed nature of these communications implies that the …

Component-based synthesis for complex APIs

Y Feng, R Martins, Y Wang, I Dillig… - Proceedings of the 44th …, 2017 - dl.acm.org
Component-based approaches to program synthesis assemble programs from a database
of existing components, such as methods provided by an API. In this paper, we present a …

[KIRJA][B] Heuristic search: theory and applications

S Edelkamp, S Schrödl - 2011 - books.google.com
Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

CPAchecker 2.3 with Strategy Selection: (Competition Contribution)

D Baier, D Beyer, PC Chien, M Jankola, M Kettl… - … Conference on Tools …, 2024 - Springer
CPAchecker is a versatile framework for software verification, rooted in the established
concept of configurable program analysis. Compared to the last published system …

Abstract interpretation based formal methods and future challenges

P Cousot - Informatics: 10 Years Back, 10 Years Ahead, 2001 - Springer
In order to contribute to the solution of the software reliability problem, tools have been
designed to analyze statically the run-time behavior of programs. Because the correctness …

Rewrite rule inference using equality saturation

C Nandi, M Willsey, A Zhu, YR Wang, B Saiki… - Proceedings of the …, 2021 - dl.acm.org
Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify
expressions or prove equivalences. Develo** rewrite rules can be difficult: rules may be …

A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties

S Escobar, C Meadows, J Meseguer - Theoretical Computer Science, 2006 - Elsevier
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of
cryptographic protocols that has been used with great effect on a number of complex real-life …