Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Based on Sperner's lemma the fixed point theorem of Brouwer is proved. Rather than presenting also other beautiful proofs of Brouwer's fixed point theorem, many nice applications are given in some detail. Also Schauder's fixed point theorem is presented which can be viewed as a natural generalization of Brouwer's fixed point theorem to an infinite-dimensional setting. Finally, Tarski's fixed point theorem is applied to differential equations in Banach spaces.

Fixpunkt, Anwendungen, Banachräume, Brouwer, SchauderFixed points, verification methods, Banach spaces

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Developing countries interested in REDD+ under the UNFCCC have been requested to prepare a national forest monitoring system (NFMS) and a system to monitor, report and verify implementation (MRV). They have also been requested to engage local communities and indigenous groups as critical stakeholders in this process. The NFMS should be consistent with national inventories of emissions and removals of greenhouse gases. These inventories are, however, usually prepared using national level information with low geographical resolution and without the participation of local communities or other forest owners/managers. However, it has been shown that members of rural forest communities can develop the skills to monitor and measure levels of carbon stock in their forests and changes in these levels over time. If this information could be included and tracked from the local to regional and national levels, this might help to design transparent mechanisms for the assessment of REDD+ implementation, and possibly even for benefit sharing. The objective of this Special Issue is to discuss and explore the social, technical and political implications and potential of including community-based monitoring in MRV systems and benefit-sharing schemes in REDD+.

community based monitoring, benefit sharing, REDD+, monitoring, reporting and verification, results-based financing, forest inventories

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This work presents a flexible methodology for formally specifying and deductively verifying object-oriented components.It is based on a simple notion of program correctness. Correctness can be achieved with a novel system of proof obligations, which serve as input to a suitable theorem prover.

formal specification, deductive verification, object-orientation, components, encapsulation, context specification, proof obligations, modular proofs

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Software systems play a central role in modern society, and their correctness is often crucially important. Formal specification and verification are promising approaches for ensuring correctness more rigorously than just by testing. This work presents an approach for deductively verifying design-by-contract specifications of object-oriented programs. The approach is based on dynamic logic, and addresses the challenges of modularity and automation using dynamic frames and predicate abstraction.

software specification, software verification, design by contract, theorem proving, abstract interpretation

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the proceedings of the 27th European Symposium on Programming, ESOP 2018, which took place in Thessaloniki, Greece in April 2018, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018.The 36 papers presented in this volume were carefully reviewed and selected from 114 submissions. The papers are organized in topical sections named: language design; probabilistic programming; types and effects; concurrency; security; program verification; program analysis and automated verification; session types and concurrency; concurrency and distribution; and compiler verification.

artificial intelligence --- computer architecture --- computer software selection and evaluation --- distributed computer systems --- formal logic --- formal model --- java --- model checking --- processors --- program compilers --- program verification --- programming language --- semantics --- separation logic --- software engineering specifications --- theorem proving --- type --- systems verification