BDD-based software verification

Beyer, Dirk; Stahlbauer, Andreas

doi:10.1007/s10009-014-0334-1

Cited by 26 publications

(7 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The general approach has been described in [89,90], while variants to introduce highly parallel benchmarks are discussed in [87,88,91]. RERS benchmarks have been used also by other competitions, like MCC or SV-COMP, and referenced in a number of research papers as a means of evaluation not only in the context of RERS [31,62,75,77,80,83].…”

Section: Mcc: the Model Checking Contestmentioning

confidence: 99%

TOOLympics 2019: An Overview of Competitions in Formal Methods

Bartocci

Beyer

Black³

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Evaluation of scientific contributions can be done in many different ways. For the various research communities working on the verification of systems (software, hardware, or the underlying involved mechanisms), it is important to bring together the community and to compare the state of the art, in order to identify progress of and new challenges in the research area. Competitions are a suitable way to do that. The first verification competition was created in 1992 (SAT competition), shortly followed by the CASC competition in 1996. Since the year 2000, the number of dedicated verification competitions is steadily increasing. Many of these events now happen regularly, gathering researchers that would like to understand how well their research prototypes work in practice. Scientific results have to be reproducible, and powerful computers are becoming cheaper and cheaper, thus, these competitions are becoming an important means for advancing research in verification technology. TOOLympics 2019 is an event to celebrate the achievements of the various competitions, and to understand their commonalities and differences. This volume is dedicated to the presentation of the 16 competitions that joined TOOLympics as part of the celebration of the 25 th anniversary of the TACAS conference.

show abstract

Section: Mcc: the Model Checking Contestmentioning

confidence: 99%

TOOLympics 2019: An Overview of Competitions in Formal Methods

Bartocci

Beyer

Black³

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…• a simulation environment to generate and investigate specific behaviours of the system; Compared to our approach, the ones in [10] and [12] do not provide methods for verifying application-specific properties like redundancy, consistency and usability of rules. The work presented in [16] is not tailored to a specific rule language and requires a specific model checking tool, while the verification methods proposed in our work are based on a domain-specific language for IE, and allow the definition and the implementation of verification algorithms that can use efficient techniques such as SMT solvers and theorem provers.…”

Section: Our Contributionmentioning

confidence: 99%

“…This allows the checking of termination and confluence properties. Authors in [12] investigate the possibility of using a pure Binary Decision Diagram ( [13]) representation of integer values, and they focus on a particular class of programs. These are ECA rule-based programs with restricted numerical operations.…”

Section: Introductionmentioning

confidence: 99%

Analysis and verification of ECA rules in intelligent environments

Cacciagrano

Corradini

Culmone

et al. 2018

AIS

View full text Add to dashboard Cite

“…Authors in [3] investigate the possibility of using a pure Binary decision diagram (BDD) [5] representation of integer values, and they focus on a particular class of programs, i.e. ECA rule-based programs with restricted operations.…”

Section: Related Literaturementioning

confidence: 99%

“…According to the running example D house , the corresponding universe Φhouse has cardinality given by 2 3 . By adding invariants to the system, i.e.…”

Section: Definitionmentioning

confidence: 99%

Symbolic verification of event–condition–action rules in intelligent environments

Vannucchi

Diamanti

Mazzante

et al. 2017

J Reliable Intell Environ

View full text Add to dashboard Cite

In this paper we show how state-of-the art SMT-based techniques for software verification can be employed in the verification of event–condition–action rules in intelligent environments. Moreover, we exploit the specific features of intelligent environments to optimise the verification process. We compare our approach with previous work in a detailed evaluation section, showing how it improves both performance and expressivity of the language for event–condition–action rules

show abstract

BDD-based software verification

Cited by 26 publications

References 41 publications

TOOLympics 2019: An Overview of Competitions in Formal Methods

TOOLympics 2019: An Overview of Competitions in Formal Methods

Analysis and verification of ECA rules in intelligent environments

Symbolic verification of event–condition–action rules in intelligent environments

Contact Info

Product

Resources

About