A Practical Approach to Partial Functions in CVC Lite

Berezin, Sergey; Barrett, Clark; Shikanian, Igor; Chećhik, Marsha; Gurfinkel, Arie; Dill, David L.

doi:10.1016/j.entcs.2004.06.064

Cited by 18 publications

(33 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Next, we need to show proof obligation (5). For brevity, we only show it for the second postcondition, which is the interesting case containing recursion:…”

Section: Proof Obligationsmentioning

confidence: 99%

“…Here, e is a variable assignment that maps the free variables of ϕ to values. For the interpretation in partial structures [ϕ] 3 M e, we follow Berezin et al [5]: intuitively, the interpretation of a function is defined if and only if the interpretations of all parameters are defined and the vector of parameters belongs to the function domain. The interpretation of logical operators and quantifiers is defined according to Kleene logic [20].…”

Section: Structures and Interpretationsmentioning

confidence: 99%

“…Therefore, we apply a technique that reduces the 3-valued domain to a 2-valued domain by ensuring that ⊥ is never encountered. This is a standard technique applied in different tools, for instance, in B [4], CVC Lite [5], and ESC/Java2 [9]. The main idea is to use the formula transformer ∆ [17,4], which takes a (possibly open) formula ϕ and domain restriction δ, and produces a new formula ϕ .…”

Section: Partialitymentioning

confidence: 99%

See 2 more Smart Citations

Checking Well-Formedness of Pure-Method Specifications

Rudich

Darvas

Müller

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Contract languages such as JML and Spec# specify invariants and pre-and postconditions using side-effect free expressions of the programming language, in particular, pure methods. For such contracts to be meaningful, they must be well-formed: First, they must respect the partiality of operations, for instance, the preconditions of pure methods used in the contract. Second, they must enable a consistent encoding of pure methods in a program logic, which requires that their specifications are satisfiable and that recursive specifications are well-founded. This paper presents a technique to check well-formedness of contracts. We give proof obligations that are sufficient to guarantee the existence of a model for the specification of pure methods. We improve over earlier work by providing a systematic solution including a soundness result and by supporting more forms of recursive specifications. Our technique has been implemented in the Spec# programming system.

show abstract

“…Next, we need to show proof obligation (5). For brevity, we only show it for the second postcondition, which is the interesting case containing recursion:…”

Section: Proof Obligationsmentioning

confidence: 99%

Section: Structures and Interpretationsmentioning

confidence: 99%

Section: Partialitymentioning

confidence: 99%

See 1 more Smart Citation

Checking Well-Formedness of Pure-Method Specifications

Rudich

Darvas

Müller

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The procedure is complete [8,9], that is, the well-definedness condition generated from a formula is provable if and only if the formula is welldefined. Procedure D would generate the following condition for (1) As expected, the condition is provable.…”

Section: Introductionmentioning

confidence: 99%

“…The literature [8,27,3,9] proposes the procedure D to generate well-definedness conditions. The procedure is complete [8,9], that is, the well-definedness condition generated from a formula is provable if and only if the formula is welldefined.…”

Section: Introductionmentioning

confidence: 99%

Efficient Well-Definedness Checking

Darvas

Mehta

Rudich

Automated Reasoning

View full text Add to dashboard Cite

Abstract. Formal specifications often contain partial functions that may lead to ill-defined terms. A common technique to eliminate illdefined terms is to require well-definedness conditions to be proven. The main advantage of this technique is that it allows us to reason in a twovalued logic even if the underlying specification language has a threevalued semantics. Current approaches generate well-definedness conditions that grow exponentially with respect to the input formula. As a result, many tools prove shorter, but stronger approximations of these well-definedness conditions instead. We present a procedure which generates well-definedness conditions that grow linearly with respect to the input formula. The procedure has been implemented in the Spec# verification tool. We also present empirical results that demonstrate the improvements made.

show abstract

Fast and Effective Well-Definedness Checking

Leuschel

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A Practical Approach to Partial Functions in CVC Lite

Cited by 18 publications

References 4 publications

Checking Well-Formedness of Pure-Method Specifications

Checking Well-Formedness of Pure-Method Specifications

Efficient Well-Definedness Checking

Fast and Effective Well-Definedness Checking

Contact Info

Product

Resources

About