Verification conditions for source-level imperative programs

Frade, Maria João; Pinto, Jorge Sousa

doi:10.1016/j.cosrev.2011.02.002

Cited by 21 publications

(17 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, strictly speaking our logic is incomparable to the above logics. We show that relations are used even in programs like reverse to write procedure summaries such as the one in (8) and for expressing numeric orders in sorting programs.…”

Section: Related Workmentioning

confidence: 99%

“…These rules are standard and their soundness and relative completeness have been discussed elsewhere (e.g. see [8]). …”

Section: Weakest Preconditions Of Atomic Heap Manipulating Statementsmentioning

confidence: 99%

“…Given a program annotated with loop invariants and procedure specifications, it is possible to automatically generate VCs to check that the invariants are satisfied by all program executions (e.g., see [8]). For example, the VC of reverse asserts that every execution which starts in a state satisfying I 0 satisfies I 3 and that I 3 is indeed inductive.…”

Section: Generating Ae R Verification Conditionsmentioning

confidence: 99%

See 2 more Smart Citations

Effectively-Propositional Reasoning about Reachability in Linked Data Structures

Itzhaky

Banerjee

Immerman

et al. 2013

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. This paper proposes a novel method of harnessing existing SAT solvers to verify reachability properties of programs that manipulate linked-list data structures. Such properties are essential for proving program termination, correctness of data structure invariants, and other safety properties. Our solution is complete, i.e., a SAT solver produces a counterexample whenever a program does not satisfy its specification. This result is surprising since even first-order theorem provers usually cannot deal with reachability in a complete way, because doing so requires reasoning about transitive closure. Our result is based on the following ideas: (1) Programmers must write assertions in a restricted logic without quantifier alternation or function symbols. (2) The correctness of many programs can be expressed in such restricted logics, although we explain the tradeoffs. (3) Recent results in descriptive complexity can be utilized to show that every program that manipulates potentially cyclic, singly-and doubly-linked lists and that is annotated with assertions written in this restricted logic, can be verified with a SAT solver. We implemented a tool atop Z3 and used it to show the correctness of several linked list programs.

show abstract

Section: Related Workmentioning

confidence: 99%

“…These rules are standard and their soundness and relative completeness have been discussed elsewhere (e.g. see [8]). …”

Section: Weakest Preconditions Of Atomic Heap Manipulating Statementsmentioning

confidence: 99%

Section: Generating Ae R Verification Conditionsmentioning

confidence: 99%

See 1 more Smart Citation

Effectively-Propositional Reasoning about Reachability in Linked Data Structures

Itzhaky

Banerjee

Immerman

et al. 2013

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…A Hoare triple (1) consists of two assertions, the precondition P and the postcondition Q, and a program S. Hoare logic states that: If the execution starts in a state where the precondition P is met, at the end of the program execution the postcondition is realized [23]. Consider the simple Hoare triple below (2) where the precondition x = y is true before the execution of the program.…”

Section: Theory Of Precondition Inferencementioning

confidence: 99%

Ahead of time static analysis for automatic generation of debugging interfaces to the Linux kernel

et al. 2014

View full text Add to dashboard Cite

The Linux kernel does not export a stable, well-defined kernel interface, complicating the development of kernel-level services, such as device drivers and file systems. While there does exist a set of functions that are exported to external modules, this set of functions frequently changes, and the functions have implicit, ill-documented preconditions. No specific debugging support is provided.We present Diagnosys, an approach to automatically constructing a debugging interface for the Linux kernel. First, a designated kernel maintainer uses Diagnosys to identify constraints on the use of the exported functions. Based on this information, developers of kernel services can then use Diagnosys to generate a debugging interface specialized to their code. When a service including this interface is tested, it records information about potential problems. This information is preserved following a kernel crash or hang. Our experiments show that the generated debugging interface provides useful log information and incurs a low performance penalty.

show abstract

“…The difference between SMT and SAT is that SMT solvers check the satisfiability of first-order formulas containing operations from several theories, such as Bit-vector and arithmetic, whereas SAT solvers check the satisfiability of propositional formulas [26]. SMT-Lib provides a common input platform and benchmarking framework that helps in the evaluation of the systems [27].…”

Section: Smt-lib and Z3 Solvermentioning

confidence: 99%

Modeling and Analysis of State-of-the-art VM-based Cloud Management Platforms

Malik

Khan

Srinivasan

2013

IEEE Trans. Cloud Comput.

View full text Add to dashboard Cite

Abstract-Virtualization is one of the key aspects used in cloud computing environment to achieve scalability and flexibility. To cope with the large number of virtual machines (VM) involved in the cloud, several solutions have been proposed to automatically monitor and deploy VM in resource pools. Most of the cloud management system, such as Amazon EC2, are proprietary and are not generally available for research. In the said perspective, many open source VM-based cloud platforms launched for general users to research. The existing work performed in VM-based cloud management platforms have mainly focused on the discussion of architecture, feature set, and performance analysis. However, other important aspects, such as formal analysis, modeling, and verification are usually ignored. In this paper, we provide a formal analysis, modeling, and verification of three open source state-of-the-art VM-based cloud management platforms: 1) Eucalyptus, 2) Open Nebula, and 3) Nimbus. We have used high-level Petri nets (HLPN) to model and analyze the structural and behavioral properties of the systems. Moreover, to verify the models, we have used Satisfiability Modulo Theories Library (SMT-Lib) and Z3 Solver. We modeled about 100 VM to verify the correctness and feasibility of our models. The results reveal that the models are functioning correctly. Moreover, the increase in the number of VM does not affect the working of the models that indicates the practicability of the models in a highly scalable and flexible environment.

show abstract

Verification conditions for source-level imperative programs

Cited by 21 publications

References 53 publications

Effectively-Propositional Reasoning about Reachability in Linked Data Structures

Effectively-Propositional Reasoning about Reachability in Linked Data Structures

Ahead of time static analysis for automatic generation of debugging interfaces to the Linux kernel

Modeling and Analysis of State-of-the-art VM-based Cloud Management Platforms

Contact Info

Product

Resources

About