Using data groups to specify and check side effects

Leino, K. Rustan M.; Poetzsch-Heffter, Arnd; Zhou, Yunhong

doi:10.1145/512557.512559

Cited by 22 publications

(31 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we note that ownership-based type systems have also been used for pre-venting data races [46] and deadlocks [43], for supporting modular software upgrades in persistent object stores [45], for modular specification of effects clauses in the presence of subtyping [44,46] (so they can be used as an alternative to data groups [144]), and for program understanding [13]. We are currently unifying the type system presented in this chapter with the above type systems [41].…”

Section: Resultsmentioning

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

Section: Resultsmentioning

confidence: 99%

Component Composition for Embedded Systems Using Semantic Aspect-Oriented Programming

Rinard¹

2004

View full text Add to dashboard Cite

show abstract

“…1 can modify Current.active but not Current.target). This construct enables fine-grained, yet abstract, frame specifications, in a way similar to data groups [LPZ02].…”

Section: Framingmentioning

confidence: 99%

A fully verified container library

Polikarpova¹,

Tschannen

Furia

2018

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. The comprehensive functionality and nontrivial design of realistic general-purpose container libraries pose challenges to formal verification that go beyond those of individual benchmark problems mainly targeted by the state of the art. We present our experience verifying the full functional correctness of EiffelBase2: a container library offering all the features customary in modern language frameworks, such as external iterators, and hash tables with generic mutable keys and load balancing. Verification uses the automated deductive verifier AutoProof, which we extended as part of the present work. Our results indicate that verification of a realistic container library (135 public methods, 8400 LOC) is possible with moderate annotation overhead (1.4 lines of specification per LOC) and good performance (0.2 s per method on average).

show abstract

“…In case x is null, this is well defined and designates the empty set of locations. We also allow f to be a data group [26], e.g., the built-in data group "any" that stands for all fields of an object.…”

Section: Effect Specifications and The Framing Of Commands And Formulasmentioning

confidence: 99%

Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions

Naumann

Banerjee

2010

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. The mismatch is sound if the invariants depend only on encapsulated state, but encapsulation is problematic in contemporary software due to the many uses of shared mutable objects. The mismatch is formalized here in a proof rule that achieves flexibility via explicit restrictions on client effects, expressed using ghost state and ordinary first order assertions.

show abstract

Using data groups to specify and check side effects

Cited by 22 publications

References 0 publications

Component Composition for Embedded Systems Using Semantic Aspect-Oriented Programming

Component Composition for Embedded Systems Using Semantic Aspect-Oriented Programming

A fully verified container library

Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions

Contact Info

Product

Resources

About