Christelle Scharff | Pace University (original) (raw)

Uploads

Papers by Christelle Scharff

Springer eBooks, Sep 11, 2007

ABSTRACT We consider the problem of efficiently building extended canonizers, which are capable o... more ABSTRACT We consider the problem of efficiently building extended canonizers, which are capable of solving the uniform word problem for some first-order theories. These reasoning artifacts have been introduced in previous work to solve the lack of modularity of Shostak combination schema while retaining its efficiency. It is known that extended canonizers can be modularly combined to solve the uniform word problem in unions of theories. Unfortunately, little is known about efficiently implementing such canonizers for component theories, especially those of interest for verification like, e.g., those of uninterpreted function symbols or lists. In this paper, we investigate this problem by adapting and combining work on rewriting-based decision procedures for satisfiability in first-order theories and SER graphs, a graph-based method defined for abstract congruence closure. Our goal is to build graph-based extended canonizers for theories which are relevant for verification. Based on graphs our approach addresses implementation issues that were lacking in previous rewriting-based decision procedure approaches and which are important to argue the viability of extended canonizers.

Lecture Notes in Computer Science, 2004

ABSTRACT We present a graph-based method for constructing a congruence closure of a given set of ... more ABSTRACT We present a graph-based method for constructing a congruence closure of a given set of ground equalities that combines the key ideas of two well-known approaches, completion and abstract congruence closure, in a natural way by relying on a specialized and optimized version of the more general, but less efficient, SOUR graphs. This approach allows for efficient implementations and a visual presentation that better illuminates the basic ideas underlying the construction of congruence closures and clarifies the role of original and extended signatures and the impact of rewrite techniques for ordering equalities.

Lecture Notes in Computer Science, 1996

We present a concurrent Completion procedure based on the use of a SOUR graph as data structure. ... more We present a concurrent Completion procedure based on the use of a SOUR graph as data structure. The procedure has the following characteristics. It is asynchronous, there is no need for a global memory or global control, equations are stored in a SOUR graph with maximal structure sharing, and each vertex is a process, representing a term. Therefore, the parallelism

Proceedings of the 7th Annual Symposium on Computing for Development

In the university setting, global software development (GSD) projects involve teams of students d... more In the university setting, global software development (GSD) projects involve teams of students distributed across several countries and working collaboratively on the development of software artifacts and software. Students are confronted with issues related to distance, time and culture. In 2014, students from the State University of Zanzibar in Tanzania and Pace University in the US united in the annual GSD project to develop mobile apps targeting the Tanzanian context. In this paper, we focus on the roles and experience with GSD of Tanzanian students. We describe their motivations for participating, the challenges they encountered, and what they learned. We explore how GSD can be used to speed up skills acquisition for both entrepreneurs and IT professionals in developing countries. The results we present are useful for academic institutions, tech hubs and capacity building organizations.

Journal of Computing Sciences in Colleges, 2008

ABSTRACT The term &#39;mobile instructional laboratory&#39; refers to using mobil... more ABSTRACT The term &#39;mobile instructional laboratory&#39; refers to using mobile computing devices such as notebooks for transforming a classroom into a lab setting with the goal of enhancing the practical experience, interaction and understanding. A major goal in all the computing disciplines is to provide students with hands on activities that will enhance their learning of concepts and their professional experience. As such, CS and IT programs require investments in dedicated laboratories that will support applied activities for most of the courses. Unfortunately, space and other resource limitations usually do not allow for permanent creation of such labs. In parallel, current educational philosophy suggests that increased student-student and student-faculty interaction and active learning in the classroom are helpful in increasing students&#39; understanding of the topics. Consequently instructors are employing techniques that facilitate the interaction and self discovery and rely on technology for support. In both cases, mobile instructional laboratories are a valuable solution.

Critical Mobile Pedagogy, 2020

International Journal of Information Management, 2021

Journal of Curriculum and Teaching, 2021

The Billion Oyster Project and Curriculum and Community Enterprise for the Restoration of New Yor... more The Billion Oyster Project and Curriculum and Community Enterprise for the Restoration of New York Harbor with New York City Public Schools (BOP-CCERS) program is a National Science Foundation (NSF) supported initiative and collaboration of multiple institutions and organizations led by Pace University. The NSF project, Innovative Technology Experiences for Students and Teachers (ITEST), had generated a large amount of data through engagement with teachers and students throughout New York City public schools. One purpose of this project is to engage with middle and high school science teachers to assist them in using project-based learning and real-world data collection in their classrooms with their students through harbor restoration initiatives. It was found that Underrepresented Minority (URM) students reported having higher levels of interest in STEM and science than did the non-URM students. While this is a success, it was found that the URM students had lower expectations for...

EAI Endorsed Transactions on Collaborative Computing, Jun 30, 2017

Proceedings of the 8th International Conference on Agents and Artificial Intelligence, 2016

Procedia Engineering, 2015

32nd Annual Frontiers in Education

Lecture Notes in Computer Science

ABSTRACT Data Mining, as defined in 1996 by Piatetsky-Shapiro ([1]) is a step (crucial, but a ste... more ABSTRACT Data Mining, as defined in 1996 by Piatetsky-Shapiro ([1]) is a step (crucial, but a step nevertheless) in a KDD (Knowledge Discovery in Data Bases) process. The Piatetsky-Shapiro’s definition states that the KDD process consists of the following steps: developing an understanding of the application domain, creating a target data set, choosing the data mining task i.e. deciding whether the goal of the KDD process is classification, regression, clustering, etc..., choosing the data mining algorithm(s), data preprocessing, data mining (DM), interpreting mined patterns, deciding if a re-iteration is needed, and consolidating discovered knowledge.

Proceedings of the 2011 Community Building Workshop on Collaborative Teaching of Globally Distributed Software Development, 2011

... http://atlantis.seidenberg.pace.edu/wiki/gsd2010\. (Last accessed in March 2011). 4. ... Envir... more ... http://atlantis.seidenberg.pace.edu/wiki/gsd2010. (Last accessed in March 2011). 4. ... Environment". Proc. of the 23rd IEEE International Conference on Software Engineering (ICSE 2001), Toronto, Ontario, Canada, May 12-19, 2001. 13. ...