DOCSLIB.ORG

A Rewriting Approach to Concurrent Programming Language Design and Semantics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Rewriting Approach to Concurrent Programming Language Design and Semantics PhD Thesis, University of Illinois, December 2010 A REWRITING APPROACH TO CONCURRENT PROGRAMMING LANGUAGE DESIGN AND SEMANTICS BY TRAIAN FLORIN SERBANUTA DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign, 2011 Urbana, Illinois Doctoral Committee: Associate Professor Grigore Ros, u, Chair and Director of Research Principal Researcher Thomas Ball, Microsoft Research Assistant Professor Darko Marinov Professor Jos´eMeseguer Assistant Professor Madhusudan Parthasarathy PhD Thesis, University of Illinois, December 2010 Abstract A plethora of programming languages have been and continue to be developed to keep pace with hardware advancements and the ever more demanding require- ments of software development. As these increasingly sophisticated languages need to be well understood by both programmers and implementors, precise specifications are increasingly required. Moreover, the safety and adequacy with respect to requirements of programs written in these languages needs to be tested, analyzed, and, if possible, proved. This dissertation proposes a rigorous approach to define programming languages based on rewriting, which allows to easily design and test language extensions, and to specify and analyze safety and adequacy of program executions. To this aim, this dissertation describes the K framework, an executable semantic framework inspired from rewriting logic but specialized and optimized for programming languages. The K framework consists of three components: (1) a language definitional technique; (2) a specialized notation; and (3) a resource- sharing concurrent rewriting semantics. The language definitional technique is a rewriting technique built upon the lessons learned from capturing and studying existing operational semantics frameworks within rewriting logic, and upon attempts to combine their strengths while avoiding their limitations. The specialized notation makes the technical details of the technique transparent to the language designer, and enhances modularity, by allowing the designer to specify the minimal context needed for a semantic rule. Finally, the resource- sharing concurrent semantics relies on the particular form of the semantic rules to enhance concurrency, by allowing overlapping rule instances (e.g., two threads writing in different locations in the store, which overlap on the store entity) to apply concurrently as long as they only overlap on the parts they do not change. The main contributions of the dissertation are: (1) a uniform recasting of the major existing operational semantics techniques within rewriting logic; (2) an overview description of the K framework and how it can be used to define, extend and analyze programming languages; (3) a semantics for K concurrent rewriting obtained through an embedding in graph rewriting; and (4) a description of the K-Maude tool, a tool for defining programming languages using the K technique on top of the Maude rewriting language. ii PhD Thesis, University of Illinois, December 2010 proc δόξan Θεού iii PhD Thesis, University of Illinois, December 2010 Acknowledgments Concerning my pre-PhD formation, I would like to thank my grandfather Gheor- ghe and my mid- and high-school mathematics professor Cornel Noan˘afor instilling and sustaining my love for mathematics, to my mother Olivia and my brother Virgil for instilling and sustaining my love for programming, and finally to my College and Masters professors Virgil Emil C˘az˘anescu, Alexandru Mateescu, and R˘azvan Diaconescu, for showing me that computer science is more than programming, and for guiding my first research steps. My entire PhD research, including the results presented in this dissertation would not have been possible without my advisor Grigore Ros, u. I would like to especially thank him for providing countless research ideas, as well as help and guidance through the darkness of \nothing works"; his inspiration and his readiness in working together for overcoming any research obstacle have proved instrumental in my formation. In particular, his introduction of K in 2003 as a rewriting technique for defining programming languages, and the fact that he continuously used K in teaching programming language design at UIUC ever since, played a very important role in the development of the K framework, the K-Maude tool, and of this dissertation itself. I would also like to thank the rest of my research committee, made up of Darko Marinov, Jos´eMeseguer, Madhusudan Parthasarathy, and Tom Ball, for providing valuable feedback which helped in presenting my research in a better light and strengthen the value of this dissertation, and for their insight- ful suggestions for potential future work related to the presented research; in particular, I would like to thank Jos´eMeseguer for his vision over the rewrit- ing logic semantics project and for his direct collaboration in developing the initial stages of this dissertation. My research life at UIUC would have been a lot more stern without all my previous and current colleagues within the Formal Systems and Formal Methods and Declarative Languages groups, among which Marcelo d'Amorim, Feng Chen, Chucky Ellison, Michael Ilseman, Mark Hills, Dongyun Jin, Mike Katelman, Choonghwan Lee, Patrick Meredith, Andrei Popescu, Ralf Sasse, and Andrei S, tef˘anescu were always ready to offer a good advice, to argue about everything, or simply to help procrastinating before deadlines. Thank you guys! iv PhD Thesis, University of Illinois, December 2010 A special thanks is due to my family from both sides of the ocean, including, but not limited to my parents Mircea and Olivia, my brother Virgil and his wife Gabriela, and to my parents-in-law Ioan and Aurelia, for always loving me and trusting in my potential; in particular, to my wife Claudia, for going through all this process together, for growing together, celebrating together, and also suffering together at times, and to my girls, Cezara Maria and Teodora, for bringing light on dark days and constantly reminding me that there are far more important things in life than research. Thanks is also due to my non-research related friends from this \new world", among which Bogdan, Cristi, Francisco, Matei, Nick, and Thyago, for helping me face the \cultural shock", and for being good friends, whether in need or in celebrating the happy moments of our lives. Finally, I would like to thank the entire Three Hierarchs Greek Orthodox Church community, for being a home away from home for us, and in particular to Fr. George Pyle, and Fr. Michael Condos, for their continuous spiritual support and counsel during all this time. The research in this dissertation has been supported in part by NSF grants CCF-0916893, CNS-0720512, CNS-0509321, CCF-0448501, by NASA contract NNL08AA23C, by a Samsung SAIT grant, and by several Microsoft gifts. v PhD Thesis, University of Illinois, December 2010 Table of Contents Chapter 1 Introduction ........................ 1 Chapter 2 Background........................ 23 Chapter 3 A Rewriting Logic Approach to Operational Semantics ...................... 37 Chapter 4 An Overview of the K Semantic Framework..... 87 Chapter 5 From Language Definitions to (Runtime) Analysis Tools ................................. 128 Chapter 6 A Concurrent Semantics for K Rewriting...... 150 Chapter 7 K-Maude|A Rewriting Logic Implementation of the K Framework.......................... 194 Chapter 8 Related Work ...................... 214 Chapter 9 Conclusions.........................221 Bibliography............................... 225 vi PhD Thesis, University of Illinois, December 2010 Chapter 1 Introduction This dissertation shows that rewriting is a natural environment to formally define the semantics of real-life concurrent programming languages and to test and analyze programs written in those languages. 1.1 Motivation Computers are becoming an integral part of our life. Besides the increase in personal computer usage, there are now programable devices embedded in all aspects of modern life, from consumer electronics to life critical systems such as transportation and medical devices. Moreover, the internet and the information age has brought a whole world of previously remote services at only a click distance. All these services, be they provided by embedded systems or by personal or remote computers, share a common characteristic: they result from programming their host using specialized languages. These languages can vary to a high degree in their level of abstraction from machine description languages such as Verilog and VHDL, whose instructions are very close to the hardware circuits they describe, to high level imperative, object oriented and/or functional languages, such as Java, C#, or OCaml. To address the continuous increase in difficulty of software specifications, these language have to evolve and new domain specific languages and methodologies must be designed and deployed. At the same time, paradigm changes in hardware design must be accompanied by similar changes in language design. Moore's law [119] states that the number of transistors on an integrated circuit chip doubles about every two years. However, while this trend is expected to continue for the next 10-20 years (until its physical limits are attained), the implication that doubling the number of transistors doubles serial computing power no longer holds true. The move to multi-core architectures is therefore
Load more

