Conventional and uniqueness typing in graph rewrite systems

Barendsen, Erik; Smetsers, Sjaak

doi:10.1007/3-540-57529-4_42

Cited by 56 publications

(82 citation statements)

References 6 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PacLang [Ennals et al 2004] uses linear types to guide optimisation of packet processing on network processors. Similar substructural type systems, namely uniqueness types, have been integrated into the functional language Clean [Barendsen and Smetsers 1993]. However, the intent is only to provide an abstraction over effects, and thus Clean still depends on run-time garbage collection.…”

Section: Related Workmentioning

confidence: 99%

Refinement through restraint: bringing down the cost of verification

O'ConnorLiam¹,

ChenZilin²,

RizkallahChristine³

et al. 2016

SIGPLAN Not.

View full text Add to dashboard Cite

We present a framework aimed at significantly reducing the cost of verifying certain classes of systems software, such as file systems. Our framework allows for equational reasoning about systems code written in our new language, Cogent. Cogent is a restricted, polymorphic, higher-order, and purely functional language with linear types and without the need for a trusted runtime or garbage collector. Linear types allow us to assign two semantics to the language: one imperative, suitable for efficient C code generation; and one functional, suitable for equational reasoning and verification. As Cogent is a restricted language, it is designed to easily interoperate with existing C functions and to connect to existing C verification frameworks.Our framework is based on certifying compilation: For a welltyped Cogent program, our compiler produces C code, a high-level shallow embedding of its semantics in Isabelle/HOL, and a proof that the C code correctly refines this embedding. Thus one can reason about the full semantics of real-world systems code productively and equationally, while retaining the interoperability and leanness of C. The compiler certificate is a series of language-level proofs and per-program translation validation phases, combined into one coherent top-level theorem in Isabelle/HOL.

show abstract

Section: Related Workmentioning

confidence: 99%

Refinement through restraint: bringing down the cost of verification

O'ConnorLiam¹,

ChenZilin²,

RizkallahChristine³

et al. 2016

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…T he ty p e system we p resent in this p a p er is based on th a t of th e program m ing language Clean [1,2]. However, C lean 's ty p e system has a num ber of draw backs.…”

Section: O N Trib U Tio N S O F T H Is P a P Ermentioning

confidence: 99%

Uniqueness Typing Redefined

Vries

Plasmeijer

Abrahamson

2007

Implementation and Application of Functional Languages

View full text Add to dashboard Cite

“…Each role declaration provides complete aliasing information for each object that plays that role-in addition to specifying roles for the fields of the object, the role declaration also identifies the complete set of references in the heap that refer to the object. In this way roles generalize linear type systems [199,29,136] by allowing multiple aliases to be statically tracked, and extend alias types [183,200] with the ability to specify roles of objects that are the source of aliases.…”

Section: Chapter 6 Role Analysismentioning

confidence: 99%

Component Composition for Embedded Systems Using Semantic Aspect-Oriented Programming

Rinard¹

2004

View full text Add to dashboard Cite

The public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Department of Defense, Washington Headquarters Services, Directorate for Information SPONSORING/MONITORING AGENCY REPORT NUMBER(S) AFRL-IF-WP-TR-2004-1568 DISTRIBUTION/AVAILABILITY STATEMENTApproved for public release; distribution is unlimited. SUPPLEMENTARY NOTES ABSTRACTThe goal of our research was to develop technologies and techniques in support of real-time systems for the defense community. Our research focused on Real-Time Java implementation and analysis techniques. Real-Time Java is important for the defense community because it holds out the promise of enabling developers to apply COTS Java technology to specialized military embedded systems. It also promises to allow the defense community to utilize a large Java-literate workforce for building defense systems.Our research has delivered several techniques that may make Real-Time Java a better platform for developing embedded systems. These techniques include ways to implement scoped memories (a key Real-Time Java construct) without the possibility of introducing unexpected and potentially catastrophic delays in the execution of real-time threads, analyses that ensure the correct use of Real-Time Java scoped memories, analyses that compute how much memory is required to execute a given Real-Time Java program (potentially helping developers calculate how much memory must be including in a given system to ensure that the system will execute without running out of memory), and optimizations that reduce the amount of memory required to execute a Real-Time Java program.

show abstract

Conventional and uniqueness typing in graph rewrite systems

Cited by 56 publications

References 6 publications

Refinement through restraint: bringing down the cost of verification

Refinement through restraint: bringing down the cost of verification

Uniqueness Typing Redefined

Component Composition for Embedded Systems Using Semantic Aspect-Oriented Programming

Contact Info

Product

Resources

About