DOCSLIB.ORG

(12) United States Patent (10) Patent No.: US 8,713,544 B1 Sulton Et Al

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
(12) United States Patent (10) Patent No.: US 8,713,544 B1 Sulton Et Al USOO871354.4B1 (12) United States Patent (10) Patent No.: US 8,713,544 B1 Sulton et al. (45) Date of Patent: Apr. 29, 2014 (54) UNIVERSAL DATA-DRIVEN COMPUTER 5,581,764 A 12/1996 Fitzgerald et al. PROXY 5,649,200 A 7/1997 Leblang et al. 5,671,398 A 9, 1997 Neubauer 5,673.387 A 9, 1997 Chen et al. (75) Inventors: Jeffrey Sulton, Los Angeles, CA (US); 5,675,801 A * 10/1997 Lindsey ........................ 717/108 Bruce McCorkendale, Manhattan 5,684.875 A 1 1/1997 Ellenberger R s Carey Nachenberg, 5,729,7435,699.275 A 12/19973/1998 SquibbBeasley et al. orthridge, CA (US) 5,790,856 A 8/1998 Lillich 5,799,189 A 8, 1998 Koser et al. (73) Assignee: Symantec Corporation, Cupertino, CA 5,893,113 A 4/1999 McGrath et al. (US) 5,905,896 A 5/1999 Delannoy 5,909,581 A 6, 1999 Park - r 5,933,647 A 8/1999 Aronberg et al. (*) Notice: Subject to any disclaimer, the term of this 5,940,615 A * 8/1999 Novicket al. ................. 717/109 patent is extended or adjusted under 35 5.948, 104 A 9, 1999 Glucket al. U.S.C. 154(b) by 2324 days. (Continued) (21) Appl. No.: 10/722,949 OTHER PUBLICATIONS (22) Filed: Nov. 25, 2003 Ryan et al. Using Event-Based Parsing to Support Dynamic Protocol Evolution, Published on Mar. 2003, University of Colorado Depart (51) Int. Cl. ment of Computer Science, Technical Report CU-CS-947-03, pp. G06F 9/44 (2006.01) 1-11. G06F 9/45 (2006.01) (Continued) (52) U.S. Cl. USPC ............ 717/143; 717/142; 717/147; 717/168 Primary Examiner — Tuan Q. Dam (58) Field of Classification Search Assistant Examiner — Zheng Wei None (74) Attorney, Agent, or Firm — Fenwick & West LLP See application file for complete search history. (57) ABSTRACT (56) References Cited Methods, apparati, and computer-readable media for updat U.S. PATENT DOCUMENTS ing proxy executable code. An apparatus embodiment of the present invention comprises generic universal proxy execut 3.969,723 A 7, 1976 Kennicott able code that can be instantiated multiple times, with each 4,558,413 A 12/1985 Schmidt et al. instance being driven by a different set of files comprising a 4,714,992 A 12/1987 Gladney et al. 4,809, 170 A 2/1989 Leblang et al. protocol specification file and a proxy activity code file, to 5,155,847 A 10, 1992 Kirouac et al. control protocol decomposition and proxy functions, respec 5, 182,806 A 1/1993 McKeeman et al. tively. In a method embodiment of the present invention, a 5,204,960 A 4, 1993 Smith et al. protocol specification is created or updated; proxy activity 5,479,654 A 12/1995 Squibb code, separate from the protocol specification, is created or 5,485,575 A 1/1996 Chess et al. 5,495,610 A 2/1996 Shing et al. updated; and the proxy executable code is executed using the 5,519,866 A 5, 1996 Lawrence et al. protocol specification and the proxy activity code. 5,566,335 A 10, 1996 Nash et al. 5,574,906 A 11/1996 Morris 26 Claims, 4 Drawing Sheets protocol SPECIFICATION protocol specificatim ccMiller - - - - - - - Roxy protocol 1 PROTOCOL-coDE ACTIVITY AssociaticN CODE SPECIFICATION MODULE runtM Roxy Executas CODE US 8,713,544 B1 Page 2 (56) References Cited Hedin, Gorel, “Incremental Execution in a Programming Environ ment Based on Compilation.” Proc. of Nineteenth Hawaii Intl. Conf. U.S. PATENT DOCUMENTS on System Sciences, Abstract Only, Jan. 1986, U.S.A. Hurwitz Group, "Application Management for Distributed Applica 5,953,532 A 9, 1999 Lochbaum tions.” pp. 1-7. Jun. 1998, U.S.A. 5,960,204 A 9/1999 Yinger et al. Lindsay, Peter; Liu, Yaowei, and Traynor, Owen, “A Generic Model 6,006,034 A 12/1999 Heath et al. for Fine Grained Configuration Management Including Version Con 6,006,242 A 12/1999 Poole et al. trol and Traceability.” 1997 IEEE, retrieved from the IEEE database 6,035,423. A 3/2000 Hodges et al. Sep. 24, 2002, U.S.A. 6,052,531 A 4/2000 Waldin, Jr. et al. Marimba, “Castanet 3.0 Product Family.” Jun. 1998, U.S.A. 6,081,814 A 6/2000 Mangat et al. Marimba, "Castanet Infrastructure Suite,” Jun. 1998, U.S.A. 6,088,803 A 7/2000 TSO et al. Marimba, "Castanet Management Suite.” Jun. 1988, U.S.A. 6,092,080 A 7/2000 Gustman Marimba, "Castanet Production Suite.” Jun. 1998, U.S.A. 6,119,165 A 9, 2000 Li et al. Pocket Soft, “.RTPatch.R. Professional for Windows, NT, and DOS 6,151,643 A 11/2000 Cheng et al. Binary Update System.” pp. 1-6. Jun. 23, 1998, http://www. 6,178,551 B1 1/2001 Sana et al. pocketsoft.com\whtwind.html, U.S.A. 6,268,852 B1* 7/2001 Lindhorst et al. ............. 715,744 Pollock, Lori. “Incremental Version of Iterative Data Flow Analysis.” 6,349,407 B1 2/2002 Towfiq IEEE Trans Software Eng., v 15, in 12, Abstract Only, Dec. 1989, 6,385,661 B1* 5/2002 Guthrie et al. ................ T19.316 U.S.A. 6,418,555 B2 7/2002 Mohammed 6,484,315 B1 1 1/2002 Ziese Reichenberger, Christoph, “Orthogonal Version Management.” 6,510,552 B1 1/2003 Benayoun et al. Universitat Linz, Institute fur Informatik, Austria, 1989 ACM. 6,513,154 B1* 1/2003 Porterfield .................... 717/101 “News Release—Symantec Delivers Cutting-Edge Anti-Virus Tech 6,535,894 B1 3/2003 Schmidt et al. nology with Striker32', Oct. 1, 1999, 2 pages, online). Retrieved on 6,564,265 B2 * 5/2003 Tillmann et al. .............. TO9,246 Nov. 11, 2003. Retrieved from the Internet:<URL:http://www. 6,594,823 B1* 7/2003 Corbinet al. ...... 717/143 Symantec.com/press/1999/n991001.html>. Author unknown. 6,625,804 B1* 9/2003 Ringseth et al. .............. T17,114 “Software: Windows ME: Windows ME and System File Protec 6,651,249 B2 11/2003 Waldin et al. tion', online last updatedMar. 11, 2002, retrieved on Apr. 9, 2002 6,654,787 B1 1 1/2003 Aronson et al. Retrieved from the Internet: <URL:http//www.wackyb.co.nz/mesfp. 6,771,765 B1 8, 2004 Crowther et al. html>. 6.959,432 B2 * 10/2005 Crocker ........................ 717/126 7,069,543 B2 * 6/2006 717/127 Morar, J. E. and Chess, D. M.. “Can Cryptography Prevent Computer 7,124.406 B2 * 10/2006 717,144 Viruses?", Virus Bulletin Conference 2000, Sep. 2000, pp. 127-138, 7,130,898 B2 * 10/2006 709,223 Virus Bulletin Ltd., Oxfordshire, England. 7,194,733 B2 * 3/2007 717.136 Wikipedia.org web pages online). Wikipedia, Retrieved Mar. 17. 7,272,822 B1* 9/2007 Riggins et al. 717,124 2003 Retrieved from the Internet: <ULR: http://www.wikipedia. 7,281.237 B2 * 10/2007 de Jong ....... 717,126 org/w/wiki.phintl?title=machine learning and printable-yes>. 7.356,803 B2 * 4/2008 Bau et al. ...................... 717,116 MacNamra, John E., “Technical Aspects of Data Communication'. 7.360,200 B2 * 4/2008 Boucher ....................... 717/1OO 2ed. 1982, Digital Equipment Corporation, U.S.A. pp. 110-122. 7401,326 B1* 7/2008 Durham et al. 717/139 Ore, Oystein, "Number Theory and Its History”, 1976 Gudron Ore, 7,418,659 B2 * 8/2008 Ramani et al. 715,234 U.S.A. pp. 124-129. 7,426,717 B1 * 9/2008 Schang et al. 717,124 Keneipp, Ray, Traffic Shaping Online). May 14, 2001, retrieved 7,437,710 B2 * 10/2008 Bau et al. ... 717/117 8,335,862 B2 * 12/2012 Fletcher et al. 709/250 from the Internet on Apr. 27, 2004 Retrieved from the Internet: 8,589,594 B2 * 1 1/2013 Fletcher et al. 709/250 <URL: ItWorld.com—Supersite manager Traffic Shaping http:// 2002/0162091 A1* 10, 2002 Crocker ...... 717, 126 www.itworld.com/nl/sup mgr/05142001/>. 2004f0073891 A1* 4, 2004 Boucher .. 717/127 ISP Planet Staff, Slower Spam Would Annoy Spammers Online 2004/0088425 A1 5/2004 Rubinstein et al. ........... TO9/230 Feb. 20, 2003, retrieved from the Internet on Apr. 22, 2005). 2004/O133776 A1 7, 2004 Putzou Retrieved from the Internet: <URL: ISP Planet Equipment— 2004/0143814 A1* 7/2004 de Jong ......................... T17,104 Slower Spam Would Annoy Spammers, http://www.isp-planet.com/ 2004/0226030 A1* 11, 2004 Marvin et al. 719,328 equipment/2003/spamsquelcher.html>. 2005/0022208 A1* 1/2005 Bolar et al. .... 719,315 PRNewswire, "Spam Squelcher Technology Cuts Costly Impact of 2007/0271554 A1* 11, 2007 Fletcher et al. .... 717,147 Spam on Enterprises and ISPs:”New Product from ePrivcacy Group 2008/0022276 A1* 1/2008 Coppinger et al. 717, 178 turns back Spam Attacks with False Positives. Online Feb. 11, 2003, 2012/0266132 A1* 10/2012 Coppinger et al. ........... 717/109 Retrieved from the Internet on May 3, 2004). Retrieved from the OTHER PUBLICATIONS Internet:< URL: PR Newswire Spam Squelcher Technology Cuts Costly Impact of Spam on Enterprises and ISPs http://www. U.S. Appl. No. 10/21 1,827, filed Aug. 2, 2002, Nachenberg. findarticles.com/cf dis/maprin/2003 Feb 11/97463210/pl/ar “User-Friendly Interface for Applying Specific Levels of Coordi ticle.jhtml>. nated Updates to Software in the Field.” IBM Technical Disclosure Jee, et al., “A Generic Virus Detection Agent on the Internet”, pp. 210-219, 1997 IEEE, retrieved May 10, 2006, Taiwan. Bulletin, vol. 31, No. 10, Mar.
Load more

