Automated Technology for Verification and Analysis: 12th by Franck Cassez, Jean-François Raskin (eds.)

By Franck Cassez, Jean-François Raskin (eds.)

This publication constitutes the lawsuits of the twelfth foreign Symposium on computerized know-how for Verification and research, ATVA 2014, held in Sydney, Australia, in November 2014.

The 29 revised papers offered during this quantity have been conscientiously reviewed and chosen from seventy six submissions. They express present learn on theoretical and useful points of computerized research, verification and synthesis via delivering a world discussion board for interplay one of the researchers in academia and industry.

Show description

Read Online or Download Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings PDF

Best technology books

Fabricated: The New World of 3D Printing

Fabricated tells the tale of 3D printers, humble production machines which are bursting out of the manufacturing unit and into faculties, kitchens, hospitals, even onto the style catwalk. Fabricated describes our rising international of printable items, the place humans layout and 3D print their very own creations as simply as they edit an internet rfile.

Parametric Optimization: Singularities, Pathfollowing and Jumps

This quantity is meant for readers who, whether or not they be mathematicians, employees in different fields or scholars, are conversant in the fundamental methods and techniques of mathematical optimization. the subject material is worried with optimization difficulties within which a few or the entire person information concerned rely on one parameter.

Extra info for Automated Technology for Verification and Analysis: 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings

Example text

Experiences with implementing SMT-based bounded model checkers [3,7] have produced quite positive results, which justifies our choice of this class of solvers. SPARK-BMC employs a bit-vector rather than an unbounded integers theory, which has the advantage of capturing precisely the low-level fixed-width machine semantics of program data types. The SPARK programming language includes modular types, whose modular semantics are directly captured by fixed-size bitvectors. Signed integers are also conveniently encoded as bit-vectors.

Thus, the complexity for reachability in this case would be only NLogSpace in the number of states of the SQDS though PSpace in A and the bound on split-width. It would be PSpace in the size of the PDL and temporal logic formula for model-checking, matching the lower bounds for the case of words. The class of SQMSCs having split-width bounded via word-like split-terms subsume interesting classes, like existentially k-bounded MSCs since the decomposition given on page 8 yields word like split-terms.

SPARK is a programming language and toolset designed for the development of high-assurance software [4]. The language is based on a restricted subset of Ada (see [1] for a full description), complemented by an expressive system of contracts, to describe the specification and design of programs. The SPARK platform provides a set of tools that allow users to reason about the correctness of the source code, making possible the detection of problems early in the software lifecycle. The tools are based on deductive verification and as such give full guarantees, but they require the user to provide contracts and loop invariants, which are often difficult to write.

Download PDF sample

Rated 4.60 of 5 – based on 22 votes