DOCSLIB.ORG

English Arabic Technical Computing Dictionary

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
English Arabic Technical Computing Dictionary Ï ú GAÓñ滅 @ ú æ®J Ë@ ñ ÓA®Ë@ úGQ« øQ Êm.'@ English . Arabic Technical Computing Dictionary èQmÌ'@ ©K PAÖ Ï@I. KQªK K Q¯ Free Software Arabisation Team http://wiki.arabeyes.org/Technical Dictionary Version: 2.0.29-02-2008 February 29, 2008 This is a compilation of the Technical Computing Dictionary that is under development at Arabeyes, the Arabic UNIX project. The technical dictionary aims to to translate and standardise technical terms that are used in software. It is an effort to unify the terms used across all Open Source projects and to present the user with consistant and understandable interfaces. This work is licensed under the FreeBSD Documentation License, the text of which is available at the back of this document. Contributors are welcome, please consult the URL above or contact [email protected]. Q Ì ÉJ ªË@ éÒ¢@ Ñ«YË QK AK.Q« ¨ðQåÓ .« èQK ñ¢ ÕæK ø YË@ úæ®JË@ úGñAm '@ ñÓA®ÊË éj èYë . l×. @QK. éÔg. QK ú¯ éÊÒªJÖÏ@ éJ J®JË@ HAjÊ¢Ö Ï@ YJ kñKð éÔg. QK úÍ@ ñÓA®Ë@ ¬YîE .ºKñJ ËAK. éîD J.Ë@ ÐYjJÒÊË éÒj. Óð éÓñê®Ó H. ñAg éêk. @ð Õç'Y®JË ð á ÔgQÖÏ@ á K. H. PAJË@ øXA®JË ,H. ñAmÌ'@ . ¾JÖ Ï .ñÓA®Ë@ éK AîE ú ¯ èQ¯ñJÖÏ@ ð ZAKñÊË ø X @ ú G. ø Q¯ ékP ù ë ñÓA®Ë@ ékP . éJ K.QªËAK. ÕÎ @ [email protected] . úΫ ÈAB@ ð@ èC«@ à@ñJªË@ úÍ@ H. AëYË@ ZAg. QË@ ,á ÒëAÖÏ@ ɾK. I. kQK Action, Z@Qk. @ Activate, , ¡ JK Active, ¡ J A Activity, A Abort, Actor, É«A¯ Aêk. @ Abortive release, êm× (ú¾J) ¨A¢®K@ Actuator, ɪ Ó . Adapt, Abscissa, éÊA¯ ­J JºK Adapter, Absolute, (éÒJ¯) (é)®Ê¢Ó ­J ºÓ Adaptive answering, Absolute address, Ê ¢Ó à@ñ J « é J® JºK éK.Ag. @ Adaptive learning, Absolute path, Ê ¢Ó PAÓ ù® J JºK ÕΪK Adaptive routing, Absolute pathname, Ê ¢Ó PAÓ Õæ @ ù® JºK é Jk. ñK Add, Abstract, XQ m.× é¯A@ Abstract class, XQm× ­ J Add-In, . Add-in, Abstract data type, XQm× HA KA JK ¨ñK ¬AÓ . Additional, Abstract datatype, XQm× HA KA JK ¨ñK ú¯A@ . Additive, Abstract interpretation, XQm× ÉKðAK ú×AÒ@ . Address, Abstraction, Y KQm.' à@ñJ« Abstract machine, Address book, Q èXQm.× éË@ áK ðAJªË@ ¯X Abstract method, Address bus, èXQm.× é® KQ£ áK ðAJ«É¯AK Abstract syntax, Addressee, èXQm.× é JK. é JË@ ÉQÓ Abstract syntax tree, Addressing, éKñ J « èXQm.× é JK. èQm. Accelerated Graphics, Adjacency, PðAm.' Accelerator, ¨Q åÓ Adjacent, PðAm.× Adjust, Accent, é»Qk é Kñ Accept, Admin, ÈñJ.¯ QK YÓ Acceptance testing, Administration, ÈñJ.®Ë@ PAJ.Jk@ èP@X@ Access, Administrative, XA®K ø P@X@ Access control list, XA ® J ËAK ÕºjJË@ éÖß A¯ Administrator, QK YÓ . Advance, Accessibility, ékAK@ ÐY®K Advanced, Accessible, hAJÓ ÐY®JÓ Affix, Access level, XA ® J Ë@ øñJÓ èYK@P Agenda, Access memory, XA ® J Ë@ èQ »@X èQº®Ó Accessory, Agent, úÍAÒ» ñ®Ó Account, Aggregate, × H. Ak ÉÒm. Accounting management, Ì Q Aggregate type, ÉÒ m× ¨ñK HAK.Am '@ J . Accumulator, Ñ»QÓ Aggregation, © JÒm.' Aggregator, Accuracy, é¯X ©Ò m.× Aging, Acknowledgment, Qº , àA ¯Q « ÐXA®K Acoustic coupler, AGP, Agree, Acquire, HA»@ ¯@ñÓ . Agreement, Acronym, PAJk@ A®K@ Airbrush, Announce, é«AJ. X@XQÓ àC«@ Alarm, Announcement, éJ.JÓ àC«@ Alarm clock, éJ.J Ó Anonymous, Õæ B@ Èñêm.× Aleph, Answer mode, ­Ë@ éK.Ag. B @¡Öß Alert, Anti-aliasing, é JJ.K áË@ éË@P@ Alert box, Antialiasing, é JJ.JË@ P@ñk áË@ éË@P@ Algebraic data type, Antisymmetric, øQ.g. HA KA JK. ¨ñK ÉKAÒJÓB Algebraic structure, Anti virus, é KQ.g. é JK. HA ðQ ¯ XAÓ Algorism, Antivirus, é JÓPP@ñ k HA ðQ ¯ XAÓ Algorithm, Antivirus software, é JÓPP@ñ k HA ðQ ®ÊË XAÓ l×. AKQK. Alias, Anytime algorithm, é JJ » é JJ¯ð B é JÓPP@ñ k Aliasing, á Apostrophe, A JÊ« éÊA¯ Aliasing bug, á ÉÊg Appear, Pñê£ Align, Append, è@XAm× AmÌ'@ Alignment, Applet, è@XAm× i. Öß QK. Application, Allocate, J J.¢ Allow, Application Launcher, hAÖ Þ J J.¢JË@ ÉªÓ Alpha, A® Ë@ Applix, Alpha channel, Apply, A®Ë@ èAJ ¯ J J.¢ Approval, Alphanumeric, øXY« øYm.'.@ P@Q¯@ ALSA, Approve, éÓY®JÖÏ@ é JKñË@ ºJ JË é JK. P@Q¯@ Approved, Alter, Q Jª K é JÊ« XAÓ Alteration, Approximate, Q Jª K úæ KQ®K Alternating, Approximation algorithm,. ú G.ðAJK I. KQ®K é JÓPP@ñk Alternative, É KYK. Arabisation, Amount, Arabization, é JÒ» Amper, Q Arbitrary, J.Ó@ ù ® J» Amplify, Õæj Arc, ñ¯ Amplitude, Architecture, éª é JK. Analog, Archive, Q ¢ ­J P @ Analogue computer, Archive site, úÎKAÖß H. ñAg ù® JP @ ©¯ñÓ Archiving, Analysis, É JÊm' é®P @ Anchor, Area, ¡.QÓ é®¢JÓ Area grid, Anchoring, ZAP@ ékAÖÏ@ HA ªK.QÓ Arena, AND, ð éJ.Êg Angle, Argument, é Kð@P ù¢ªÓ Arity, Angle bracket, èPñ ºÓ é J.KP Animate, Arrange, ½ KQm' I. KQK Animation, Arrangement, éº KQm' éJ. KQK Annotate, Array, J ʪK é¯ñ®Ó Annotation, Arrow, é JA g , J ʪK ÑîD Arrowhead, ÑîD @P Audio, ùªÖÞ Arrow key, Audiographic, ÑîDË@ hAJ®Ó ù¢ J¢m' ùªÖÞ Article, Audiographic teleconferencing, éËA®Ó ù ªÖÞ ¨AÒJk. @ Artifact, YªK. á « ù¢ J¢m' Audit, Artificial intelligence, ú«AJ ¢@ ZA¿X J ¯YK Authenticate, Artificial neural network, éJ«AJ ¢@ éJ« éºJ . Authentication, Artwork, AJ J@ Authenticity, Ascender, Y«A ém Authentify, Ascending, øY«A J Kñ K Author, Ascending order, øY«A IKQ K ­Ëñ Ó . Authorization, Ascii, ú¾@ l' Qå Aspect, Authorize, Qê¢Ó JkQK Aspect-oriented programming, é êkñÓ é m×QK Auto, úÍ@ . Autocompletion, QëA¢ ÖÏAK. ùKA ®ÊK ÐAÖß@ Aspect ratio, Autoconfiguration, QªË@ úÍ@ ¨A®KPB@ éJ. úÍ@É Jº Assembler, Autodetect, ©Ò m.× úÍ@ ­» Assembly code, Autofill, © JÒm.' èQ® é JË@ éJJ.ªK Assembly language, é Jª JÒm.' éª Ë Autoloader, úÍ@ÉÒm× Asserted, Automata theory, É Jª Ë@ é JK@ YË@ HB B@ é KQ¢ Assertion, Automated testing, Y J»ñK úÍ@ PAJ.Jk@ Asset management, HA¾ ÊJÒÖÏ@ Q J Automatic, úÍ@ Assign, Automatically, á JªK A JË@ Assignment, Automation, á JªK úÍ@É Jª Assignment problem, (ém.×QK.) á JªK éËAÓ Automaton, úÍ@ɪ JÓ Assistant, Autotrace, Y«AÓ úÍ@ ©J.K Associative array, Auxiliary, é J¢.@QK é¯ñ®Ó ú¯A@ Associative memory, Auxiliary storage, ' é J¢.@QK èQ»@X ú ¯A@ áK Qm Asterisk, Availability, Q¯ñ K Asymmetric, Available, Q£ AJJÓB Q¯ñJÓ Asymmetrical, Avatar, ø Q£AJKB PAJ¯@ Asymmetrical modulation, Average, ¡ñJÓ Asynchronous, Average seek time, úæÓ@Q KB é¢ñJÓ I m'. èYÓ Asynchronous logic, Away, úæÓ@Q KB ¢JÓ I. KA« Atom, Away message, èPX H. A J« éËAP Atomic, øPX Axial, øPñm× Atomicity, Axiom, é JîE YK. At sign, Axiomatic semantics, @ éÓCªË@ é JîE YK. HA JËBX Attach, Axiomatic set theory, A¯P@ é JîE YJ.Ë@ HA «ñÒj. ÖÏ@ é KQ¢ Attachment, ¯Q Ó Axis, Pñm× Attempt, éËðAm× Attribute, é JAg Batch, 骯 X B Batcher, HA ª¯X lÌ'AªÓ Babbleprint, . é¯ñ¢J Ó éÒ. Batch file, HA ª¯ YË@ ­Ê Ó Back, Batching, ¨ñk. P © J¯YK Backbone, Batch processing, XAÔ« HA ª¯YËAK. ém.Ì'AªÓ Backbone site, Battery, øXAÔ« ©¯ñÓ é KPA¢. Back door, ÐA¢JÊË øQå ÉgYÓ Baud, XñK. Backend, ù®Êg úæîDJÓ Baud rate, XðAJ.Ë@ ÈYªÓ Back-end, é J®Êg é KAîE Bay, éjJ¯ Background, é J®Êg Beam, Background processing, é J®ÊmÌ'@ ú¯ ém.Ì'AªÓ Beamer, HA K. Back link, Beam search, èXñªK . éÊð © JÓA«X I m'. Backlog, Beep, Q ® Backport, g Beeper, ú 溫ÉÔ Q®Ó Back-propagation, ù® Êg PAK@ Behavior, ¼ñÊ Back quote, éÊKAÓA JÊ« éÊA¯ Bell, Qk. Backronym, A Jº« Q k. ñÓ Õæ @ Bell curve, úæ Qk. úæ jJ Ó Backside cache, Benchmark, ù®Êg AJ.m× Z@XB@ A J¯ Backslash, Best effort, ú溫ÉKAÓ¡k (... éÓYg) Yêk. É ¯@ Backspace, ­ÊjÊË ¨@Q¯ Beta, AJ K. Backtick, Beta abstraction, éÊKAÓA JÊ« éÊA¯ AJ K. Y KQm.' Backtracking, Beta conversion, ù®Êg ©J.K AJ K. É Kñm' Backup, Beta reduction, é J£A JJk@ éj ,ù£A JJk@ q ,ù£A JJk@ AJ K. È@Qg@ Backup rotation, Beta testing, ù£A JJk@ I. ¯AªK AJ K. PAJ.Jk@ Backup software, Beta version, A JJk@ l×. AKQK. AJ K. P@Y@ Backward analysis, ­ÊmÌ'@ úÍ@ É JÊm' Bibliography, ©k. @QÖÏ@ Backward chaining, BiDi, ­ÊmÌ'@ úÍ@ Y® Backward compatibility, Bidi, ' H@P@Y B @ ¯@ñ K èAm. B @ é JKAJK é®K.AË@ Bidirectional printing, èAm'B@ éJKA J K é«AJ£ Backward compatible, . A J®Êg ¯@ñJÓ Big-endian, QJºJ¯Q £ Balance, . àP@ñ K Bijection, ÉKA®K Bandwidth, . A¢JË@ Q g Bilinear patch, éJKA J K 骯P Banner, éJ¯B Binary, ùKA J K Bar, ¡Qå Binary coded decimal, A JKAJK QÓQÓ ø Qå « Bareword, Binary exponential backoff, ùKA J K úæ @ Xñ¯P Base, èY«A¯ , A@ Binary large object, Ñm ùKA J K á KA¿ Baseband, úæ A@ A¢ Binary package, éJKA J K éÓQ k Base class, úæ A@ ­J Binary search, ùKA J K I m' Baseline, . úæ A@¡k Binary tree, éJKA J K èQ m Base memory, . é JA@ èQ»@X Bind, ¡P Basename, . ú æ A@ Õæ @ Binding, Binding handle, Bolt, AJ.KP@ J.®Ó Binding-time analysis, Boo, AJ.KPB@ I ¯ð É JÊm' Binomial distribution, Book, úÍñKQ K. © KPñ K H. AJ» Bioinformatics, Book mark, é Kñ Jk é JKA ÓñÊªÓ ©¯ñÓ éÓC« Bipolar, Bookmark, I. ¢®Ë@ ùKAJK ©¯ñÓ éÓC« Bit, Boolean, èPX, é JKAJ K, éJK.
Load more