Recommended publications
  • Acm Names Fellows for Innovations in Computing
    CONTACT: Virginia Gold 212-626-0505 [email protected] ACM NAMES FELLOWS FOR INNOVATIONS IN COMPUTING 2014 Fellows Made Computing Contributions to Enterprise, Entertainment, and Education NEW YORK, January 8, 2015—ACM has recognized 47 of its members for their contributions to computing that are driving innovations across multiple domains and disciplines. The 2014 ACM Fellows, who hail from some of the world’s leading universities, corporations, and research labs, have achieved advances in computing research and development that are driving innovation and sustaining economic development around the world. ACM President Alexander L. Wolf acknowledged the advances made by this year’s ACM Fellows. “Our world has been immeasurably improved by the impact of their innovations. We recognize their contributions to the dynamic computing technologies that are making a difference to the study of computer science, the community of computing professionals, and the countless consumers and citizens who are benefiting from their creativity and commitment.” The 2014 ACM Fellows have been cited for contributions to key computing fields including database mining and design; artificial intelligence and machine learning; cryptography and verification; Internet security and privacy; computer vision and medical imaging; electronic design automation; and human-computer interaction. ACM will formally recognize the 2014 Fellows at its annual Awards Banquet in June in San Francisco. Additional information about the ACM 2014 Fellows, the awards event, as well as previous
    [Show full text]
  • Journal of Applied Logic
    JOURNAL OF APPLIED LOGIC AUTHOR INFORMATION PACK TABLE OF CONTENTS XXX . • Description p.1 • Impact Factor p.1 • Abstracting and Indexing p.1 • Editorial Board p.1 • Guide for Authors p.5 ISSN: 1570-8683 DESCRIPTION . This journal welcomes papers in the areas of logic which can be applied in other disciplines as well as application papers in those disciplines, the unifying theme being logics arising from modelling the human agent. For a list of areas covered see the Editorial Board. The editors keep close contact with the various application areas, with The International Federation of Compuational Logic and with the book series Studies in Logic and Practical Reasoning. Benefits to authors We also provide many author benefits, such as free PDFs, a liberal copyright policy, special discounts on Elsevier publications and much more. Please click here for more information on our author services. Please see our Guide for Authors for information on article submission. This journal has an Open Archive. All published items, including research articles, have unrestricted access and will remain permanently free to read and download 48 months after publication. All papers in the Archive are subject to Elsevier's user license. If you require any further information or help, please visit our Support Center IMPACT FACTOR . 2016: 0.838 © Clarivate Analytics Journal Citation Reports 2017 ABSTRACTING AND INDEXING . Zentralblatt MATH Scopus EDITORIAL BOARD . Executive Editors Dov M. Gabbay, King's College London, London, UK Sarit Kraus, Bar-llan University,
    [Show full text]
  • Knowledge Representation in Bicategories of Relations
    Knowledge Representation in Bicategories of Relations Evan Patterson Department of Statistics, Stanford University Abstract We introduce the relational ontology log, or relational olog, a knowledge representation system based on the category of sets and relations. It is inspired by Spivak and Kent’s olog, a recent categorical framework for knowledge representation. Relational ologs interpolate between ologs and description logic, the dominant formalism for knowledge representation today. In this paper, we investigate relational ologs both for their own sake and to gain insight into the relationship between the algebraic and logical approaches to knowledge representation. On a practical level, we show by example that relational ologs have a friendly and intuitive—yet fully precise—graphical syntax, derived from the string diagrams of monoidal categories. We explain several other useful features of relational ologs not possessed by most description logics, such as a type system and a rich, flexible notion of instance data. In a more theoretical vein, we draw on categorical logic to show how relational ologs can be translated to and from logical theories in a fragment of first-order logic. Although we make extensive use of categorical language, this paper is designed to be self-contained and has considerable expository content. The only prerequisites are knowledge of first-order logic and the rudiments of category theory. 1. Introduction arXiv:1706.00526v2 [cs.AI] 1 Nov 2017 The representation of human knowledge in computable form is among the oldest and most fundamental problems of artificial intelligence. Several recent trends are stimulating continued research in the field of knowledge representation (KR).
    [Show full text]
  • Contextuality, Cohomology and Paradox
    The Sheaf Team Rui Soares Barbosa, Kohei Kishida, Ray Lal and Shane Mansfield Samson Abramsky Joint work with Rui Soares Barbosa, KoheiContextuality, Kishida, Ray LalCohomology and Shane and Mansfield Paradox (Department of Computer Science, University of Oxford)2 / 37 Contextuality. Key to the \magic" of quantum computation. Experimentally verified, highly non-classical feature of physical reality. And pervasive in logic, computation, and beyond. In a nutshell: data which is locally consistent, but globally inconsistent. We find a direct connection between the structure of quantum contextuality and classic semantic paradoxes such as \Liar cycles". Conversely, contextuality offers a novel perspective on these paradoxes. Cohomology. Sheaf theory provides the natural mathematical setting for our analysis, since it is directly concerned with the passage from local to global. In this setting, it is furthermore natural to use sheaf cohomology to characterise contextuality. Cohomology is one of the major tools of modern mathematics, which has until now largely been conspicuous by its absence, in logic, theoretical computer science, and quantum information. Our results show that cohomological obstructions to the extension of local sections to global ones witness a large class of contextuality arguments. Contextual Semantics Samson Abramsky Joint work with Rui Soares Barbosa, KoheiContextuality, Kishida, Ray LalCohomology and Shane and Mansfield Paradox (Department of Computer Science, University of Oxford)3 / 37 In a nutshell: data which is locally consistent, but globally inconsistent. We find a direct connection between the structure of quantum contextuality and classic semantic paradoxes such as \Liar cycles". Conversely, contextuality offers a novel perspective on these paradoxes. Cohomology. Sheaf theory provides the natural mathematical setting for our analysis, since it is directly concerned with the passage from local to global.
    [Show full text]
  • Current Issue of FACS FACTS
    Issue 2021-2 July 2021 FACS A C T S The Newsletter of the Formal Aspects of Computing Science (FACS) Specialist Group ISSN 0950-1231 FACS FACTS Issue 2021-2 July 2021 About FACS FACTS FACS FACTS (ISSN: 0950-1231) is the newsletter of the BCS Specialist Group on Formal Aspects of Computing Science (FACS). FACS FACTS is distributed in electronic form to all FACS members. Submissions to FACS FACTS are always welcome. Please visit the newsletter area of the BCS FACS website for further details at: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/ Back issues of FACS FACTS are available for download from: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/back-issues-of-facs-facts/ The FACS FACTS Team Newsletter Editors Tim Denvir [email protected] Brian Monahan [email protected] Editorial Team: Jonathan Bowen, John Cooke, Tim Denvir, Brian Monahan, Margaret West. Contributors to this issue: Jonathan Bowen, Andrew Johnstone, Keith Lines, Brian Monahan, John Tucker, Glynn Winskel BCS-FACS websites BCS: http://www.bcs-facs.org LinkedIn: https://www.linkedin.com/groups/2427579/ Facebook: http://www.facebook.com/pages/BCS-FACS/120243984688255 Wikipedia: http://en.wikipedia.org/wiki/BCS-FACS If you have any questions about BCS-FACS, please send these to Jonathan Bowen at [email protected]. 2 FACS FACTS Issue 2021-2 July 2021 Editorial Dear readers, Welcome to the 2021-2 issue of the FACS FACTS Newsletter. A theme for this issue is suggested by the thought that it is just over 50 years since the birth of Domain Theory1.
    [Show full text]
  • Physics from Computer Science
    Physics from Computer Science Samson Abramsky and Bob Coecke Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK. samson abramsky · [email protected] Where sciences interact. We are, respectively, a computer scientist interested in the logic and seman- tics of computation, and a physicist interested in the foundations of quantum mechanics. Currently we are pursuing what we consider to be a very fruitful collaboration as members of the same Computer Science department. How has this come about? It flows naturally from the fact that we are working in a field of computer science where physical theory starts to play a key role, that is, natural computation, with, of course, quantum computation as a special case. At this workshop there will be many advocates of this program present, and we are honoured to be part of that community. But there is more. Our joint research is both research on semantics for distributed computing with non-von Neumann architectures, and on the axiomatic foundations of physical theories. This dual character of our work comes without any compromise, and proves to be very fruitful. Computational architectures as toy models for physics. Computer science has something more to offer to the other sciences than the computer. Indeed, on the topic of mathematical and logical un- derstanding of fundamental transdisciplinary scientific concepts such as interaction, concurrency and causality, synchrony and asynchrony, compositional modelling and reasoning, open systems, qualitative versus quantitative reasoning, operational methodologies, continuous versus discrete, hybrid systems etc. computer science is far ahead of many other sciences, due to the challenges arising from the amaz- ing rapidity of the technology change and development it is constantly being confronted with.
    [Show full text]
  • A Fully Abstract Game Semantics for Countable Nondeterminism
    A Fully Abstract Game Semantics for Countable Nondeterminism W. John Gowers1 Computer Science Department, University of Bath Claverton Down Road, Bath. BA2 7QY, United Kingdom [email protected] https://orcid.org/0000-0002-4513-9618 James D. Laird Department of Computer Science, University of Bath Claverton Down Road, Bath. BA2 7QY, United Kingdom [email protected] Abstract The concept of fairness for a concurrent program means that the program must be able to exhibit an unbounded amount of nondeterminism without diverging. Game semantics models of nondeterminism show that this is hard to implement; for example, Harmer and McCusker’s model only admits infinite nondeterminism if there is also the possibility of divergence. We solve a long standing problem by giving a fully abstract game semantics for a simple stateful language with a countably infinite nondeterminism primitive. We see that doing so requires us to keep track of infinitary information about strategies, as well as their finite behaviours. The unbounded nondeterminism gives rise to further problems, which can be formalized as a lack of continuity in the language. In order to prove adequacy for our model (which usually requires continuity), we develop a new technique in which we simulate the nondeterminism using a deterministic stateful construction, and then use combinatorial techniques to transfer the result to the nondeterministic language. Lastly, we prove full abstraction for the model; because of the lack of continuity, we cannot deduce this from definability of compact elements in the usual way, and we have to use a stronger universality result instead.
    [Show full text]
  • A Bibliography of Publications on Hashing Algorithms
    A Bibliography of Publications on Hashing Algorithms Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 24 August 2021 Version 2.344 Title word cross-reference [BRM+09, BS91b, BS91a, CM01, Gir87, Ven86, WS93, War14, Coh97, Coh98, LHC05, QG89, QG90]. O(1) [FKS84]. O(log log n) #2 [Cer85]. [MN90]. O(log W ) [LS07b]. O(N) [HG77, MN90]. pn [Ack74]. π [FFGL10]. q 1 [PPS21]. 10 [GLM+10]. 11 [SY11]. 2 [OWZ14]. SL2 [MT16]. Z=p [Mue04]. + [EAA 16, GG92, HD72]. 2n [QG89, QG90]. + 3 [CBA94, Fly92, GG92, GK94, LMJC07, -approximate [SWQ 14]. -ary LDY+16, SYW+20, WSSO12]. 5=8 [Sch11]. [CC91, CLC92, Gui78, RRS07]. -Bit $62m [Nic17]. 64 [LK16]. ∗ [LNS93]. + [QG89, QG90, LK16, LK11]. -Body MT [WS93, War14]. -codes [Bie95]. -dimension [Omi88, Omi89a]. [HRB13]. 2 [AK98, QJ97]. A [Lyo83]. A∗ [MD97]. A2 [LHC05]. -dimensional [Yuv75]. + + -Functions [OOB12]. -gram [Bie95]. α [ABC 16]. b [LK11]. B [TB91]. + c [SWQ+14]. d [FPS17, PRM16]. f [LG78]. [Coh98, Ven86]. -Grams [Coh97, BRM 09]. 2 -Hash [BS91b, BS91a]. -Independence GL2(Fpn )[TNS20].H [DRS12]. H2A [CBB05]. K [Yuv75, APV07, CL85, CC91, [PT16, PT10a]. -mer [HC14, PNPC20]. CLC92, DKRT15, Die96, EFMRK+20, -min-wise [FPS17]. -Nearest [CL85]. + -partitions [DKRT15]. -Pipeline [PRM16]. FPS17, Gui78, HC14, LLG 17, PT10a, + PT16, PNPC20, RRS07, SS90b]. L [OOB12]. -probe [SS90b]. -Round [GLM 10, SY11].
    [Show full text]
  • Type Theory & Functional Programming
    Type Theory & Functional Programming Simon Thompson Computing Laboratory, University of Kent March 1999 c Simon Thompson, 1999 Not to be reproduced i ii To my parents Preface Constructive Type theory has been a topic of research interest to computer scientists, mathematicians, logicians and philosophers for a number of years. For computer scientists it provides a framework which brings together logic and programming languages in a most elegant and fertile way: program development and verification can proceed within a single system. Viewed in a different way, type theory is a functional programming language with some novel features, such as the totality of all its functions, its expressive type system allowing functions whose result type depends upon the value of its input, and sophisticated modules and abstract types whose interfaces can contain logical assertions as well as signature information. A third point of view emphasizes that programs (or functions) can be extracted from proofs in the logic. Up until now most of the material on type theory has only appeared in proceedings of conferences and in research papers, so it seems appropriate to try to set down the current state of development in a form accessible to interested final-year undergraduates, graduate students, research workers and teachers in computer science and related fields – hence this book. The book can be thought of as giving both a first and a second course in type theory. We begin with introductory material on logic and functional programming, and follow this by presenting the system of type theory itself, together with many examples. As well as this we go further, looking at the system from a mathematical perspective, thus elucidating a number of its important properties.
    [Show full text]
  • Physics, Nanoscience, and Complexity
    Physics, Nanoscience, and Complexity This section contains links to textbooks, books, and articles in digital libraries of several publishers (Springer, Elsevier, Wiley, etc.). Most links will work without login on any campus (or remotely using the institution’s VPN) where the institution (company) subscribes to those digital libraries. For De Gruyter and the associated university presses (Chicago, Columbia, Harvard, Princeton, Yale, etc.) you may have to go through your institution’s library portal first. A red title indicates an excellent item, and a blue title indicates a very good (often introductory) item. A purple year of publication is a warning sign. Titles of Open Access (free access) items are colored green. The library is being converted to conform to the university virtual library model that I developed. This section of the library was updated on 06 September 2021. Professor Joseph Vaisman Computer Science and Engineering Department NYU Tandon School of Engineering This section (and the library as a whole) is a free resource published under Attribution-NonCommercial-NoDerivatives 4.0 International license: You can share – copy and redistribute the material in any medium or format under the following terms: Attribution, NonCommercial, and NoDerivatives. https://creativecommons.org/licenses/by-nc-nd/4.0/ Copyright 2021 Joseph Vaisman Table of Contents Food for Thought Biographies, Opinions, & Works Books Articles Philip W. Anderson John Stewart Bell Hans Bethe David Bohm Niels Bohr Ludwig Boltzmann Paul Dirac Albert Einstein
    [Show full text]
  • Quantum Information-Flow, Concretely, Abstractly
    Proc. QPL 2004, pp. 57–73 Quantum information-flow, concretely, abstractly Bob Coecke∗ Oxford University Computing Laboratory Abstract These ‘lecture notes’ are based on joint work with Samson Abramsky. I will survey and informally discuss the results of [3, 4, 5, 12, 13] in a pedestrian not too technical way. These include: • ‘The logic of entanglement’, that is, the identification and abstract axiomatiza- tion of the ‘quantum information-flow’ which enables protocols such as quan- tum teleportation.1 To this means we defined strongly compact closed categories which abstractly capture the behavioral properties of quantum entanglement. • ‘Postulates for an abstract quantum formalism’ in which classical information- flow (e.g. token exchange) is part of the formalism. As an example, we provided a purely formal description of quantum teleportation and proved correctness in abstract generality.2 In this formalism types reflect kinds, contra the essentially typeless von Neumann formalism [25]. Hence even concretely this formalism manifestly improves on the usual one. • ‘A high-level approach to quantum informatics’.3 Indeed, the above discussed work can be conceived as aiming to solve: ??? high-level language ' . von Neumann quantum formalism low-level language I also provide a brief discussion on how classical and quantum uncertainty can be mixed in the above formalism (cf. density matrices).4 1 What? When? Where? Why? First of all, for us ‘quantum’ stands for the concepts (both operational and formal) which had to be added to classical physics in order to understand observed phenomena such as ∗Howard Barnum, Rick Blute, Sam Braunstein, Vincent Danos, Ross Duncan, Peter Hines, Martin Hyland, Prakash Panangaden, Peter Selinger and Vlatko Vedral provided feedback.
    [Show full text]
  • LIST of E-BOOKS E-Book : JU 1
    LIST OF E-BOOKS e-Book : JU 1 . Sl. eBook Author No. 2.5G Mobile Networks : GPRS and EDGE Publisher : McGraw Hill Education 1. Kasera ISBN (Online) : 9780071336871 http://tata-mch.pdn.ipublishcentral.com/product/25g-mobile-networks-gprs-edge 2004 - The Unified Modeling Language. Modelling Languages and Applications Thomas BaarAlfred Publisher : Springer StrohmeierAna 2. Year of Publication : 2004 MoreiraStephen J. http://link.springer.com/book/10.1007/b101232 Mellor 3+1 Formalism in General Relativity Publisher : Springer 3. Eric Gourgoulhon Year of Publication : 2012 http://link.springer.com/book/10.1007/978-3-642-24525-1 3D Structure from Images - SMILE 2000 Marc PollefeysLuc Publisher : Springer Van GoolAndrew 4. Year of Publication : 2001 ZissermanAndrew http://link.springer.com/book/10.1007/3-540-45296-6 Fitzgibbon 3D Structure from Multiple Images of Large-Scale Environments Publisher : Springer Reinhard KochLuc 5. Year of Publication : 1998 Van Gool http://link.springer.com/book/10.1007/3-540-49437-5 3G Networks : Architecture, Protocols and Procedures Publisher : McGraw Hill Education 6. ISBN (Online) : 9780071336864 Kasera http://tata-mch.pdn.ipublishcentral.com/product/3g-networks-architecture-protocols- procedures 60 Tips On Object Oriented Prog Publisher : McGraw Hill Education 7. Ganesh ISBN (Online) : 9780071338349 http://tata-mch.pdn.ipublishcentral.com/product/60-tips-on-object-oriented-prog 8051 Microcontroller Publisher : Pearson 8. Ghoshal Subrata ISBN (Online) : 9788131742808 ; Year of Publication : 2002 http://lib.myilibrary.com?id=265503 8051 Microcontrollers: Hardware, Software & Applications Publisher : McGraw Hill Education 9. ISBN (Online) : 9780071321525 Udayashankar http://tata-mch.pdn.ipublishcentral.com/product/8051-microcontrollers-hardware- software-applications 8085 Microprocessor: Architecture, Programming and Interfacing, The : Architecture, Programming and Interfacing Kumar, K.
    [Show full text]