Refining SCJ Mission Specifications into Parallel Handler Designs
نویسندگان
چکیده
منابع مشابه
Refining SCJ Mission Specifications into Parallel Handler Designs
Safety-Critical Java (SCJ) is a recent technology that restricts the execution and memory model of Java in such a way that applications can be statically analysed and certified for their real-time properties and safe use of memory. Our interest is in the development of comprehensive and sound techniques for the formal specification, refinement, design, and implementation of SCJ programs, using ...
متن کاملTowards Refining Temporal Specifications into Hybrid Systems
a self-loop at an enclosing box is interpreted as if there is a similar self-loop at each of the four internal locations. Acknowledgements. We gratefully acknowledge the help of Luca de Alfaro, Eddie Chang, Arjun Kapur, and Henny Sipma for their careful reading of the manuscript and thank them for many helpful suggestions. 15 and, consequently, the valve variables v i and v o all remain at 0, l...
متن کاملRefining Interval Temporal Logic Specifications
Interval Temporal Logic (ITL) was designed as a tool for the specification and verification of systems. The development of an executable subset of ITL, namely Tempura, was an important step in the use of temporal logic as it enables the developer to check, debug and simulate the design. However, a design methodology is missing that transforms an abstract ITL specification to an executable (conc...
متن کاملAuthentication Primitives for Refining Protocol Specifications Authentication Primitives for Refining Protocol Specifications *
We propose a way to abstract from various specifications of authentication and to obtain idealized protocols “secure by construction”. This feature enables us to prove that a cryptographic protocol is the correct implementation of the corresponding abstract protocol. Our proposal relies on the combination of two authentication primitives, proposed by the authors in [20, 18] to a simplified vers...
متن کاملAutomatically Refining Partial Specifications for Program Verification
Automatically verifying heap-manipulating programs is a challenging task, especially when dealing with complex data structures with strong invariants, such as sorted lists and AVL/red-black trees. The verification process can greatly benefit from human assistance through specification annotations, but this process requires intellectual effort from users and is error-prone. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.115.4