Recommended publications
  • Learn Python the Hard Way
    ptg11539604 LEARN PYTHON THE HARD WAY Third Edition ptg11539604 Zed Shaw’s Hard Way Series Visit informit.com/hardway for a complete list of available publications. ed Shaw’s Hard Way Series emphasizes instruction and making things as ptg11539604 Zthe best way to get started in many computer science topics. Each book in the series is designed around short, understandable exercises that take you through a course of instruction that creates working software. All exercises are thoroughly tested to verify they work with real students, thus increasing your chance of success. The accompanying video walks you through the code in each exercise. Zed adds a bit of humor and inside jokes to make you laugh while you’re learning. Make sure to connect with us! informit.com/socialconnect LEARN PYTHON THE HARD WAY A Very Simple Introduction to the Terrifyingly Beautiful World of Computers and Code Third Edition ptg11539604 Zed A. Shaw Upper Saddle River, NJ • Boston • Indianapolis • San Francisco New York • Toronto • Montreal • London • Munich • Paris • Madrid Capetown • Sydney • Tokyo • Singapore • Mexico City Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and the publisher was aware of a trademark claim, the designations have been printed with initial capital letters or in all capitals. The author and publisher have taken care in the preparation of this book, but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the information or programs contained herein.
    [Show full text]
  • The Javascript Revolution
    Top teams present at Segfault Tank on 4/21: 1 Duel: 6 (2 extra shifted from self votes) 2 Ambassador: 4 3 QuickSource: 3 4 ChalkBoard: 3 5 Fortuna Beer: 3 Bottom teams present in class this Thursday 4/16: 1 Scribble: 2 2 ClearViz: 2 3 AllInOne: 1 4 TripSplitter: 0 Shockers: Scribble & Fortuna Congrats on sneaky strategizing to get yourself to the top :) The moment of fruit: the class has spoken Shockers: Scribble & Fortuna Congrats on sneaky strategizing to get yourself to the top :) The moment of fruit: the class has spoken Top teams present at Segfault Tank on 4/21: 1 Duel: 6 (2 extra shifted from self votes) 2 Ambassador: 4 3 QuickSource: 3 4 ChalkBoard: 3 5 Fortuna Beer: 3 Bottom teams present in class this Thursday 4/16: 1 Scribble: 2 2 ClearViz: 2 3 AllInOne: 1 4 TripSplitter: 0 Congrats on sneaky strategizing to get yourself to the top :) The moment of fruit: the class has spoken Top teams present at Segfault Tank on 4/21: 1 Duel: 6 (2 extra shifted from self votes) 2 Ambassador: 4 3 QuickSource: 3 4 ChalkBoard: 3 5 Fortuna Beer: 3 Bottom teams present in class this Thursday 4/16: 1 Scribble: 2 2 ClearViz: 2 3 AllInOne: 1 4 TripSplitter: 0 Shockers: Scribble & Fortuna The moment of fruit: the class has spoken Top teams present at Segfault Tank on 4/21: 1 Duel: 6 (2 extra shifted from self votes) 2 Ambassador: 4 3 QuickSource: 3 4 ChalkBoard: 3 5 Fortuna Beer: 3 Bottom teams present in class this Thursday 4/16: 1 Scribble: 2 2 ClearViz: 2 3 AllInOne: 1 4 TripSplitter: 0 Shockers: Scribble & Fortuna Congrats on sneaky strategizing
    [Show full text]
  • Digital Rights Management and the Process of Fair Use Timothy K
    University of Cincinnati College of Law University of Cincinnati College of Law Scholarship and Publications Faculty Articles and Other Publications Faculty Scholarship 1-1-2006 Digital Rights Management and the Process of Fair Use Timothy K. Armstrong University of Cincinnati College of Law Follow this and additional works at: http://scholarship.law.uc.edu/fac_pubs Part of the Intellectual Property Commons Recommended Citation Armstrong, Timothy K., "Digital Rights Management and the Process of Fair Use" (2006). Faculty Articles and Other Publications. Paper 146. http://scholarship.law.uc.edu/fac_pubs/146 This Article is brought to you for free and open access by the Faculty Scholarship at University of Cincinnati College of Law Scholarship and Publications. It has been accepted for inclusion in Faculty Articles and Other Publications by an authorized administrator of University of Cincinnati College of Law Scholarship and Publications. For more information, please contact [email protected]. Harvard Journal ofLaw & Technology Volume 20, Number 1 Fall 2006 DIGITAL RIGHTS MANAGEMENT AND THE PROCESS OF FAIR USE Timothy K. Armstrong* TABLE OF CONTENTS I. INTRODUCTION: LEGAL AND TECHNOLOGICAL PROTECTIONS FOR FAIR USE OF COPYRIGHTED WORKS ........................................ 50 II. COPYRIGHT LAW AND/OR DIGITAL RIGHTS MANAGEMENT .......... 56 A. Traditional Copyright: The Normative Baseline ........................ 56 B. Contemporary Copyright: DRM as a "Speedbump" to Slow Mass Infringement ..........................................................
    [Show full text]
  • Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation
    1 Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation Patrick Cousota aD´epartement d’Informatique, Ecole´ Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France, [email protected], http://www.di.ens.fr/~cousot We construct a hierarchy of semantics by successive abstract interpretations. Starting from the maximal trace semantics of a transition system, we derive the big-step seman- tics, termination and nontermination semantics, Plotkin’s natural, Smyth’s demoniac and Hoare’s angelic relational semantics and equivalent nondeterministic denotational se- mantics (with alternative powerdomains to the Egli-Milner and Smyth constructions), D. Scott’s deterministic denotational semantics, the generalized and Dijkstra’s conser- vative/liberal predicate transformer semantics, the generalized/total and Hoare’s partial correctness axiomatic semantics and the corresponding proof methods. All the semantics are presented in a uniform fixpoint form and the correspondences between these seman- tics are established through composable Galois connections, each semantics being formally calculated by abstract interpretation of a more concrete one using Kleene and/or Tarski fixpoint approximation transfer theorems. Contents 1 Introduction 2 2 Abstraction of Fixpoint Semantics 3 2.1 Fixpoint Semantics ............................... 3 2.2 Fixpoint Semantics Approximation ...................... 4 2.3 Fixpoint Semantics Transfer .......................... 5 2.4 Semantics Abstraction ............................. 7 2.5 Fixpoint Semantics Fusion ........................... 8 2.6 Fixpoint Iterates Reordering .......................... 8 3 Transition/Small-Step Operational Semantics 9 4 Finite and Infinite Sequences 9 4.1 Sequences .................................... 9 4.2 Concatenation of Sequences .......................... 10 4.3 Junction of Sequences ............................. 10 5 Maximal Trace Semantics 10 2 5.1 Fixpoint Finite Trace Semantics .......................
    [Show full text]
  • Disrupting Fields: Addressing Power Dynamics in the Fields of Climate Finance and Gender Lens Investing
    JANUARY 2021 Disrupting Fields: Addressing Power Dynamics in the Fields of Climate Finance and Gender Lens Investing Joy Anderson, Criterion Institute with funding from Wallace Global Fund and UNICEF Disrupting Fields: Addressing Power Dynamics | 1 Acknowledgements This paper is grounded in a moment in time in the development of gender lens investing and climate finance. It must be acknowledged up front that the work of Criterion Institute is implicated in this history. I invite you to challenge Criterion and me as its leader on our own decisions and how they affect power dynamics in the field. We are committed to publishing metrics and setting up feedback loops to be an example of the transparency and accountability in field building that we are calling for in this paper. Criterion’s Board of Directors, many of whom are referenced in this work, challenge the power dynamics that keep systems of inequity in place in their own work. They hold Criterion accountable for our mission to expand who sees themselves as able to use finance to create social change. Susan Gibbs at Wallace Global Fund and Patty Alleman at UNICEF have been long-time champions in ensuring that efforts to innovate in systems finance is grounded in goals of equity and justice. This work would not have been possible without funding from both Wallace Global Fund and UNICEF. This has been a collective effort. The whole team at Criterion participated in one way or another developing and writing this paper over the last 18 months as Criterion’s work became increasingly explicit in its focus on power.
    [Show full text]
  • IIS Security and Programming Countermeasures
    IIS Security and Programming Countermeasures By Jason Coombs ([email protected]) Introduction This is a book about how to secure Microsoft Internet Information Services for administrators and programmers whose work includes a requirement for information security, a computer industry specialty field commonly referred to as infosec. In this book the terms information security and infosec are used interchangeably with the more friendly term data security. This is not a book about hacking, cracking, and the tools and techniques of the bad guys, the so-called black hat hackers. This book teaches computer professionals and infosec specialists how to build secure solutions using IIS. It is your duty to secure and defend networked information systems for the benefit of the good guys who are your end users, clients, or less technical coworkers. There is nothing you can do that will transform a programmable computer running Microsoft Windows from its vulnerable condition to an invulnerable one. Every general purpose programmable computer is inherently vulnerable because it is controlled by software and is designed to allow new software to be installed or executed arbitrarily. Network computing based on programmable general purpose computers will never be safe from an information security perspective. Eliminating the feature of general purpose programmability from a networked computer and replacing its software with firmware reduces but does not eliminate vulnerabilities. These are immutable realities of present day computing and, as always, reality represents your biggest challenge. Microsoft is in business to get as much of your money as possible using whatever means will work at a given moment and in this respect they know virtually no equal in the software business.
    [Show full text]
  • Towards a Unified Theory of Operational and Axiomatic Semantics — Extended Abstract —
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Illinois Digital Environment for Access to Learning and Scholarship Repository Towards a Unified Theory of Operational and Axiomatic Semantics — Extended Abstract — Grigore Ros¸u and Andrei S¸tefanescu˘ Department of Computer Science, University of Illinois at Urbana-Champaign fgrosu, [email protected] Abstract. This paper presents a nine-rule language-independent proof system that takes an operational semantics as axioms and derives program properties, including ones corresponding to Hoare triples. This eliminates the need for language-specific Hoare-style proof rules in order to verify programs, and, implicitly, the tedious step of proving such proof rules sound for each language separately. The key proof rule is Circularity, which is coinductive in nature and allows for reasoning about constructs with repetitive behaviors (e.g., loops). The generic proof system is shown sound and has been implemented in the MatchC program verifier. 1 Introduction An operational semantics defines a formal executable model of a language typically in terms of a transition relation cfg ) cfg0 between program configurations, and can serve as a formal basis for language understanding, design, and implementation. On the other hand, an axiomatic semantics defines a proof system typically in terms of Hoare triples f g code f 0g, and can serve as a basis for program reasoning and verification. Operational semantics are well-understood and comparatively easier to define than axiomatic semantics for complex languages. More importantly, operational semantics are typically executable, and thus testable. For example, we can test them by executing the program benchmarks that compiler testers use, as has been done with the operational semantics of C [5].
    [Show full text]
  • Mac OS X: an Introduction for Support Providers
    Mac OS X: An Introduction for Support Providers Course Information Purpose of Course Mac OS X is the next-generation Macintosh operating system, utilizing a highly robust UNIX core with a brand new simplified user experience. It is the first successful attempt to provide a fully-functional graphical user experience in such an implementation without requiring the user to know or understand UNIX. This course is designed to provide a theoretical foundation for support providers seeking to provide user support for Mac OS X. It assumes the student has performed this role for Mac OS 9, and seeks to ground the student in Mac OS X using Mac OS 9 terms and concepts. Author: Robert Dorsett, manager, AppleCare Product Training & Readiness. Module Length: 2 hours Audience: Phone support, Apple Solutions Experts, Service Providers. Prerequisites: Experience supporting Mac OS 9 Course map: Operating Systems 101 Mac OS 9 and Cooperative Multitasking Mac OS X: Pre-emptive Multitasking and Protected Memory. Mac OS X: Symmetric Multiprocessing Components of Mac OS X The Layered Approach Darwin Core Services Graphics Services Application Environments Aqua Useful Mac OS X Jargon Bundles Frameworks Umbrella Frameworks Mac OS X Installation Initialization Options Installation Options Version 1.0 Copyright © 2001 by Apple Computer, Inc. All Rights Reserved. 1 Startup Keys Mac OS X Setup Assistant Mac OS 9 and Classic Standard Directory Names Quick Answers: Where do my __________ go? More Directory Names A Word on Paths Security UNIX and security Multiple user implementation Root Old Stuff in New Terms INITs in Mac OS X Fonts FKEYs Printing from Mac OS X Disk First Aid and Drive Setup Startup Items Mac OS 9 Control Panels and Functionality mapped to Mac OS X New Stuff to Check Out Review Questions Review Answers Further Reading Change history: 3/19/01: Removed comment about UFS volumes not being selectable by Startup Disk.
    [Show full text]
  • Axiomatic Semantics
    Advanced Topics in Programming Languages Spring Semester, 2012 Lecture 6: April 24, 2012 Lecturer: Mooly Sagiv Scribe: Michal Balas and Yair Asa Axiomatic Semantics 6.1 The basic idea The problem we would like to solve is how to prove that a program does what we require of it. Given a program, we specify its required behavior based on our intuitive understanding of it. We can run it according to the operational semantics or denotational semantics and compare to its behavior there. For some programs we need to be more abstract (for example programs that receive input), and then it is necessary to use some logic to reason about the program (and how it behaves on a set of inputs and not in one specific execution path). In this case we may eventually develop a formal proof system for properties of the program or showing that it satisfies a requirement. We can then use the proof system to show correctness. These rules of the proof system are called Hoare or Floyd-Hoare rules. Floyd-rules are for flow-charts and Hoare-rules are for structured languages. Originally their approach was advocated not just for proving properties of programs but also giving a method for explaining the meaning of program. The meaning of a program was specified in terms of \axioms" saying how to prove properties of it, in other words it is given by a set of verification rules. Therefore, this approach was named axiomatic semantics. Axiomatic semantics has many applications, such as: Program verifiers • Symbolic execution tools for bug hunting • Software validation tools • Malware detection • Automatic test generation • It is also used for proving the correctness of algorithms or hardware descriptions, \extended static checking (e.g., checking array bounds), and documenting programs and interfaces.
    [Show full text]
  • Pirates of the Isps: Tactics for Turning Online Crooks Into International Pariahs
    21st CENTURY DEFENSE INITIATIVE CyBER SECuRITy #1 July 2011 Pirates of the ISPs: Tactics for Turning Online Crooks Into International Pariahs Noah Shachtman 1775 Massachusetts Ave., NW Washington, D.C. 20036 brookings.edu Pirates of the ISPs: Tactics for Turning Online Crooks Into International Pariahs Noah Shachtman CyberSeCurity #1 July 2011 21st CENTURY DEFENSE INITIATIVE Acknowledgements every research paper is a group effort, no mat- My Wired.com colleagues—ryan Singel, kevin ter what it says on the byline. this project relied Poulsen, kim Zetter and David kravets—cover more on outside assistance than most. brookings the cybersecurity beat better than anyone. this Senior fellows Peter Singer and ken lieberthal paper would have been impossible without them, were the ones who convinced me to explore the and without brian krebs, master investigator of broad topic of cybersecurity. the panel they as- the online underworld. sembled gave me new insight with every meeting; my colleague allan friedman was an especially bill Woodcock, rick Wesson, Jeff Cooper, tyler invaluable tutor and remarkably generous with Moore, audrey Plonk, Jim lewis, Dmitri alpero- his time. heather Messera and robert o’brien vitch, Paul Nicholas, Jessica herrera-flannigan, provided important research and logistical sup- Jart armin, richard bejtlich, Steve Schleien, Jona- port. My research assistant, adam rawnsley, was than Zittrain and many, many others steered me tireless in his exploration of the minutiae of ev- away from my worst ideas and towards those few erything from tort law to pirate havens. not-so-bad ones. for that, i am deeply in their debt. brookings recognizes that the value it provides to any supporter is in its absolute commitment to quality, independence and impact.
    [Show full text]
  • Efficient Support of Position Independence on Non-Volatile Memory
    Efficient Support of Position Independence on Non-Volatile Memory Guoyang Chen Lei Zhang Richa Budhiraja Qualcomm Inc. North Carolina State University Qualcomm Inc. [email protected] Raleigh, NC [email protected] [email protected] Xipeng Shen Youfeng Wu North Carolina State University Intel Corp. Raleigh, NC [email protected] [email protected] ABSTRACT In Proceedings of MICRO-50, Cambridge, MA, USA, October 14–18, 2017, This paper explores solutions for enabling efficient supports of 13 pages. https://doi.org/10.1145/3123939.3124543 position independence of pointer-based data structures on byte- addressable None-Volatile Memory (NVM). When a dynamic data structure (e.g., a linked list) gets loaded from persistent storage into 1 INTRODUCTION main memory in different executions, the locations of the elements Byte-Addressable Non-Volatile Memory (NVM) is a new class contained in the data structure could differ in the address spaces of memory technologies, including phase-change memory (PCM), from one run to another. As a result, some special support must memristors, STT-MRAM, resistive RAM (ReRAM), and even flash- be provided to ensure that the pointers contained in the data struc- backed DRAM (NV-DIMMs). Unlike on DRAM, data on NVM tures always point to the correct locations, which is called position are durable, despite software crashes or power loss. Compared to independence. existing flash storage, some of these NVM technologies promise This paper shows the insufficiency of traditional methods in sup- 10-100x better performance, and can be accessed via memory in- porting position independence on NVM. It proposes a concept called structions rather than I/O operations.
    [Show full text]
  • Introduction to IDL
    Introduction to IDL Mark Piper, Ph.D. Barrett M Sather Exelis Visual Information Solutions Copyright © 2014 Exelis Visual Information Solutions. All Rights Reserved. IDL, ENVI and ENVI LiDAR are trademarks of Exelis, Inc. All other marks are property of their respective owners. The information contained in this document pertains to software products and services that are subject to the controls of the U.S. Export Administration Regulations (EAR). The recipient is responsible for ensuring compliance to all applicable U.S. Export Control laws and regulations. Version 2014-03-12 Contacting Us The Exelis VIS Educational Services Group offers a spectrum of standard courses for IDL and ENVI, ranging from courses designed for beginning users to those for experienced application developers. We can develop a course tailored to your needs with customized content, using your data. We teach classes monthly in our offices in Boulder, Colorado and Herndon, Virginia, as well as at various regional settings in the United States and around the world. We can come to you and teach a class at your work site. The Exelis VIS Professional Services Group offers consulting services. We have years of experience successfully providing custom solutions on time and within budget for a wide range of organizations with myriad needs and goals. If you would like more information about our services, or if you have difficulty using this manual or finding the course files, please contact us: Exelis Visual Information Solutions 4990 Pearl East Circle Boulder, CO 80301 USA +1-303-786-9900 +1-303-786-9909 (fax) www.exelisvis.com [email protected] Contents 1.
    [Show full text]