Open Access. Powered by Scholars. Published by Universities.®
Programming Languages and Compilers Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Numerical Analysis and Scientific Computing (774)
- Software Engineering (435)
- Databases and Information Systems (174)
- Artificial Intelligence and Robotics (155)
- Engineering (139)
-
- Computer Engineering (105)
- Theory and Algorithms (102)
- Other Computer Sciences (80)
- Graphics and Human Computer Interfaces (76)
- Education (74)
- Systems Architecture (66)
- Information Security (58)
- OS and Networks (56)
- Social and Behavioral Sciences (46)
- Data Science (35)
- Computer and Systems Architecture (31)
- Science and Mathematics Education (28)
- Statistics and Probability (27)
- Cybersecurity (26)
- Digital Communications and Networking (24)
- Mathematics (22)
- Electrical and Computer Engineering (20)
- Secondary Education (18)
- Applied Mathematics (17)
- Business (17)
- Higher Education (16)
- Computational Engineering (15)
- Institution
-
- University of Nebraska - Lincoln (716)
- Singapore Management University (413)
- City University of New York (CUNY) (92)
- Old Dominion University (47)
- Chapman University (39)
-
- Portland State University (36)
- Syracuse University (27)
- San Jose State University (26)
- California Polytechnic State University, San Luis Obispo (24)
- University of Arkansas, Fayetteville (22)
- University of Dayton (22)
- Bryn Mawr College (19)
- Loyola University Chicago (16)
- Air Force Institute of Technology (15)
- University of South Alabama (14)
- American University in Cairo (11)
- University of Nevada, Las Vegas (11)
- California State University, San Bernardino (10)
- Purdue University (10)
- Sacred Heart University (10)
- University of Texas at El Paso (10)
- The University of Akron (9)
- University of Malaya (8)
- Brigham Young University (7)
- Embry-Riddle Aeronautical University (7)
- St. Mary's University (7)
- Claremont Colleges (6)
- Southern Methodist University (6)
- Technological University Dublin (6)
- University of Nebraska at Omaha (6)
- Keyword
-
- Java (43)
- Programming (37)
- Programming languages (32)
- Software engineering (29)
- Python (27)
-
- Refactoring (26)
- Computer science (22)
- Model Check (22)
- Deep learning (19)
- Programming languages (Electronic computers) (13)
- Java 8 (12)
- Static analysis (12)
- Large language models (11)
- Machine Learning (11)
- Software (11)
- Computer software -- Development (10)
- Empirical study (10)
- Imperative programs (10)
- Linear Temporal Logic (10)
- Machine learning (10)
- Software Engineering (10)
- Compilers (9)
- Computer Science (9)
- Empirical studies (9)
- Haskell (9)
- Scala (9)
- C++ (8)
- Computational thinking (8)
- Computer programming (8)
- Default methods (8)
- Publication Year
- Publication
-
- The R Journal (708)
- Research Collection School Of Computing and Information Systems (379)
- Publications and Research (58)
- Open Educational Resources (26)
- Computer Science Faculty Publications and Presentations (24)
-
- Master's Projects (22)
- Theses and Dissertations (22)
- Computer Science Faculty Publications (20)
- Dissertations and Theses Collection (Open Access) (20)
- Computer Science Faculty Research and Scholarship (19)
- Electrical & Computer Engineering Theses & Dissertations (19)
- Journal of Computer Science Integration (17)
- Master's Theses (16)
- Computer Science: Faculty Publications and Other Works (15)
- Northeast Parallel Architecture Center (15)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (13)
- Dissertations and Theses (12)
- Computer Science Theses & Dissertations (10)
- Computer Science and Computer Engineering Undergraduate Honors Theses (10)
- Departmental Technical Reports (CS) (10)
- Graduate Theses and Dissertations (10)
- School of Computer Science & Engineering Faculty Publications (10)
- Archived Theses and Dissertations (9)
- Faculty Publications (9)
- Williams Honors College, Honors Research Projects (9)
- College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects (7)
- Honors Theses (7)
- Dissertations and Theses Collection (6)
- Electronic Theses, Projects, and Dissertations (6)
- Student Works (2000-2009) (6)
- Publication Type
- File Type
Articles 1621 - 1650 of 1842
Full-Text Articles in Programming Languages and Compilers
Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang
Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang
Research Collection School Of Computing and Information Systems
With the development of sensor technology and electronic miniaturization, wireless sensor networks have shown a wide range of promising applications as well as challenges. Early stage sensor network analysis is critical, which allows us to reveal design errors before sensor deployment. Due to their distinguishable features, system specification and verification of sensor networks are highly non-trivial tasks. On the other hand, numerous formal theories and analysis tools have been developed in formal methods community, which may offer a systematic method for formal analysis of sensor networks. This paper presents our attempt on applying formal methods to sensor network specification/verification. An …
Rejuvenate Pointcut: A Tool For Pointcut Expression Recovery In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Awais Rashid
Rejuvenate Pointcut: A Tool For Pointcut Expression Recovery In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Awais Rashid
Publications and Research
Aspect-oriented programming (AOP) strives to localize the scattered and tangled implementations of crosscutting concerns (CCCs) by allowing developers to declare that certain actions (advice) should be taken at specific points (join points) during the execution of software where a CCC (an aspect) is applicable. However, it is non-trivial to construct optimal pointcut expressions (a collection of join points) that capture the true intentions of the programmer and, upon evolution, maintain these intentions. We demonstrate an AspectJ source-level inferencing tool called rejuvenate pointcut which helps developers maintain pointcut expressions over the lifetime of a software product. A key insight into the …
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing Harry Xu
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing Harry Xu
Publications and Research
Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. In this paper, we present an automated approach which limits fragility problems by providing mechanical assistance in pointcut maintenance. The approach is based on harnessing arbitrarily deep structural commonalities between program elements corresponding to join points selected by a pointcut. The extracted patterns are then applied to later versions to offer suggestions of new join points that may require inclusion. To illustrate that the motivation behind our proposal is well-founded, we first …
Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi
Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi
Research Collection School Of Computing and Information Systems
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables. A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design. Specification languages like Timed Communicating Sequential Process (CSP) and Timed Communicating Object-Z (TCOZ) are well suited for presenting compositional models of complex real-time systems. In this work, we define a set of composable Timed Automata patterns based on hierarchical constructs in time-enriched process algebras. The patterns facilitate the hierarchical design of complex systems …
Holistic Characterization Of Parallel Programming Models In A Distributed Memory Environment, Christopher Bryan
Holistic Characterization Of Parallel Programming Models In A Distributed Memory Environment, Christopher Bryan
Computer Science and Computer Engineering Undergraduate Honors Theses
The popularity of cluster computing has increased focus on usability, especially in the area of programmability. Languages and libraries that require explicit message passing have been the standard. New languages, designed for cluster computing, are coming to the forefront as a way to simplify parallel programming. Titanium and Fortress are examples of this new class of programming paradigms. This work holistically characterizes these languages and contrasts them with the standard model of parallel programming, and presents benchmark results of small computational kernels written in these languages and models.
A Formal Model Of Semantic Web Service Ontology (Wsmo) Execution, Hai H. Wang, Nick Gibbins, Terry R. Payne, Ahmed Saleh, Jun Sun
A Formal Model Of Semantic Web Service Ontology (Wsmo) Execution, Hai H. Wang, Nick Gibbins, Terry R. Payne, Ahmed Saleh, Jun Sun
Research Collection School Of Computing and Information Systems
Semantic Web services have been one of the most significant research areas within the semantic Web vision, and have been recognized as a promising technology that exhibits huge commercial potential. Current semantic Web service research focuses on defining models and languages for the semantic markup of all relevant aspects of services, which are accessible through a Web service interface. The Web service modelling ontology (WSMO) is one of the most significant semantic Web service framework proposed to date. To support the standardization and tool support of WSMO, a formal semantics of the language is highly desirable. As there are a …
A Scalable Approach To Multi-Style Architectural Modeling And Verification, Stephen Wong, Jing Sun, Ian Warren, Jun Sun
A Scalable Approach To Multi-Style Architectural Modeling And Verification, Stephen Wong, Jing Sun, Ian Warren, Jun Sun
Research Collection School Of Computing and Information Systems
Software Architecture represents the high level description of a system in terms of components, external properties and communication. Despite its importance in the software engineering process, the lack of formal description and verification support limits the value of developing architectural models. Automated formal engineering methods can provide an effective means to precisely describe and rigorously verify intended structures and behaviors of software systems. In this paper, we present an approach to support the design and verification of software architectural models using the Alloy analyzer. Based on our earlier work, we propose a fundamental library for specifying system structures in terms …
Link Lifetimes And Randomized Neighbor Selection In Dhts, Zhongmei Yao, Dmitri Loguinov
Link Lifetimes And Randomized Neighbor Selection In Dhts, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to classical Distributed Hash Tables (DHTs) in which neighbor replacement occurs not only when current users die, but also when new user arrive into the system, and where replacement choices are often restricted to the successor of the failed zone in the DHT space. To understand neighbor churn in such networks, this paper proposes a simple, yet accurate, model for capturing link dynamics in structured P2P systems and obtains the distribution of link lifetimes …
Enforcing Behavioral Constraints In Evolving Aspect-Oriented Programs, Raffi Khatchadourian, Johan Dovland, Neelam Soundarajan
Enforcing Behavioral Constraints In Evolving Aspect-Oriented Programs, Raffi Khatchadourian, Johan Dovland, Neelam Soundarajan
Publications and Research
Reasoning, specification, and verification of Aspect-Oriented (AO) programs presents unique challenges especially as such programs evolve over time. Components, base-code and aspects alike, may be easily added, removed, interchanged, or presently unavailable at unpredictable frequencies. Consequently, modular reasoning of such programs is highly attractive as it enables tractable evolution, otherwise necessitating that the entire program be reexamined each time a component is changed. It is well known, however, that modular reasoning about AO programs is difficult. In this paper, we present our ongoing work in constructing a rely-guarantee style reasoning system for the Aspect-Oriented Programming (AOP) paradigm, adopting a trace-based …
Better Refactoring Tools For A Better Refactoring Strategy, Andrew P. Black
Better Refactoring Tools For A Better Refactoring Strategy, Andrew P. Black
Computer Science Faculty Publications and Presentations
Refactoring tools can improve the speed and accuracy with which we create and maintain software – but only if they are used. In practice, tools are not used as much as they could be; this seems to be because they do not align with the refactoring strategy preferred by the majority of programmers: floss refactoring. We propose five principles that characterize successful floss refactoring tools – principles that can help programmers to choose the most appropriate refactoring tools and also help toolsmiths to design more usable tools.
A Framework For Relationship Pattern Languages, Sudarshan Murthy, David Maier
A Framework For Relationship Pattern Languages, Sudarshan Murthy, David Maier
Computer Science Faculty Publications and Presentations
A relationship pattern is an abstraction of a recurring need when establishing relationships among information elements in specific contexts. By developing or leveraging a relationship pattern, modelers can solve a class of problems once and describe many relationship types at once. We have developed a framework for specifying relationship patterns and pattern languages (sets of patterns) in both modeling-language-independent and modeling-language-specific ways. We describe this framework both informally and formally. We provide examples of some commonly observed relationship patterns and show how to use them in ER with the help of a relationship pattern language called Exemplar. We also provide …
Patterns Of Aspect-Oriented Design, Black P. Andrew, James Noble, David J. Pearce, Arno Scmidmeir
Patterns Of Aspect-Oriented Design, Black P. Andrew, James Noble, David J. Pearce, Arno Scmidmeir
Computer Science Faculty Publications and Presentations
Aspect-oriented programming languages are becoming commonplace, and programmers are accumulating experience in building and maintaining aspect-oriented systems. This paper addresses how the use of these languages affects program design: how aspect-oriented languages change the design space, which designs should be emulated and which avoided, and the strengths and weaknesses of particular kinds of design. We identify five patterns of aspect-oriented design: Spectator, Regulator, Patch, Extension, and Heterarchical Design. For each pattern, we describe the problem it solves, show how aspect-oriented language features are used in the pattern, give characteristic examples of the pattern’s use, and assess its benefits and liabilities. …
Scalable Concurrent Hash Tables Via Relativistic Programming, Josh Triplett
Scalable Concurrent Hash Tables Via Relativistic Programming, Josh Triplett
Computer Science Faculty Publications and Presentations
Existing approaches to concurrent programming often fail to account for synchronization costs on modern shared-memory multipro- cessor architectures. A new approach to concurrent programming, known as relativistic programming, can reduce or in some cases eliminate synchronization overhead on such architectures. This approach avoids the costs of inter-processor communication and memory access by permitting processors to operate from a relativistic view of memory provided by their own caches, rather than from an absolute reference frame of memory as seen by all processors. This research shows how relativistic programming techniques can provide the perceived advantages of optimistic synchronization without the useless parallelism …
Digital Cs1 Study Pack Based On Moodle And Python, Atanas Radenski
Digital Cs1 Study Pack Based On Moodle And Python, Atanas Radenski
Mathematics, Physics, and Computer Science Faculty Books and Book Chapters
We believe that CS1 courses can be made more attractive to students:
- by teaching a highly interactive scripting language – Python
- by using an open source course management system - such as Moodle - to make all course resources available in a comprehensive digital study pack, and
- by offering detailed self-guided online labs
We have used Moodle [1] and Python [2] to develop a "Python First" digital study pack [3] which comprises a wealth of new, original learning modules: extensive e-texts, detailed self-guided labs, numerous sample programs, quizzes, and slides. Our digital study pack pedagogy is described in recent ITiCSE …
Set Linear Algebra And Set Fuzzy Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Set Linear Algebra And Set Fuzzy Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book, the authors define the new notion of set vector spaces which is the most generalized form of vector spaces. Set vector spaces make use of the least number of algebraic operations, therefore, even a non-mathematician is comfortable working with it. It is with the passage of time, that we can think of set linear algebras as a paradigm shift from linear algebras. Here, the authors have also given the fuzzy parallels of these new classes of set linear algebras. This book abounds with examples to enable the reader to understand these new concepts easily. Laborious theorems and …
The Java 5 Generics Compromise Orthogonality To Keep Compatibility, Atanas Radenski, Jeff Furlong, Vladimir Zanev
The Java 5 Generics Compromise Orthogonality To Keep Compatibility, Atanas Radenski, Jeff Furlong, Vladimir Zanev
Mathematics, Physics, and Computer Science Faculty Articles and Research
In response to a long-lasting anticipation by the Java community, version 1.5 of the Java 2 platform - referred to as Java 5 - introduced generic types and methods to the Java language. The Java 5 generics are a significant enhancement to the language expressivity because they allow straightforward composition of new generic classes from existing ones while reducing the need for a plethora of type casts. While the Java 5 generics are expressive, the chosen implementation method, type erasure, has triggered undesirable orthogonality violations. This paper identifies six cases of orthogonality violations in the Java 5 generics and demonstrates …
Reasoning About The Behavior Of Aspect-Oriented Programs, Neelam Soundarajan, Raffi Khatchadourian, Johan Dovland
Reasoning About The Behavior Of Aspect-Oriented Programs, Neelam Soundarajan, Raffi Khatchadourian, Johan Dovland
Publications and Research
Aspect-oriented programming (AOP) has become increasingly popular over the last few years. At the same time, reasoning about the behavior of these programs poses serious challenges. In this paper, we present a rely-guarantee approach to such reasoning. The rely-guarantee approach has proven useful in reasoning about concurrent and distributed programs. We show that some of the key problems encountered in reasoning about aspect-oriented programs are similar to those encountered in reasoning about concurrent programs; and that the rely-guarantee approach, appropriately modified, helps address these problems. We illustrate our approach with a simple example.
Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun
Machine-Assisted Proof Support For Validation Beyond Simulink, Chunqing Chen, Jin Song Dong, Jun Sun
Research Collection School Of Computing and Information Systems
Simulink is popular in industry for modeling and simulating embedded systems. It is deficient to handle requirements of high-level assurance and timing analysis. Previously, we showed the idea of applying Timed Interval Calculus (TIC) to complement Simulink. In this paper, we develop machine-assisted proof support for Simulink models represented in TIC. The work is based on a generic theorem prover, Prototype Verification System (PVS). The TIC specifications of both Simulink models and requirements are transformed to PVS specifications automatically. Verification can be carried out at interval level with a high level of automation. Analysis of continuous and discrete behaviors is …
Automated Refactoring Of Legacy Java Software To Enumerated Types, Raffi Khatchadourian, Jason Sawin, Atanas Rountev
Automated Refactoring Of Legacy Java Software To Enumerated Types, Raffi Khatchadourian, Jason Sawin, Atanas Rountev
Publications and Research
Modern Java languages introduce several new features that offer significant improvements over older Java technology. In this article we consider the new enum construct, which provides language support for enumerated types. Prior to recent Java languages, programmers needed to employ various patterns (e.g., the weak enum pattern) to compensate for the absence of enumerated types in Java. Unfortunately, these compensation patterns lack several highly-desirable properties of the enum construct, most notably, type safety. We present a novel fully-automated approach for transforming legacy Java code to use the new enumeration construct. This semantics-preserving approach increases type safety, produces code that is …
Novelty Detection For Cross-Lingual News Stories With Visual Duplicates And Speech Transcripts, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo
Novelty Detection For Cross-Lingual News Stories With Visual Duplicates And Speech Transcripts, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
An overwhelming volume of news videos from different channels and languages is available today, which demands automatic management of this abundant information. To effectively search, retrieve, browse and track cross-lingual news stories, a news story similarity measure plays a critical role in assessing the novelty and redundancy among them. In this paper, we explore the novelty and redundancy detection with visual duplicates and speech transcripts for cross-lingual news stories. News stories are represented by a sequence of keyframes in the visual track and a set of words extracted from speech transcript in the audio track. A major difference to pure …
An Augmented Approach To Support Collaborative Distance Learning Of Unified Modeling Language, Keng Siau, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, Ashu Guru
An Augmented Approach To Support Collaborative Distance Learning Of Unified Modeling Language, Keng Siau, Fiona Fui-Hoon Nah, Brenda Eschenbrenner, Ashu Guru
Research Collection School Of Computing and Information Systems
Teaching in the classroom faces many challenges of providing a collaborative, interactive environment that effectively facilitates students’ learning. The challenges increase when the physical classroom converts into a virtual classroom. This difficulty is further exacerbated when the course is diagramming intensive, practice-oriented, and hands-on in nature. Technology has been sought after to help with these challenges. Web Conferencing software, when compared to Web Broadcasting software, can facilitate real-time interaction and collaboration in a distance learning context. For courses that are diagramming intensive and practice-oriented, Tablet PCs, when compared to desktop PCs, can support drawing and diagramming because of the ability …
Internet Enabled Remote Driving Of A Combat Hybrid Electric Power System For Duty Cycle Measurement, Jarrett Goodell, Marc Compere, Wilford Smith, Mark Brudnak, Mike Pozolo, Et Al.
Internet Enabled Remote Driving Of A Combat Hybrid Electric Power System For Duty Cycle Measurement, Jarrett Goodell, Marc Compere, Wilford Smith, Mark Brudnak, Mike Pozolo, Et Al.
Publications
This paper describes a human-in-the-loop motion-based simulator interfaced to hybrid-electric power system hardware, both of which were used to measure the duty cycle of a combat vehicle in a virtual simulation environment. The project discussed is a greatly expanded follow-on to the experiment published in [1,7]. This paper is written in the context of [1,7] and therefore highlights the enhancements. The most prominent of these enhancements is the integration (in real-time) of the Power & Energy System Integration Lab (P&E SIL) with a motion base simulator by means of a “long haul” connection over the Internet (a geographical distance of …
Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska
Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska
Research Collection School Of Computing and Information Systems
Traditional supervised classification algorithms require a large number of labelled examples to perform accurately. Semi-supervised classification algorithms attempt to overcome this major limitation by also using unlabelled examples. Unlabelled examples have also been used to improve nearest neighbour text classification in a method called bridging. In this paper, we propose the use of bridging in a semi-supervised setting. We introduce a new bridging algorithm that can be used as a base classifier in any supervised approach such as co-training or selflearning. We empirically show that classification performance increases by improving the semi-supervised algorithm’s ability to correctly assign labels to previouslyunlabelled …
The Student Scholarship And Creative Achievement Day Application Software, Charles Alan Hofer
The Student Scholarship And Creative Achievement Day Application Software, Charles Alan Hofer
Honors Capstones
Capstone submitted as a graduation requirement for the BSU Honors Program.
Performance Analysis Of Ieee 802.11b Devices In The Presence Of Interference Aware Scheduling-Adaptive Frequency Hopping Enabled Bluetooth Devices, Deepthi Gopalpet
Performance Analysis Of Ieee 802.11b Devices In The Presence Of Interference Aware Scheduling-Adaptive Frequency Hopping Enabled Bluetooth Devices, Deepthi Gopalpet
Electrical & Computer Engineering Theses & Dissertations
Wireless Local Area networks (WLAN) and Wireless Personal Area Networks (WPAN) provide complimentary services using the same unlicensed radio frequency band of operation. The 802.11b WLAN operates in the 2.4 GHz band and uses a Direct Sequence Spread Spectrum technique. It is designed to cover large areas ranging up to 100 meters in diameter, which may connect hundreds of computers. Bluetooth (BT) WPAN also operates in the same frequency band as the IEEE 802.lib and it uses a Frequency Hopping Spread Spectrum technique. BT is primarily used for communications between notebooks, palm units and other personal computing devices within relatively …
Automated Refactoring Of Legacy Java Software To Enumerated Types, Raffi Khatchadourian, Jason Sawin, Atanas Rountev
Automated Refactoring Of Legacy Java Software To Enumerated Types, Raffi Khatchadourian, Jason Sawin, Atanas Rountev
Publications and Research
Modern Java languages introduce several new features that offer significant improvements over older Java technology. In this article we consider the new enum construct, which provides language support for enumerated types. Prior to recent Java languages, programmers needed to employ various patterns (e.g., the weak enum pattern) to compensate for the absence of enumerated types in Java. Unfortunately, these compensation patterns lack several highly-desirable properties of the enum construct, most notably, type safety. We present a novel fully-automated approach for transforming legacy Java code to use the new enumeration construct. This semantics-preserving approach increases type safety, produces code that is …
Rely-Guarantee Approach To Reasoning About Aspect-Oriented Programs, Raffi Khatchadourian, Neelam Soundarajan
Rely-Guarantee Approach To Reasoning About Aspect-Oriented Programs, Raffi Khatchadourian, Neelam Soundarajan
Publications and Research
Over the last few years, the question of reasoning about aspect-oriented programs has been addressed by a number of authors. In this paper, we present a rely-guarantee approach to such reasoning. The rely-guarantee approach has proven extremely successful in reasoning about concurrent and distributed programs. We show that some of the key problems encountered in reasoning about aspect-oriented programs are similar to those encountered in reasoning about concurrent programs; and that the rely-guarantee approach, appropriately modified, helps address these problems. We illustrate our approach with a simple example.
Digital Support For Abductive Learning In Introductory Computing Courses, Atanas Radenski
Digital Support For Abductive Learning In Introductory Computing Courses, Atanas Radenski
Mathematics, Physics, and Computer Science Faculty Articles and Research
Students who grew up browsing the Web are skilled in what is usually referred to as abduction, a reasoning process that starts with a set of specific observations and then generates the best possible explanation of those observations. In order to exploit the abduction skills of contemporary students, we have developed digital CS1/2 study packs that promote and support active learning through abduction, i.e., abductive learning. The study packs integrate a variety of digital resources: online self-guided labs, e-texts, tutorial links, sample programs, quizzes, and slides. These online packs stimulate students to learn abductively by browsing, searching, and performing self-guided …
Filling The Ontology Space For Coalition Battle Management Language, Charles Turnitsa, Curtis Blais, Andreas Tolk
Filling The Ontology Space For Coalition Battle Management Language, Charles Turnitsa, Curtis Blais, Andreas Tolk
Computational Modeling & Simulation Engineering Faculty Publications
The Coalition Battle Management Language is a language for representing and exchanging plans, orders, and reports across live, constructive and robotic forces in multi-service, multi-national and multi-organizational operations. Standardization efforts in the Simulation Interoperability Standards Organization seek to define this language through three parallel activities: (1) specify a sufficient data model to unambiguously define a set of orders using the Joint Command, Control, and Consultation Information Exchange Data Model (JC3IEDM) as a starting point; (2) develop a formal grammar (lexicon and production rules) to formalize the definition of orders, requests, and reports; (3) develop a formal battle management ontology to …
Parallel Remote Interactive Management Model, Faris Nabeeh Zuriekat
Parallel Remote Interactive Management Model, Faris Nabeeh Zuriekat
Theses Digitization Project
This thesis discusses PRIMM which stands for Parallel Remote Interactive Management Model. PRIMM is a framework for object oriented applications that relies on grid computing. It works as an interface between the remote applications and the parallel computing system. The thesis shows the capabilities that could be achieved from PRIMM architecture.