Distributed Eductive Execution of Hybrid Intensional Programs

Paquet, Joey

doi:10.1109/compsac.2009.137

Cited by 21 publications

(41 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper, therefore, presents the theoretical foundations of such a type system used in GIPSY at compile time for static type checking, as well as at run-time for dynamic type checking [1]. Specifically, the GIPSY type system is used by the compiler (the General Intensional Programming Compiler -GIPC) and the run-time system (the General Eduction Engine -GEE) when producing and executing a binary GIPSY program [7], [10] (called the GEE Resources -GEER) respectively [21], [20], [1].…”

Section: B Introduction To Gipsymentioning

confidence: 99%

A Type System for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY

Mokhov¹,

Paquet

2010

2010 IEEE/ACIS 9th International Conference on Computer and Information Science

Self Cite

View full text Add to dashboard Cite

We present a type system theory for the General Intensional Programming System (GIPSY), a platform designed to support intensional programming languages (built upon higher-order intensional logic) and their imperative counter-parts for the eductive execution model. We extend the simple theory of types (STT) by adding the intensionality axiom to it. The intensionality principle covers language expressions that explicitly take into account a multidimensional context space of evaluation treating the context as a first-class value. We, therefore, describe and discuss the properties of such a type system and the related type theory. This work is done to complement our previous software engineering design and implementation study of the GIPSY type system.

show abstract

Section: B Introduction To Gipsymentioning

confidence: 99%

A Type System for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY

Mokhov¹,

Paquet

2010

2010 IEEE/ACIS 9th International Conference on Computer and Information Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…GEE is the component where the distributed demand-driven evaluation takes place, e.g. relying on the Demand Migration System (DMS) [36], [37], and the multi-tier architecture overall [34], [38]. The Demand Migration System (DMS) in here is an implementation of the Demand Migration Framework (DMF) introduced earlier by Vassev and extended by Pourteymour [39], [40], [41], [37].…”

Section: General Intensional Programming System (Gipsy)mentioning

confidence: 99%

“…Specifically, our priority is to implement the notion of self-forensics in the GIPSY [70], [32], [34], [71] and DMARF [61], [72], [73], [74] systems. Then, we plan to gather performance and storage overhead statistics when the self-forensics modules are turned on.…”

Section: Future Workmentioning

confidence: 99%

“…The General Intensional Programming System (GIPSY) [29], [30], [31], [32], [33], [34] is an open-source platform implemented primarily in Java to investigate properties of the Lucid [18], [19], [35] family of intensional programming languages and beyond. It is a distributed system, designed as a modular collection of frameworks where components related to the development (RIPE, a Run-time Integrated Programming Environment), compilation (GIPC, the General Intensional Programming Compiler), and execution (GEE, the General Eduction Engine) of Lucid programs are decoupled to allow easy extension, addition, and replacement of the components.…”

Section: General Intensional Programming System (Gipsy)mentioning

confidence: 99%

See 1 more Smart Citation

Self-Forensics Through Case Studies of Small-to-Medium Software Systems

Mokhov

Vassev

2009

2009 Fifth International Conference on IT Security Incident Management and IT Forensics

View full text Add to dashboard Cite

The notion and definition of self-forensics was introduced by Mokhov to encompass software and hardware capabilities for autonomic and other systems to record their own states, events, and others encoded in a forensic form suitable for (potentially automated) forensic analysis, evidence modeling and specification, and event reconstruction for various system components. For self-forensics, "self-dissection" is possible for analysis using a standard language and decision making if the system includes such a self-forensic subsystem. The self-forensic evidence is encoded in a cyberforensic investigation case and event reconstruction language, Forensic Lucid. The encoding of the stories depicted by the evidence comprise a context as a first-class value of a Forensic Lucid "program", after which an investigator models the case describing relationships between various events and pieces of information. It is important to get the context right for the case to have a meaning and the proper meaning computation, so we perform case studies of some small-to-medium, distributed and not, primarily academic open-source software systems. In this work, for the purpose of implementation of the small self-forensic modules for the data structures and event flow, we specify the requirements of what the context should be for those systems. The systems share in common the base programming language -Java, so our self-forensic logging of the Java data structures and events as Forensic Lucid context specification expressions is laid out ready for an investigator to examine and model the case.

show abstract

“…1. We use the Java programming language and the associated set of tools from Sun Microsystems, Inc. (1994-2009) and others as our primary development and run-time environment. This is primarily because it is dynamic, supports reflection (see Green (2001Green ( -2005), various design patterns and OO programming (Flanagan (1997); Merx & Norman (2007)), exception handling, multithreading, distributed technologies, collections, and other convenient built-in features.…”

Section: Wwwintechopencommentioning

confidence: 99%

Combining and Comparing Multiple Algorithms for Better Learning and Classification: A Case Study of MARF

Mokhov¹

2010

Robot Learning

View full text Add to dashboard Cite

Distributed Eductive Execution of Hybrid Intensional Programs

Cited by 21 publications

References 6 publications

A Type System for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY

A Type System for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY

Self-Forensics Through Case Studies of Small-to-Medium Software Systems

Combining and Comparing Multiple Algorithms for Better Learning and Classification: A Case Study of MARF

Contact Info

Product

Resources

About