By Harald König, Michael Löwe (auth.), Adenilso Simao, Carroll Morgan (eds.)

ISBN-10: 3642250319

ISBN-13: 9783642250316

This booklet constitutes the completely refereed post-conference complaints of the 14th Brazilian Symposium on Formal tools, SBMF 2011, held in Sao Paulo, Brazil, in September 2011; co-located with CBSoft 2011, the second one Brazilian convention on software program: conception and perform. The thirteen revised complete papers have been rigorously reviewed and chosen from 37 submissions. The papers offered conceal a wide variety of foundational and methodological concerns in formal equipment for the layout and research of software program and structures in addition to functions in a number of domains.

Show description

Read Online or Download Formal Methods, Foundations and Applications: 14th Brazilian Symposium, SBMF 2011, São Paulo, Brazil, September 26-30, 2011, Revised Selected Papers PDF

Best nonfiction_5 books

Download e-book for iPad: Nancy Wake Biography by Peter Fitzsimons

Appalled through what she'd obvious of the Nazis in Berlin and Vienna, Nancy joined a resistance staff in Marseilles supporting to smuggle out escaped British prisoners. through 1943, Nancy had turn into the number 1 goal at the Gestapo's so much sought after record, and there has been a 5 million-franc fee on her head.

Extra info for Formal Methods, Foundations and Applications: 14th Brazilian Symposium, SBMF 2011, São Paulo, Brazil, September 26-30, 2011, Revised Selected Papers

Example text

5 Verification of SPARKSkein We have verified SPARKSkein in various ways: using the SPARK static verification tools, testing using the published reference test vectors, structural coverage analysis, 20 R. Chapman, E. Botcazou, and A. Wallenburg testing for portability on as many differing machines that we could lay our hands on, and performance testing. These sections summarize the results of these activities. 1 Static Verification and Proof The SPARKSkein code passes all the analyses and verification implemented by the Examiner with no errors.

However, they do not consider inheritance, 30 Y. Welsch and A. Poetzsch-Heffter down-casting and cross-border instantiation. Using similar techniques, Ábrahám et al. [2] give a fully abstract semantics for a concurrent class-based language (without inheritance and subtyping). Whereas we use simulation techniques to prove full abstraction, other authors apply (bi-)simulations to relate two program parts. This technique was first used by Hennessy and Milner [7] to reason about concurrent programs.

C) = T α ). Object main() { nde } } Using this definition of most general context, we can give the denotation of a component X as the set of traces generated by the most general context of X . Note that this definition solely depends on X . Definition 4 (Denotation of a component). The denotation of a component X is defined as Traces(κX X ). 3 Full Abstractness The standard notion of testing or contextual compatibility [12] states that every program context which terminates with the first component must also terminate with the second component.

Download PDF sample

Formal Methods, Foundations and Applications: 14th Brazilian Symposium, SBMF 2011, São Paulo, Brazil, September 26-30, 2011, Revised Selected Papers by Harald König, Michael Löwe (auth.), Adenilso Simao, Carroll Morgan (eds.)


by Edward
4.1

Rated 4.26 of 5 – based on 27 votes