%0 Report %D 2011 %T The DSPCAD Integrative Command Line Environment: Introduction to DICE Version 1.1 %A Bhattacharyya, Shuvra S. %A Plishker,William %A Chung-Ching Shen %A Sane, Nimish %A Zaki, George %K *SOFTWARE ENGINEERING %K COMPUTER PROGRAMMING %K COMPUTER PROGRAMMING AND SOFTWARE %K COMPUTER PROGRAMS %K DICE(COMPUTER PROGRAM) %K programming languages %K Project management %X DICE (the DSPCAD Integrative Command Line Environment) is a package of utilities that facilitates efficient management of software projects. Key areas of emphasis in DICE are cross-platform operation, support for projects that integrate heterogeneous programming languages, and support for applying and integrating different kinds of design and testing methodologies. The package is being developed at the University of Maryland to facilitate the research and teaching of methods for implementation, testing, evolution, and revision of engineering software. The package is also being developed as a foundation for developing experimental research software for techniques and tools in the area of computer-aided design (CAD) of digital signal processing (DSP) systems. The package is intended for cross-platform operation, and is currently being developed and used actively on the Linux, Mac OS, Solaris, and Windows (equipped with Cygwin) platforms. This report provides an introduction to DICE, and provides background on some of the key features in DICE Version 1.1. This report also gives a brief introduction to dicelang, which is a plug-in package for DICE that provides additional utilities, libraries, and tools for managing software projects in specific programming languages. %8 2011 %G eng %0 Conference Paper %B IEEE Symposium on Security and Privacy, 2008. SP 2008 %D 2008 %T Fable: A Language for Enforcing User-defined Security Policies %A Swamy,N. %A Corcoran,B.J. %A Hicks, Michael W. %K Access control %K Automata %K Collaborative work %K Communication system security %K Computer languages %K computer security %K Data security %K enforcement policy %K FABLE %K Government %K high-level security goals %K information flow %K Information security %K Language-based security %K programming languages %K Programming profession %K provenance %K security automata %K security labels %K security of data %K user-defined security policies %K verified enforcement %K Web programming language %X This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In FABLE, security policies can be expressed by associating security labels with the data or actions they protect. Programmers define the semantics of labels in a separate part of the program called the enforcement policy. FABLE prevents a policy from being circumvented by allowing labeled terms to be manipulated only within the enforcement policy; application code must treat labeled values abstractly. Together, these features facilitate straightforward proofs that programs implementing a particular policy achieve their high-level security goals. FABLE is flexible enough to implement a wide variety of security policies, including access control, information flow, provenance, and security automata. We have implemented FABLE as part of the LINKS web programming language; we call the resulting language SELlNKS. We report on our experience using SELlNKS to build two substantial applications, a wiki and an on-line store, equipped with a combination of access control and provenance policies. To our knowledge, no existing framework enables the enforcement of such a wide variety of security policies with an equally high level of assurance. %B IEEE Symposium on Security and Privacy, 2008. SP 2008 %I IEEE %P 369 - 383 %8 2008/05/18/22 %@ 978-0-7695-3168-7 %G eng %R 10.1109/SP.2008.29 %0 Conference Paper %B Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International %D 2005 %T Comparing the Performance of High-Level Middleware Systems in Shared and Distributed Memory Parallel Environments %A Kim,Jik-Soo %A Andrade,H. %A Sussman, Alan %K Application software %K Computer science %K Computer vision %K Data analysis %K Distributed computing %K distributed computing environment %K distributed memory parallel environment %K distributed shared memory systems %K Educational institutions %K high-level middleware system %K I/O-intensive data analysis application %K Libraries %K Middleware %K parallel computing environment %K parallel library support %K parallel memories %K programming language %K programming languages %K Runtime environment %K shared memory parallel environment %K Writing %X The utilization of toolkits for writing parallel and/or distributed applications has been shown to greatly enhance developer's productivity. Such an approach hides many of the complexities associated with writing these applications, rather than relying solely on programming language aids and parallel library support, such as MPI or PVM. In this work, we evaluate three different middleware systems that have been used to implement a computation and I/O-intensive data analysis application from the domain of computer vision. This study shows the benefits and overheads associated with each of the middleware systems, in different homogeneous computational environments and with different workloads. Our results lead the way toward being able to make better decisions for tuning the application environment, for selecting the appropriate middleware, and also for designing more powerful middleware systems to efficiently build and run highly complex applications in both parallel and distributed computing environments. %B Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International %I IEEE %P 30 - 30 %8 2005/04// %@ 0-7695-2312-9 %G eng %R 10.1109/IPDPS.2005.144 %0 Conference Paper %B Proceedings of the eighth ACM SIGPLAN international conference on Functional programming %D 2003 %T Dynamic rebinding for marshalling and update, with destruct-time ? %A Bierman,Gavin %A Hicks, Michael W. %A Sewell,Peter %A Stoyle,Gareth %A Wansbrough,Keith %K distributed programming %K dynamic binding %K dynamic update %K lambda calculus %K marshalling %K programming languages %K serialisation %X Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises, for example when a marshalled value is received from the network, containing identifiers that must be rebound to local resources. Typically it is provided only by ad-hoc mechanisms that lack clean semantics.In this paper we adopt a foundational approach, developing core dynamic rebinding mechanisms as extensions to simply-typed call-by-value ? -calculus. To do so we must first explore refinements of the call-by-value reduction strategy that delay instantiation, to ensure computations make use of the most recent versions of rebound definitions. We introduce redex-time and destruct-time strategies. The latter forms the basis for a ?marsh calculus that supports dynamic rebinding of marshalled values, while remaining as far as possible statically-typed. We sketch an extension of ? marsh with concurrency and communication, giving examples showing how wrappers for encapsulating untrusted code can be expressed. Finally, we show that a high-level semantics for dynamic updating can also be based on the destruct-time strategy, defining a ?marsh calculus with simple primitives to provide type-safe updating of running code. We thereby establish primitives and a common semantic foundation for a variety of real-world dynamic rebinding requirements. %B Proceedings of the eighth ACM SIGPLAN international conference on Functional programming %S ICFP '03 %I ACM %C New York, NY, USA %P 99 - 110 %8 2003/// %@ 1-58113-756-7 %G eng %U http://doi.acm.org/10.1145/944705.944715 %R 10.1145/944705.944715 %0 Conference Paper %B IEEE INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings %D 1999 %T PLANet: an active internetwork %A Hicks, Michael W. %A Moore,J. T %A Alexander,D. S %A Gunter,C. A %A Nettles,S. M %K 100 Mbit/s %K 300 MHz %K 48 Mbit/s %K active internetwork %K active network architecture %K active network implementation %K byte-code-interpreted applications %K Computer architecture %K Computer languages %K Computer networks %K congested conditions %K dynamic programming %K dynamic router extensions %K Ethernet %K Ethernet networks %K INFORMATION SCIENCE %K Internet %K Internet-like services %K internetworking %K IP %K IP networks %K link layers %K Linux user-space applications %K Local area networks %K ML dialect %K Network performance %K networking operations %K OCaml %K Packet Language for Active Networks %K packet programs %K packet switching %K Pentium-II %K performance %K performance evaluation %K PLAN %K PLANet %K Planets %K programmability features %K programming languages %K router functionality %K special purpose programming language %K Switches %K telecommunication network routing %K Transport protocols %K Web and internet services %X We present PLANet: an active network architecture and implementation. In addition to a standard suite of Internet-like services, PLANet has two key programmability features: (1) all packets contain programs; and (2) router functionality may be extended dynamically. Packet programs are written in our special purpose programming language PLAN, the Packet Language for Active Networks, while dynamic router extensions are written in OCaml, a dialect of ML. Currently, PLANet routers run as byte-code-interpreted Linux user-space applications, and support Ethernet and IP as link layers. PLANet achieves respectable performance on standard networking operations: on 300 MHz Pentium-II's attached to 100 Mbps Ethernet, PLANet can route 48 Mbps and switch over 5000 packets per second. We demonstrate the utility of PLANet's activeness by showing experimentally how it can nontrivially improve application and aggregate network performance in congested conditions %B IEEE INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings %I IEEE %V 3 %P 1124-1133 vol.3 - 1124-1133 vol.3 %8 1999/03/21/25 %@ 0-7803-5417-6 %G eng %R 10.1109/INFCOM.1999.751668 %0 Journal Article %J IEEE Communications Magazine %D 1998 %T Safety and security of programmable network infrastructures %A Alexander,S. %A Arbaugh, William A. %A Keromytis,A. D %A Smith,J. M %K Access control %K error protection %K IP networks %K Multicast protocols %K network architecture %K network operating systems %K network service model %K operating system %K Power system dynamics %K Power system modeling %K Power system reliability %K programmable languages %K programmable network infrastructures %K programming languages %K Proposals %K Protection %K reliability properties %K Safety %K Secure Active Network Environment %K Security %K security of data %K service creation %K service providers %K Switches %K telecommunication computing %K telecommunication network reliability %K Web and internet services %X Safety and security are two reliability properties of a system. A “safe” system provides protection against errors of trusted users, while a “secure” system protects against errors introduced by untrusted users. There is considerable overlap between mechanisms to support each property. Requirements for rapid service creation have stimulated the development of programmable network infrastructures, where end users or service providers can customize the properties of a network infrastructure while it continues to operate. A central concern of potential users of such systems is their reliability and, most specifically, their safety and security. In this article we explain the impact the network service model and architecture have on safety and security, and provide a model with which policies can be translated into restrictions of a general system. We illustrate these ideas with the Secure Active Network Environment (SANE) architecture, which provides a means of controlling access to the functions provided by any programmable infrastructure %B IEEE Communications Magazine %V 36 %P 84 - 92 %8 1998/10// %@ 0163-6804 %G eng %N 10 %R 10.1109/35.722141 %0 Journal Article %J IEEE Network %D 1998 %T The SwitchWare active network architecture %A Alexander,D. S %A Arbaugh, William A. %A Hicks, Michael W. %A Kakkar,P. %A Keromytis,A. D %A Moore,J. T %A Gunter,C. A %A Nettles,S. M %A Smith,J. M %K active extensions %K active packets %K Authentication %K Computer languages %K Computer networks %K cryptography %K cryptography-based authentication %K high-integrity base %K integrity checking %K IP networks %K LAN interconnection %K mobile programs %K network operating systems %K packet switching %K programmable network infrastructure %K programming languages %K Protocols %K Safety %K safety requirements %K scalability %K secure active router infrastructure %K Security %K security requirements %K services %K strong type checking %K Switches %K SwitchWare active network architecture %K telecommunication network routing %K Tin %K usability %K verification techniques %X Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance must be achieved while maintaining the usability of the network. The SwitchWare active network architecture is a novel approach to achieving this balance using three layers: active packets, which contain mobile programs that replace traditional packets; active extensions, which provide services on the network elements and can be dynamically loaded; and a secure active router infrastructure, which forms a high-integrity base on which the security of the other layers depends. In addition to integrity checking and cryptography-based authentication, security in our architecture depends heavily on verification techniques from programming languages, such as strong type checking %B IEEE Network %V 12 %P 29 - 36 %8 1998/06//May %@ 0890-8044 %G eng %N 3 %R 10.1109/65.690959 %0 Report %D 1985 %T Research in Programming Languages and Software Engineering. %A Gannon,John %A Basili, Victor R. %A Zelkowitz, Marvin V %A Yeh,Raymond %K *BEARINGS %K *COMPUTER PROGRAMS %K *ESTIMATES %K *GUIDANCE %K *KALMAN FILTERING %K *LINEAR SYSTEMS %K *STOCHASTIC PROCESSES %K COMPUTER PROGRAMMING AND SOFTWARE %K GAIN %K identification %K measurement %K programming languages %K STATISTICS AND PROBABILITY %K SYSTEMS ENGINEERING. %K TARGET DIRECTION, RANGE AND POSITION FINDING %X During the past year three research papers were written and two published conference presentations were given. Titles of the published research articles are: A Stochastic Analysis of a Modified Gain Extended Kalman Filter with Applications to Estimation with Bearings only Measurements; The Modified Gain Extended Kalman Kilter and Parameter Identification in Linear Systems and Maximum Information Guidance for Homing Missiles. %I Department of Computer Science, University of Maryland, College Park %8 1985/12/24/ %G eng %U http://stinet.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA186269 %0 Journal Article %J International Journal of Man-Machine Studies %D 1977 %T Measuring computer program quality and comprehension %A Shneiderman, Ben %K cognitive psychology %K commenting %K memorization %K modification %K program design %K programmer behavior %K Programming %K programming experiments %K programming languages %K RECALL %K structured programming %X Judging the relative quality of computer programs and a programmer's comprehension of a given program has proven to be a difficult task. Ability to debug, modify, hand simulate execution or respond to questions about the program all have their weaknesses as comprehension metrics. This paper offers experimental evidence which supports the use of memorization/recall tasks as a further basis for judging program quality and programmer comprehension. A syntactic/semantic model of programmer behavior is presented to provide a basis for this hypothesis. %B International Journal of Man-Machine Studies %V 9 %P 465 - 478 %8 1977/07// %@ 0020-7373 %G eng %U http://www.sciencedirect.com/science/article/pii/S002073737780014X %N 4 %R 10.1016/S0020-7373(77)80014-X