The proceedings contain 9 papers. The topics discussed include: complete coinductive subtyping for abstract compilation of object-oriented languages;towards a semantic model for java wildcards;strong exception-safety ...
ISBN:
(纸本)9781450305402
The proceedings contain 9 papers. The topics discussed include: complete coinductive subtyping for abstract compilation of object-oriented languages;towards a semantic model for java wildcards;strong exception-safety for java-like languages;modular verification of linked lists with views via separation logic;procedure-modular verification of control flow safety properties;prototyping a tool environment for run-time assertion checking in JML with communication histories;aliasing control with view-based typestate;refactoring and representation independence for class hierarchies;and a theory of typestate-oriented programming.
In object Oriented systems, the design phase can be modeled using the three diagrams: Sequence diagram (which depicts responses of all objects that are involved in a single use case), Class Diagram (which is used to d...
详细信息
ISBN:
(纸本)9781450305327
In object Oriented systems, the design phase can be modeled using the three diagrams: Sequence diagram (which depicts responses of all objects that are involved in a single use case), Class Diagram (which is used to depict the structural aspect of design) and State chart diagram (which is used to depicts the states and state dependent behavior for objects). In this paper, we have proposed a framework for verification of these diagrams, which includes syntactic correctness and inter-diagram consistency. This is done by proposing Context Free Grammar for the three diagrams. The proposed grammar is validated by using Lex and Yacc and parse tree is generated which is an alternate form of the grammar. This framework, being built based on a formal approach, would enable us to automate the process of correctness and consistency verification among the diagrams used in design phase. This would also help us in ensuring requirement traceability on the long run. Copyright 2010 acm.
This paper proposes a new programming language EventCJ. Its design stems from our observation that, in many context-aware applications, context changes are triggered by external events. Thus, in addition to the curren...
详细信息
Tracking the state of an object (in the sense of how a File can be in an Open or Closed state) is difficult not just because of the problem of managing state transitions but also due to the complexity introduced by al...
详细信息
GUI frameworks, like Swing, are typically not thread-safe. Desktop applications are thus often written in a purely single-threaded, event-based style. Introducing threads into such applications is not an easy task as ...
详细信息
Improving the quality of software developed in the 21st century is one of the major challenges in the software industry. Addressing this problem will require that academic institutions play a key role in training deve...
详细信息
In previous work we described a modular static analysis based on access permission annotations, which describe the ways in which a reference can be aliased, for preventing the improper use of object protocols in concu...
详细信息
ISBN:
(纸本)9781605587660
In previous work we described a modular static analysis based on access permission annotations, which describe the ways in which a reference can be aliased, for preventing the improper use of object protocols in concurrent programs. That system was based on atomic blocks, a mutual exclusion primitive not yet in wide use. Now we extend that system to programs written using synchronized blocks, which are in wide use today. This system can verify concurrent programs without any concurrency-specific annotations.
The proceedings contain 10 papers. The topics discussed include: cleaning up Erlang code is a dirty job but somebodys gotta do it;automated module interface upgrade;automatic assessment of failure recovery in Erlang a...
ISBN:
(纸本)9781605585079
The proceedings contain 10 papers. The topics discussed include: cleaning up Erlang code is a dirty job but somebodys gotta do it;automated module interface upgrade;automatic assessment of failure recovery in Erlang applications;teaching Erlang using robotics and player/stage;development of a distributed system applied to teaching and learning;ECT: an object-oriented extension to Erlang;implementing an LTL-to-Büchi translator in Erlang;model based testing of data constraints: testing the business logic of a Mnesia application with Quviq QuickCheck;automatic testing of TCP/IP implementations using Quickcheck;and recent improvements to the McErlang model checker.
Higher-order functions are essential for generic programming. While they are naturally supported in functional programming languages, there are no higher-order functions in C++. There, various function datatypes exist...
详细信息
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensitive, context-sensitive, and object-sensi...
详细信息
ISBN:
(纸本)9781605586458
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensitive, context-sensitive, and object-sensitive;thus offering more precision than traditional approaches. While the method has been implemented and successfully applied to realistic Java programs, only a manual proof of a fundamental correctness property was available so far. The new proof is based on a new correctness proof for intraprocedural PDGs and program slices. Both proofs are formalized in Isabelle/HOL. They rely on abstract structures and properties instead of concrete syntax and definitions. Carrying the correctness proof over to any given language or dependence definition reduces to just showing that it fulfills the necessary preconditions, thus eliminating the need to develop another full proof. We instantiate the framework with both a simple while language and Java bytecode, as well as with three different control dependence definitions. Thus we obtain 6 IFC correctness proofs for the price of 11 2 . Copyright c 2009 acm.
暂无评论