Building Certified Libraries for PCC: Dynamic Storage Allocation

Yu, Dejian; Hamid, Nadeem Abdul; Shao, Zhong

doi:10.1007/3-540-36575-3_25

Cited by 30 publications

(29 citation statements)

References 22 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If a thread is joined by another one, the scheduler will free its TCB. The definition of free block-list GoodL follows the work by Yu et al [25] and Xiang et al [23], and it can be ported to our framework directly.…”

Section: Certification Of Ctlmentioning

confidence: 98%

A Certified Thread Library for Multithreaded User Programs

Guo

Jiang

Chen

et al. 2007

First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)

View full text Add to dashboard Cite

Ensuring the safety of multithreaded software is a task both important and challenging. Currently, most approaches focus on the safety of multithreaded programs rather than the runtime based on which those concurrent programs run. In order to fundamentally solve this problem, a method of ensuring the safety of the runtime should be developed. Such a runtime could be organized as a thread library typically.This paper presents the development and certification of a simple but realistic thread library. The thread library provides common multi-threading features such as dynamic thread creation, termination and joining as well. This library also carries machine-checkable proof which guarantees the library does not violate the safety policies. This paper also presents an approach to link the library to existing certified multithreaded user programs to form an integrated foundational proof-carrying code (FPCC) package. Comparing with the uncertified libraries, our work makes multithreaded applications much more reliable.

show abstract

Section: Certification Of Ctlmentioning

confidence: 98%

A Certified Thread Library for Multithreaded User Programs

Guo

Jiang

Chen

et al. 2007

First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)

View full text Add to dashboard Cite

show abstract

“…Our program logic is an adapted CAP [9]. CAP uses a syntactic inference rule like traditional typing rules in type systems, can be seen as a logical counterpart to TAL.…”

Section: Other Workmentioning

confidence: 99%

“…Here we adopt the verification framework of certified programming language(CAP) [9] as our programming and reasoning model. CAP is a Hoare style verification framework for assembly code.…”

Section: E the Program Logicmentioning

confidence: 99%

The Logical Approach to Low-Level Stack Reasoning

Jiang

Guo

Chen

2009

2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering

View full text Add to dashboard Cite

Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to very complex specifications and make proof construction more difficult. In this paper, we develop a new logic system based on the idea of memory adjacency from previous work on stack typing. It is a variant of bunched logic and it can be easily integrated into separation logic to reason about the interaction between stacks and heaps. Our logic is especially convenient for reasoning about stack operations, and it greatly simplifies both the specification and the proof of properties about stack-allocated data.

show abstract

“…One pioneering work in the area is the PCC by Necula and Lee [2]. Other contributions include TAL [3,4], Jflow [5], CAP [6], BML [7], MCC [8], etc. Our work in the paper is inspired from the verifying/certifying compiler framework.…”

Section: Introductionmentioning

confidence: 99%

A verifiable low-level concurrent programming model based on colored Petri nets

Wang

Dong

2011

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Concurrent programs written in a machine-level language are being used in many areas, but the verification of such programs brings various new challenges to the programming language community. Most of existing contributions on verifying the safety properties of concurrent programs are for high-level languages, specifications, or calculi in the literature. Due to the lack of abstraction at a low level, additional work is needed to extend these methods to machine-level language. This paper describes an approach to integrate Petri nets into low-level concurrent programs to form a new programming model (abstract machine). A program in the programming model is a restricted version of colored Petri net, with transitions colored by assembly codes for machine-level threads, and places colored by shared data consisting of memory locations or registers. Existing analysis and verification approaches for usual Petri nets can be applied indirectly for such a low-level concurrent program.

show abstract

Building Certified Libraries for PCC: Dynamic Storage Allocation

Cited by 30 publications

References 22 publications

A Certified Thread Library for Multithreaded User Programs

A Certified Thread Library for Multithreaded User Programs

The Logical Approach to Low-Level Stack Reasoning

A verifiable low-level concurrent programming model based on colored Petri nets

Contact Info

Product

Resources

About