AltGr-Ergo, a Graphical User Interface for the SMT Solver Alt-Ergo

Conchon, Sylvain; Iguernlala, Mohamed; Mebsout, Alain

doi:10.4204/eptcs.239.1

Cited by 4 publications

(3 citation statements)

References 8 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Why3 then uses a weakest-precondition calculus to generate verification conditions (VCs), i.e., logical formulas whose validity would imply soundness of the code with respect to its checks and contracts. Why3 then uses multiple theorem provers/satisfiability modulo theory (SMT) solvers to discharge the VCs, including CVC4 [Barrett et al, 2011], Alt-Ego [Conchon et al, 2018], and Z3 [ de Moura and Bjørner, 2008]. While the tools attempt to automate this process, sometimes additional assertions in the code must be provided by the user to guide the underlying provers.…”

Section: Related Workmentioning

confidence: 99%

Unveiling the Strength of Digital Objects: The Impact of the Digital Object Concept on Technology Acceptance

Califf,

Springer

2024

Proceedings of the Annual Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

Many distributed systems use a minimum spanning tree (MST) as the backbone of efficient communication within the system. Given its critical role, it is important that the MST be implemented correctly. One way to ensure its correctness with a high degree of confidence is to use formal methods, i.e. mathematically-based tools and approaches for design and verification of software and hardware. Toward this end, we implement Prim's algorithm for construction of MSTs in SPARK, which is both a programming language and associated set of formal verification tools. At the most basic levels, formal verification in SPARK requires proving that code satisfies contracts on data flow and initialization and is free of run-time errors, which often reveals rare or subtle errors that are hard to detect through testing alone. Once errors are corrected and formal verification is complete, the result is code that is mathematically proven to satisfy the verified properties. In this paper, we provide background on SPARK and describe the process of using it to implement and verify basic properties of MSTs constructed using Prim's algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Unveiling the Strength of Digital Objects: The Impact of the Digital Object Concept on Technology Acceptance

Califf,

Springer

2024

Proceedings of the Annual Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

show abstract

“…Its three main verification plug-ins are E-ACSL [28], Eva [9] and WP [8]. E-ACSL is a runtime assertion checker [11] that verifies ACSL properties during concrete program runs, Eva is a static tool based on abstract interpretation [27] that raises alarms on any potential undefined behavior and invalid ACSL property, and WP relies on deductive methods [20] for proving ACSL properties thanks to associated provers, such as Alt-Ergo [13]. As explained later, we use all of them on our case studies, together with CASTT.…”

Section: Verifying Consent With Casttmentioning

confidence: 99%

Context Specification Language for Formally Verifying Consent Properties on Models and Code

Clouet

Antignac

Arnaud

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Recent privacy laws and regulations raise the stakes in verifying that software systems respect user consent. The current state of the art shows that privacy by design and formal methods can help. Still, ensuring the validity of privacy properties, in particular consent properties, at different stages of software development, is hard. This paper proposes a step towards solving this issue by introducing a new tool, named CASTT, that allows software engineers to verify consent properties at two different development stages: system modeling and code verification. To describe the system, this paper introduces a new formal context specification language named CSpeL, which allows to specify the key elements involved in consent and their relationships. The tool is evaluated on two use cases targeting different application domains: healthcare and website. We also evaluate the correctness and the efficiency of our tool.

show abstract

“…SMT solvers may also handle quantified formulas [7,2,8,4]. For that, they use heuristics to find good instances of universally-quantified lemmas present in the problem.…”

Section: Theorem Instantiationmentioning

confidence: 99%

Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers

Conchon¹,

Melquiond²,

Roux³

et al.

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

The treatment of the axiomatic theory of floating-point numbers is out of reach of current SMT solvers, especially when it comes to automatic reasoning on approximation errors. In this paper, we describe a dedicated procedure for such a theory, which provides an interface akin to the instantiation mechanism of an SMT solver. This procedure is based on the approach of the Gappa tool: it performs saturation of consequences of the axioms, in order to refine bounds on expressions. In addition to the original approach, bounds are further refined by a constraint solver for linear arithmetic. Combined with the natural support for equalities provided by SMT solvers, our approach improves the treatment of goals coming from deductive verification of numerical programs. We have implemented it in the Alt-Ergo SMT solver.

show abstract

AltGr-Ergo, a Graphical User Interface for the SMT Solver Alt-Ergo

Cited by 4 publications

References 8 publications

Unveiling the Strength of Digital Objects: The Impact of the Digital Object Concept on Technology Acceptance

Unveiling the Strength of Digital Objects: The Impact of the Digital Object Concept on Technology Acceptance

Context Specification Language for Formally Verifying Consent Properties on Models and Code

Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers

Contact Info

Product

Resources

About