Recommended publications
  • MIC5161 Win 2003 Launch V6
    Microsoft Windows Server 2003 and Microsoft Visual Studio .NET 2003 Launch Guide Do more with less. 1 Contents Introduction 2 Introducing Microsoft® Windows® Server 2003 4 Windows Server 2003 Case Studies 10 Introducing Microsoft® Visual Studio® .NET 2003 26 Visual Studio .NET 2003 Case Studies 41 Australian .NET Connected Partners 47 Microsoft® SQL Server™ 52 Microsoft Exchange Server 53 Windows Server 2003 and Visual Studio .NET 2003 Launch Sponsors 55 Platform Partner 56 Platinum Sponsors 61 Gold Sponsors 81 Silver Sponsors 96 Australian Windows Server 2003 JDP 100 Microsoft Gold Certified Partners 102 2 3 Welcome to the launch of Windows Server 2003! This is an exciting time for In my ten or more years in the Australian developer community, the combination Microsoft, our partners and customers, as this is unquestionably the most of Microsoft Windows Server 2003 and Microsoft Visual Studio® .NET 2003 is customer-focused Windows Server release yet. The reality of today’s IT environment the most exciting launch I have ever been involved with. Last February, Microsoft is the demand to do more with technology and, at the same time, do it with reset the bar for innovation and productivity with a new development paradigm for less cost. Over the last two years, we have spent time with customers using building Web Services and applications – Visual Studio .NET. This year, we build Microsoft® Windows® 2000 Server and Windows NT® Server 4.0 to really on that momentum by offering an entire development platform for the building understand what it would take to enable them do a lot more with Windows Server and execution of those applications.
    [Show full text]
  • Perses: Syntax-Guided Program Reduction
    Perses: Syntax-Guided Program Reduction Chengnian Sun Yuanbo Li Qirun Zhang University of California University of California University of California Davis, CA, USA Davis, CA, USA Davis, CA, USA [email protected] [email protected] [email protected] Tianxiao Gu Zhendong Su University of California University of California Davis, CA, USA Davis, CA, USA [email protected] [email protected] ABSTRACT KEYWORDS Given a program P that exhibits a certain property ψ (e.g., a C program reduction, delta debugging, debugging program that crashes GCC when it is being compiled), the goal ACM Reference Format: of program reduction is to minimize P to a smaller variant P 0 that 0 Chengnian Sun, Yuanbo Li, Qirun Zhang, Tianxiao Gu, and Zhendong still exhibits the same property, i.e., ψ ¹P º. Program reduction is Su. 2018. Perses: Syntax-Guided Program Reduction. In ICSE ’18: ICSE ’18: important and widely demanded for testing and debugging. For 40th International Conference on Software Engineering , May 27-June 3, 2018, example, all compiler/interpreter development projects need effec- Gothenburg, Sweden. ACM, New York, NY, USA, 11 pages. https://doi.org/ tive program reduction to minimize failure-inducing test programs 10.1145/3180155.3180236 to ease debugging. However, state-of-the-art program reduction techniques — notably Delta Debugging (DD), Hierarchical Delta 1 INTRODUCTION Debugging (HDD), and C-Reduce — do not perform well in terms of Program reduction is important and widely used. Given a program speed (reduction time) and quality (size of reduced programs), or are P that exhibits a property, the objective of program reduction is to highly customized for certain languages and thus lack generality.
    [Show full text]
  • Unsupervised Translation of Programming Languages
    Unsupervised Translation of Programming Languages Marie-Anne Lachaux∗ Baptiste Roziere* Lowik Chanussot Facebook AI Research Facebook AI Research Facebook AI Research [email protected] Paris-Dauphine University [email protected] [email protected] Guillaume Lample Facebook AI Research [email protected] Abstract A transcompiler, also known as source-to-source translator, is a system that converts source code from a high-level programming language (such as C++ or Python) to another. Transcompilers are primarily used for interoperability, and to port codebases written in an obsolete or deprecated language (e.g. COBOL, Python 2) to a modern one. They typically rely on handcrafted rewrite rules, applied to the source code abstract syntax tree. Unfortunately, the resulting translations often lack readability, fail to respect the target language conventions, and require manual modifications in order to work properly. The overall translation process is time- consuming and requires expertise in both the source and target languages, making code-translation projects expensive. Although neural models significantly outper- form their rule-based counterparts in the context of natural language translation, their applications to transcompilation have been limited due to the scarcity of paral- lel data in this domain. In this paper, we propose to leverage recent approaches in unsupervised machine translation to train a fully unsupervised neural transcompiler. We train our model on source code from open source GitHub projects, and show that it can translate functions between C++, Java, and Python with high accuracy. Our method relies exclusively on monolingual source code, requires no expertise in the source or target languages, and can easily be generalized to other programming languages.
    [Show full text]
  • The A-Z of Programming Languages (Interviews with Programming Language Creators)
    The A-Z of Programming Languages (interviews with programming language creators) Computerworld, 2008-20101 Ada: S. Tucker Taft ...................................................... 1 Arduino: Tom Igoe ...................................................... 5 ASP: Microsoft .......................................................... 9 AWK: Alfred Aho ....................................................... 11 AWK & AMPL: Brian Kernighan ....................................... 15 Bash: Chet Ramey....................................................... 17 C#: Anders Hejlsberg.................................................... 20 C++: Bjarne Stroustrup ................................................. 27 Clojure: Rich Hickey .................................................... 35 ColdFusion: Jeremy Allaire .............................................. 38 D: Walter Bright ......................................................... 41 Erlang: Joe Armstrong................................................... 44 F#: Don Syme .......................................................... 48 Falcon: Giancarlo Niccolai ............................................... 51 Forth: Charles Moore .................................................... 59 Groovy: Guillaume Laforge .............................................. 61 Haskell: Simon Peyton-Jones............................................. 65 INTERCAL: Don Wood................................................. 76 JavaScript: Brendan Eich................................................ 79 Lua: Roberto Ierusalimschy..............................................
    [Show full text]
  • Learning to Map Natural Language to General Purpose Source Code
    Learning to Map Natural Language to General Purpose Source Code A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Washington 2019 Reading Committee: Luke S. Zettlemoyer, Co-Chair Alvin Cheung, Co-Chair Yejin Choi Program Authorized to Offer Degree: Computer Science and Engineering c Copyright 2019 Srinivasan Iyer 2 University of Washington Abstract Learning to Map Natural Language to General Purpose Source Code Srinivasan Iyer Co-Chair of the Supervisory Committee: Associate Professor Luke Zettlemoyer Assistant Professor Alvin Cheung Computer Science and Engineering Models that automatically map natural language (NL) to source code in general purpose languages such as Java, Python, and SQL find utility amongst two main audiences viz. developers and non-expert users. For developers, they enable use-cases such as functioning as a NL assistant in programming IDEs, verifying the consistency of code documentation with code changes, and answering "how to" questions, for developers using new languages. For non-expert users, they enable use-cases of being able to communicate with databases, devices and applications, or of visualizing data, without having to learn to write computer programs. Developing these models is challenging because of contextual dependencies of the target code, the lack of alignment between NL and code tokens, syntactic and semantic requirements of the target code, and the prohibitively expensive cost of annotating training data. Furthermore, whilst developers can see and manipulate the generated code, non-expert users only see the output of execution, and therefore have the additional constraint of the generated code being exactly correct and executable.
    [Show full text]
  • Introducing Visual Basic 2005 and the .NET Platform ■CHAPTER 1 the Philosophy of .NET
    5785ch00FM.qxd 3/31/06 3:31 PM Page i Pro VB 2005 and the .NET 2.0 Platform Second Edition Andrew Troelsen 5785ch00FM.qxd 3/31/06 3:31 PM Page ii Pro VB 2005 and the .NET 2.0 Platform Copyright © 2006 by Andrew Troelsen All rights reserved. No part of this work may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage or retrieval system, without the prior written permission of the copyright owner and the publisher. ISBN-13 (pbk): 978-1-59059-578-7 ISBN-10 (pbk): 1-59059-578-5 Printed and bound in the United States of America 9 8 7 6 5 4 3 2 1 Trademarked names may appear in this book. Rather than use a trademark symbol with every occurrence of a trademarked name, we use the names only in an editorial fashion and to the benefit of the trademark owner, with no intention of infringement of the trademark. Lead Editor: Ewan Buckingham Technical Reviewer: Don Reamey Editorial Board: Steve Anglin, Ewan Buckingham, Gary Cornell, Jason Gilmore, Jonathan Gennick, Jonathan Hassell, James Huddleston, Chris Mills, Matthew Moodie, Dominic Shakeshaft, Jim Sumser, Kier Thomas, Matt Wade Production Director and Project Manager: Grace Wong Copy Edit Manager: Nicole LeClerc Senior Copy Editor: Ami Knox Assistant Production Director: Kari Brooks-Copony Production Editor: Kelly Winquist Compositor and Artist: Kinetic Publishing Services, LLC Proofreaders: April Eddy, Lori Bring, Nancy Sixsmith Indexer: Broccoli Information Management Cover Designer: Kurt Krames Manufacturing Director: Tom Debolski Distributed to the book trade worldwide by Springer-Verlag New York, Inc., 233 Spring Street, 6th Floor, New York, NY 10013.
    [Show full text]
  • Parsing in Different Languages
    FACTA UNIVERSITATIS (NIS)ˇ SER.: ELEC.ENERG. vol. 18, No. 2, August 2005, 299-307 Parsing in Different Languages Miroslav D. Ciri´ c´ and Svetozar R. Ranciˇ c´ Abstract: A compiler is a translator that accepts as input formatted source file or files, and produces as output a file that may be run directly on a computer. Given the same ANSI C++ compliant input file, two different ANSI C++ compliant compilers running on the same operating system produce two different executable programs that should execute in exactly the same way. To some degree, this is achieved by the standard- ization of the C++ language, but it is also possible because computer programming languages like C++ can be compiled using reliable technologies with long traditions and understood characteristics. LALR(k), as practical version of LR, is such reliable technology for parsing. Traditional LALR(1) tool YACC has proved his value during years of successful applications. Nowadays there are a few commercial and noncom- mercial alternatives that are very interesting and promising. This paper will examine some of the them with ability of parsing in different programming languages. Keywords: Parsing, LALR(1), programming languages. 1 Introduction Although compilers are not the only computer applications that make use of pars- ing technology, this section will briefly explain compiler architecture in order to make clear where lexical analysis, parsing, and semantic analysis fit into the bigger picture of compilation. After a source file has been preprocessed so that it contains only those symbols that are properly part of the programming language being com- piled, it is broken into discrete tokens.
    [Show full text]
  • Pro*C/C++ Precompiler
    Pro*C/C++ Precompiler Getting Started Release 8.1.6 for Windows January 2000 Part No. A73023-01 Pro*C/C++ Precompiler Getting Started, Release 8.1.6 for Windows Part No. A73023-01 Copyright © 1994, 2000 Oracle Corporation. All rights reserved. Contributors: Riaz Ahmed, Eric Belden, Sharon Castledine, Joseph Garcia, Lisa Giambruno, Neeraj Gupta, Bernie Harris, Ana Hernandez, Mark Kennedy, Robert Knecht, Shiva Prasad, Ali Shehade, Helen Slattery, Jeff Stein, Nicole Sullivan, Janice Wong, Martha Woo, Ravi Gooty The Programs (which include both the software and documentation) contain proprietary information of Oracle Corporation; they are provided under a license agreement containing restrictions on use and disclosure and are also protected by copyright, patent, and other intellectual and industrial property laws. Reverse engineering, disassembly, or decompilation of the Programs is prohibited. The information contained in this document is subject to change without notice. If you find any problems in the documentation, please report them to us in writing. Oracle Corporation does not warrant that this document is error free. Except as may be expressly permitted in your license agreement for these Programs, no part of these Programs may be reproduced or transmitted in any form or by any means, electronic or mechanical, for any purpose, without the express written permission of Oracle Corporation. If the Programs are delivered to the U.S. Government or anyone licensing or using the programs on behalf of the U.S. Government, the following notice is applicable: Restricted Rights Notice Programs delivered subject to the DOD FAR Supplement are "commercial computer software" and use, duplication, and disclosure of the Programs, including documentation, shall be subject to the licensing restrictions set forth in the applicable Oracle license agreement.
    [Show full text]
  • The Eagle Programming Language" (2016)
    Macalester College DigitalCommons@Macalester College Mathematics, Statistics, and Computer Science Mathematics, Statistics, and Computer Science Honors Projects Spring 5-1-2016 The aE gle Programming Language Samuel G. Horlbeck Olsen Macalester College, [email protected] Follow this and additional works at: https://digitalcommons.macalester.edu/mathcs_honors Part of the Computer and Systems Architecture Commons, Computer Sciences Commons, and the Mathematics Commons Recommended Citation Horlbeck Olsen, Samuel G., "The Eagle Programming Language" (2016). Mathematics, Statistics, and Computer Science Honors Projects. 37. https://digitalcommons.macalester.edu/mathcs_honors/37 This Honors Project - Open Access is brought to you for free and open access by the Mathematics, Statistics, and Computer Science at DigitalCommons@Macalester College. It has been accepted for inclusion in Mathematics, Statistics, and Computer Science Honors Projects by an authorized administrator of DigitalCommons@Macalester College. For more information, please contact [email protected]. THE EAGLE PROGRAMMING LANGUAGE Sam Horlbeck Olsen Susan Fox, Advisor Paul Cantrell, Reader John Cannon, Reader May, 2016 Department of Mathematics, Statistics and Computer Science Copyright c 2016 Sam Horlbeck Olsen. The author grants Macalester College the nonexclusive right to make this work available for noncommercial, educational purposes, provided that this copyright statement appears on the reproduced materials and notice is given that the copy- ing is by permission of the author. To disseminate otherwise or to republish re- quires written permission from the author. Abstract C remains the dominant systems programming language despite many new languages attempting to take its place. Modern languages generally value abstraction and safety over speed and direct control of hardware. They are therefore not well suited to the low-level tasks for which C was designed.
    [Show full text]
  • Programming Visual Basic.NET
    Programming Visual Basic .NET Dave Grundgeiger Publisher: O'Reilly First Edition January 2002 ISBN: 0-596-00093-6, 464 pages Published just in time for the first release of Visual Basic Studio .NET, Programming Visual Basic .NET is a programmer's complete guide to Visual Basic .NET. Starting with a sample application and a high- level map, the book jumps right into showing how the parts of .NET fit with Visual Basic .NET. Topics include the common language runtime Windows Forms, ASP.NET, Web Forms, Web Services, and ADO.NET. Preface.................................................................................................................................. 9 Organization of This Book........................................................................................ 9 Conventions Used in This Book.............................................................................. 9 How to Contact Us .................................................................................................... 10 Acknowledgments ..................................................................................................... 11 Chapter 1. Introduction..................................................................................................... 13 1.1 What Is the Microsoft .NET Framework?.................................................. 13 1.2 What Is Visual Basic .NET?............................................................................ 14 1.3 An Example Visual Basic .NET Program ..................................................
    [Show full text]
  • Perses: Syntax-Guided Program Reduction
    Perses: Syntax-Guided Program Reduction Chengnian Sun Yuanbo Li Qirun Zhang University of California University of California University of California Davis, CA, USA Davis, CA, USA Davis, CA, USA [email protected] [email protected] [email protected] Tianxiao Gu Zhendong Su University of California University of California Davis, CA, USA Davis, CA, USA [email protected] [email protected] ABSTRACT KEYWORDS Given a program P that exhibits a certain property ψ (e.g., a C program reduction, delta debugging, debugging program that crashes GCC when it is being compiled), the goal ACM Reference Format: of program reduction is to minimize P to a smaller variant P 0 that 0 Chengnian Sun, Yuanbo Li, Qirun Zhang, Tianxiao Gu, and Zhendong still exhibits the same property, i.e., ψ ¹P º. Program reduction is Su. 2018. Perses: Syntax-Guided Program Reduction. In ICSE ’18: ICSE ’18: important and widely demanded for testing and debugging. For 40th International Conference on Software Engineering , May 27-June 3, 2018, example, all compiler/interpreter development projects need effec- Gothenburg, Sweden. ACM, New York, NY, USA, 11 pages. https://doi.org/ tive program reduction to minimize failure-inducing test programs 10.1145/3180155.3180236 to ease debugging. However, state-of-the-art program reduction techniques — notably Delta Debugging (DD), Hierarchical Delta 1 INTRODUCTION Debugging (HDD), and C-Reduce — do not perform well in terms of Program reduction is important and widely used. Given a program speed (reduction time) and quality (size of reduced programs), or are P that exhibits a property, the objective of program reduction is to highly customized for certain languages and thus lack generality.
    [Show full text]
  • Contract Programming Checker
    IT 09 023 Examensarbete 30 hp May 2009 Contract Programming Checker A study for making an automated test tool using a parser HamidReza Yazdani Najafabadi Institutionen för informationsteknologi Department of Information Technology Abstract Contract Programming Checker HamidReza Yazdani Najafabadi Teknisk- naturvetenskaplig fakultet UTH-enheten Thanks to computer software development, the communication industry has evolved a lot during the last few years. Software and hardware integration made it Besöksadress: possible to exploit the best out of available equipments. Ångströmlaboratoriet Lägerhyddsvägen 1 One of the important issues in software development process is to avoid bugs or Hus 4, Plan 0 detect them in the early stage of development phase. Experiments have shown that most of the bugs are usually coming from the small fraction of the code. If this part of Postadress: the code can be detected in advance then it is possible to benefit the cost of software Box 536 751 21 Uppsala production in great amount of time and money. Development teams have to make sure that they deliver a verified code to next team and that is why they obliged to use Telefon: a concept called “contract programming”. It means expecting each module which is 018 – 471 30 03 working with other modules to respect to some kind of contract. As long as the Telefax: contract is respected in all module interactions, valid output will be guaranteed. 018 – 471 30 00 Several problems will remain in this approach. First issue is to make sure all necessary contracts have been embedded to the code. On the other hand, contracts Hemsida: are memory and time consuming to check so try doing over protection results in http://www.teknat.uu.se/student weaker performance.
    [Show full text]