Page 1
Page 1
XcalableMP PGAS Programming Language : From Programming Model to Applications
XcalableMP is a directive-based parallel programming language based on Fortran and C, supporting a Partitioned Global Address Space (PGAS) model for distributed memory parallel systems. This open access book presents XcalableMP language from its programming model and basic concept to the experience and performance of applications described in XcalableMP.
Web Programming and Internet Technologies : An E-Commerce Approach ; 2nd ed.
Features a hands-on and active learning approach. Written for the one-term web programming course for first or second year students, the. Introduces students to the fundamental techniques of web programming through the continual development of a real-world business example. Students learn the basics of HTML5, CSS3, JavaScript, PHP, and MySQL and apply their knowledge to construct their own fully functional e-commerce site.
Verified Software: Theories, Tools, Experiments ; 2nd International Conference, VSTTE 2008, Toronto, Canada, October 6-9, 2008. Proceedings
The scope of book includes the sharing and interoperability of tools, the alignment of theory and practice, the identification of challenge problems, the construction of benchmark suites, and the execution of large-scale experiments.
Verified Software: Theories, Tools, Experiments ; 1st IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions
The book includes a general introduction to the area, which also presents the vision of a grand challenge project: the "verifying compiler". Most contributions are followed by a transcription of the vivid discussion that ensued between the author and the audience. The papers have been organized in topical sections on verification tools, guaranteeing correctness, software engineering aspects, verifying object-oriented programming, programming language and methodology aspects, components, static analysis, design, analysis and tools, as well as formal techniques.
Verification of Object-Oriented Software : The KeY Approach
Features of the programming languages we employ in these programs are plentiful, including object-oriented organizations of data, facilities for specifying di?erent c- trol ?ow for rare situations, constructs for iterating over the elements of a collection, and the grouping together of operations into atomic transactions. These language features were designed to facilitate simpler and more natural encodings of programs, and ideally they are accompanied by simpler proof rules. But the variety and increased number of these features make it harder to remember all that needs to be proved about their uses. As a third problem, we have come to expect a higher degree of rigor from our proofs. A proof carried out or replayed by a machine somehow gets more credibility than one that requires human intellect to understand.
Value-Range Analysis of C Programs : Towards Proving the Absence of Buffer Overflow Vulnerabilities
The use of static analysis techniques to prove the partial correctness of C code has recently attracted much attention due to the high cost of software errors - particularly with respect to security vulnerabilities. However, research into new analysis techniques is often hampered by the technical difficulties of analysing accesses through pointers, pointer arithmetic, coercion between types, integer wrap-around and other low-level behaviour. Axel Simon provides a concise, yet formal description of a value-range analysis that soundly approximates the semantics of C programs using systems of linear inequalities (polyhedra). The analysis is formally specified down to the bit-level while providing a precise approximation of all low-level aspects of C using polyhedral operations and, as such, it provides a basis for implementing new analyses that are aimed at verifying higher-level program properties precisely. One example of such an analysis is the tracking of the NUL position in C string buffers, which is shown as an extension to the basic analysis and which thereby demonstrates the modularity of the approach.
Understanding Programming Languages
This book is about describing the meaning of programming languages. While a compiler or an interpreter offers a form of formal description of a language, it is not something that can be used as a basis for reasoning about that language nor can it serve as a definition of a programming language itself since this must allow a range of implementations. By writing a formal semantics of a language a designer can yield a far shorter description and tease out, analyse and record design choices.Early in the book the author introduces a simple notation, a meta-language, used to record descriptions of the semantics of languages. In a practical approach, he considers dozens of issues that arise in current programming languages and the key techniques that must be mastered in order to write the required formal semantic descriptions. The book concludes with a discussion of the eight key challenges: delimiting a language (concrete representation), delimiting the abstract content of a language, recording semantics (deterministic languages), operational semantics (non-determinism), context dependency, modelling sharing, modelling concurrency, and modelling exits.
Unconventional Programming Paradigms ; International Workshop UPP 2004, Le Mont Saint Michel, France, September 15-17, 2004, Revised Selected and Invited Papers
Nowadays, developers have to face the proliferation of hardware and software environments, the increasing demands of the users, the growing number of p- grams and the sharing of information, competences and services thanks to the generalization ofdatabasesandcommunication networks. Aprogramisnomore a monolithic entity conceived, produced and?nalized before being used. A p- gram is now seen as an open and adaptive frame, which, for example, can - namically incorporate services not foreseen by the initial designer. These new needs call for new control structures and program interactions. Unconventionalapproachestoprogramminghavelongbeendevelopedinv-iousnichesandconstituteareservoirofalternativewaystofacetheprogramming languages crisis.
Types for Proofs and Programs ; International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers
Cover all current issues of formal reasoning and computer programming based on type theory are addressed; in particular languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education.
Types for Proofs and Programs ; International Conference, TYPES 2007, Cividale des Friuli, Italy, May 2-5, 2007 Revised Selected Papers
The topic of this book was formal reasoning and computer programming based on type theory. Great importance was attached to languages and computerized tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalization of mathematics and mathematics
Trustworthy Global Computing ; 3rd Symposium, TGC 2007, Sophia-Antipolis, France, November 5-6, 2007, Revised Selected Papers
Provides tools and frameworks for constructing well-behaved applications and for reasoning about their behavior and properties in models of computation that incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. The volume concludes with 3 tutorial papers, presented at the co-located Workshop on the Interplay of Programming Languages and Cryptography.
Tools and Algorithms for the Construction and Analysis of Systems ; 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part II
This is Part II: concurrent and distributed systems; monitoring and runtime verification; hybrid and stochastic systems; synthesis; symbolic verification; and safety and fault-tolerant systems.
Tools and Algorithms for the Construction and Analysis of Systems ; 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part I
This is Part I: SAT and SMT, SAT solving and theorem proving; verification and analysis; model checking; tool demo; and machine learning.
Tools and Algorithms for the Construction and Analysis of Systems ; 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part III
This is Part II: contiants Tools and Algorithms for the Construction and Analysis of Systems
Tools and Algorithms for the Construction and Analysis of Systems ; 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II
The LNCS 10805 and 10806 proceedings set constitutes the proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The total of 43 full and 11 short papers presented in these volumes was carefully reviewed and selected from 154submissions. The papers are organized in topical sections as follows:Part I: theorem proving; SAT and SMT I; deductive verification; software verification and optimization; model checking; and machine learning.Part II: concurrent and distributed systems; SAT and SMT II; security and reactive systems; static and dynamic program analysis; hybrid and stochastic systems; temporal logic and mu-calculus; 7th Competition on Software Verification – SV-COMP.
Tools and algorithms for the construction and analysis of systems ; 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on theory and practice of software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part I
The LNCS 10805 and 10806 proceedings set constitutes the proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The total of 43 full and 11 short papers presented in these volumes was carefully reviewed and selected from 154submissions. The papers are organized in topical sections as follows:Part I: theorem proving; SAT and SMT I; deductive verification; software verification and optimization; model checking; and machine learning.Part II: concurrent and distributed systems; SAT and SMT II; security and reactive systems; static and dynamic program analysis; hybrid and stochastic systems; temporal logic and mu-calculus; 7th Competition on Software Verification – SV-COMP.
Theoretical Computer Science ; Vol. 3701 ; 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings
This book constitutes the refereed proceedings of the 9th International Conference on Theoretical Computer Science, ICTCS 2005, held at the Certosa di Pontignano, Siena, Italy, in October 2005. The 29 revised full papers presented together with an invited paper and abstracts of 2 invited talks were carefully reviewed and selected from 83 submissions. The papers address all current issues in theoretical computer science and focus especially on analysis and design of algorithms, computability, computational complexity, cryptography, formal languages and automata, foundations of programming languages and program analysis, natural computing paradigms (quantum computing, bioinformatics), program specification and verification, term rewriting, theory of logical design and layout, type theory, security, and symbolic and algebraic computation.
Theoretical Aspects of Computing - ICTAC 2008 ; 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings
The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing such as automata theory and formal languages, principles and semantics of programming languages, software architectures and their description languages, software specification, refinement, and verification, model checking and theorem proving, real-time, embedded and hybrid systems, theory of parallel, distributed, and internet-based (grid) computing, simulation and modeling, and service-oriented development.
Theoretical Aspects of Computing – ICTAC 2007 ; 4th International Colloquium, Macau, China, September 26-28, 2007, Proceedings
Constitutes the refereed proceedings of the 4th International Colloquium on Theoretical Aspects of Computing, ICTAC 2007 held in Macau, China in September 2007. The 29 revised full papers presented together with 3 invited talks and summaries of 2 tutorials were carefully reviewed and selected from 69 submissions. The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing such as automata theory and formal languages, principles and semantics of programming languages, software architectures and their description languages, software specification, refinement, and verification, model checking and theorem proving, real-time, embedded and hybrid systems, theory of parallel, distributed, and internet-based (grid) computing, simulation and modeling, and service-oriented development.
Theoretical Aspects of Computing - ICTAC 2004 ; 1st International Colloquium Guiyand, China, September 20-24, 2004, Revised Selected Papers
Constitutes the thoroughly refereed postproceedings of the First International Colloquium on Theoretical Aspects of Computing, ICTAC 2004. The 34 revised full papers presented together with 4 invited contributions were carefully selected from 111 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on concurrent and distributed systems, model integration and theory unification, program reasoning and testing, verification, theories of programming and programming languages, real-time and co-design, and automata theory and logics.
