Joey Paquet

  1. Reasoning About a Simulated Printer Case Investigation with Forensic Lucid.

    Authors: Joey Paquet, Serguei A. Mokhov, Mourad Debbabi
    Subjects: Logic in Computer Science
    Abstract

    In this work we model the ACME (a fictitious company name) "printer case
    incident" and make its specification in Forensic Lucid, a Lucid- and
    intensional-logic-based programming language for cyberforensic analysis and
    event reconstruction specification. The printer case involves a dispute between
    two parties that was previously solved using the finite-state automata (FSA)
    approach, and is now re-done in a more usable way in Forensic Lucid.

  2. The Need to Support of Data Flow Graph Visualization of Forensic Lucid Programs, Forensic Evidence, and their Evaluation by GIPSY.

    Authors: Joey Paquet, Serguei A. Mokhov, Mourad Debbabi
    Subjects: Programming Languages
    Abstract

    Lucid programs are data-flow programs and can be visually represented as data
    flow graphs (DFGs) and composed visually. Forensic Lucid, a Lucid dialect, is a
    language to specify and reason about cyberforensics cases. It includes the
    encoding of the evidence (representing the context of evaluation) and the crime
    scene modeling in order to validate claims against the model and perform event
    reconstruction, potentially within large swaths of digital evidence.

  3. Comparative Studies of Programming Languages; Course Lecture Notes.

    Authors: Joey Paquet, Serguei A. Mokhov
    Subjects: Programming Languages
    Abstract

    Lecture notes for the Comparative Studies of Programming Languages course,
    COMP6411, taught at the Department of Computer Science and Software
    Engineering, Faculty of Engineering and Computer Science, Concordia University,
    Montreal, QC, Canada. These notes include a compiled book of primarily related
    articles from the Wikipedia, the Free Encyclopedia, as well as Comparative
    Programming Languages book and other resources, including our own. The original
    notes were compiled by Dr. Paquet.

  4. Complete Context Calculus Design and Implementation in GIPSY.

    Authors: Joey Paquet, Serguei A. Mokhov, Xin Tong
    Subjects: Formal Languages and Automata Theory
    Abstract

    This paper presents the integration into the GIPSY of Lucx's context calculus
    defined in Wan's PhD thesis. We start by defining different types of tag sets,
    then we explain the concept of context, the types of context and the context
    calculus operators. Finally, we present how context entities have been
    abstracted into Java classes and embedded into the GIPSY system.

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

    Authors: Joey Paquet, Serguei A. Mokhov
    Subjects: Logic in Computer Science
    Abstract

    We describe a type system for a platform called the General Intensional
    Programming System (GIPSY), designed to support intensional programming
    languages built upon intensional logic and their imperative counter-parts for
    the intensional execution model. In GIPSY, the type system glues the static and
    dynamic typing between intensional and imperative languages in its compiler and
    run-time environments to support the intensional evaluation of expressions
    written in various dialects of the intensional programming language Lucid.

  6. Object-Oriented Intensional Programming: Intensional Classes Using Java and Lucid.

    Authors: Aihua Wu, Joey Paquet, Serguei A. Mokhov
    Subjects: Programming Languages
    Abstract

    This article introduces Object-Oriented Intensional Programming (OO-IP), a
    new hybrid language between Object-Oriented and Intensional Programming
    Languages in the sense of the latest evolutions of Lucid.

Syndicate content