Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Evan Sultanik

dblp:64/1902 · also Evan A. Sultanik · DBLP profile ↗
← Back
16ranked-venue papers
10as first author
1since 2021 · last 2024
0000-0002-6246-1422ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 13 · 9 first-authorGraphics, computer vision, multimedia, augmented reality and games · 10 · 6 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 2Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program analysis · 100%
Artificial intelligence
6 papers
Multi-agent systems · 70% Planning, search and constraint satisfaction · 30%
Computer architecture, parallel and distributed computing, and storage systems
4 papers
Distributed systems · 81% Cloud and datacenter computing · 19%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Smart cities and intelligent transportation · 100%

Topics — the 15 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
dynamic analysis
0.812024
PolyTracker: Whole-Input Dynamic Information Flow Tracing · ISSTA 2024
Program analysis › dynamic analysis
dynamic information-flow tracking
0.812024
PolyTracker: Whole-Input Dynamic Information Flow Tracing · ISSTA 2024
Program analysis › static analysis
bug detection
0.212024
PolyTracker: Whole-Input Dynamic Information Flow Tracing · ISSTA 2024
Knowledge, reasoning and agents › Multi-agent systems
distributed constraint optimization
0.222008
Dynamic Distributed Constraint Reasoning · AAAI 2008
On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem · IJCAI 2007
Distributed systems
peer-to-peer systems
0.122005
Stable Service Placement on Dynamic Peer-to-Peer Networks: A Heuristic for the Distributed k-Center Problem · AAAI 2005
Mobile Agent-Based Search for Service Discovery on Dynamic Peer-to-Peer Networks · AAAI 2004
Human-robot interaction
human-robot collaboration
0.112008
Human-Robot Collaboration for Remote Surveillance · AAAI 2008
Wireless networking
wireless testbed
0.112005
The AI Technologies of the Philadelphia Area Urban Wireless Network Testbed · AAAI 2005
Cloud and datacenter computing › cloud service management
service placement
0.112005
Stable Service Placement on Dynamic Peer-to-Peer Networks: A Heuristic for the Distributed k-Center Problem · AAAI 2005
Knowledge, reasoning and agents › Multi-agent systems › autonomous agents
mobile agents
0.012004
Mobile Agent-Based Search for Service Discovery on Dynamic Peer-to-Peer Networks · AAAI 2004
Distributed systems › distributed coordination
multi-agent systems
0.012004
Intelligent Systems Demonstration: The Secure Wireless Agent Testbed (SWAT) · AAAI 2004
Distributed systems › service-oriented architecture
service discovery
0.012004
Mobile Agent-Based Search for Service Discovery on Dynamic Peer-to-Peer Networks · AAAI 2004
Distributed systems
dynamic network
0.022005
Heuristics for Agent Routing and Itinerary Optimization on Dynamic Networks · AAAI 2005
Mobile Agent-Based Search for Service Discovery on Dynamic Peer-to-Peer Networks · AAAI 2004
Smart cities and intelligent transportation
surveillance
0.012008
Human-Robot Collaboration for Remote Surveillance · AAAI 2008
Internet of things and sensor networks › wireless sensor network
sensor deployment
0.012005
The AI Technologies of the Philadelphia Area Urban Wireless Network Testbed · AAAI 2005
Wireless networking › wireless security
secure wireless communication
0.012004
Intelligent Systems Demonstration: The Secure Wireless Agent Testbed (SWAT) · AAAI 2004

Methods — techniques the papers use, named apart from their topics

fuzzing · 0.8LLVM instrumentation · 0.8human-robot collaboration · 0.2testbed experimentation · 0.1heuristic search · 0.1heuristic · 0.1distributed k-center · 0.1dynamic reconfiguration · 0.1wireless networking · 0.1mobile agent-based search · 0.1agent-based simulation · 0.1distributed constraint optimization · 0.1
YearPublicationVenuePosition
2024 PolyTracker: Whole-Input Dynamic Information Flow Tracing
abstract
We present PolyTracker, a whole-program, whole-input dynamic information flow tracing (DIFT) framework. Given an LLVM compatible codebase or a binary that has been lifted to LLVM intermediate representation (IR), PolyTracker compiles it, adding static instrumentation. The instrumented program will run normally with modest performance overhead, but will additionally output a runtime trace artifact in the co-designed TDAG (Tainted Directed Acyclic Graph) format. TDAGs can be post-processed for a variety of analyses, including tracing every input byte through program execution. TDAGs can be generated either by running the program over a corpus of inputs or by employing a randomized input generator such as a fuzzer. PolyTracker traces (TDAGs) are useful not only for very localized, targeted dynamic program analysis as with smaller-scale DIFT: TDAGs are primarily intended for whole-program runtime exploration and bug finding, granular information-flow diffing between program runs, and comparisons of implementations of the same input specification without any need to emulate and instrument the entire running environment. For user-friendliness and reproducibility, the software repository provides a number of examples of PolyTracker-instrumented builds of popular open-source software projects. We also provide an analysis library and REPL written in Python that are designed to assist users with operating over TDAGs.
Evan Sultanik, Marek Surovic, Henrik Brodin, Kelly Kaoudis, Facundo Tuesca, Carson Harmon, Lisa Overall, Joseph Sweeney, Bradford Larsen
ISSTA1
2014 Development and Specification of a Reference Architecture for Agent-Based Systems
abstract
The recent growth of agent-based software systems was achieved without the development of a reference architecture. From a software engineering standpoint, a reference architecture is necessary to compare, evaluate, and integrate past, current, and future agent-based software systems. The agent systems reference architecture (ASRA) advances the agent-based system development process by providing a set of key interaction patterns for functional areas that exist between the layers and protocols of agent-based systems. Furthermore, the ASRA identifies the points for interoperability between agent-based systems and increases the level of discussion when referring to agent-based systems. This paper presents methodology, grounded in software forensics, to develop the ASRA and provides an overview of the resulting architectural representation. The methodology uses an approach based on software engineering techniques adapted to study agent frameworks-the libraries and tools for building agent systems. The resulting ASRA can serve as an abstract representation of the components necessary for facilitating comparison, integration, and interoperation of software systems composed of agents.
William C. Regli, Israel Mayk, Christopher T. Cannon, Joseph B. Kopena, Robert N. Lass, William M. Mongan, Duc N. Nguyen, Jeff K. Salvage, Evan Sultanik, Kyle Usbeck
IEEE Trans. Syst. Man Cybern. Syst.9
2009 Dynamic Configuration of Agent Organizations
Evan Sultanik, Robert N. Lass, William C. Regli
IJCAI1
2009 Development and Specification of a Reference Model for Agent-Based Systems
abstract
Agent-based systems have been the object of intense research over the past decade. While great theoretical progress has been made, the software frameworks for creating agent-based systems offer considerable variability in their capabilities and functionality. This paper introduces a reference model for agent-based systems. The purpose of a reference model is to provide a common conceptual basis for comparing systems and driving the development of software architectures and other standards. The Foundation for Intelligent Physical Agents and other groups have advanced a number of agent standards, yet, to date, no comprehensive reference model has been presented for software systems composed of agents. This paper provides an overview of a reference model for agent-based systems. The agent systems reference model is the result of a multiyear effort studying software systems built with agents and software frameworks for implementing these systems. As part of this study, the team applied software reverse engineering techniques to perform static and dynamic analysis of operational agent-based systems. This analysis enabled identification of key common concepts across over one dozen different agent frameworks. To demonstrate its applicability, the reference model is then used to analyze a number of complete agent-based software systems. It is the belief of the authors that the reference model will be an essential prerequisite for future transition, deployment, and integration of agent-based systems.
William C. Regli, Israel Mayk, Christopher Dugan, Joseph B. Kopena, Robert N. Lass, Pragnesh Jay Modi, William M. Mongan, Jeff K. Salvage, Evan Sultanik
IEEE Trans. Syst. Man Cybern. Part C9
2008 Dynamic Distributed Constraint Reasoning
Robert N. Lass, Evan Sultanik, William C. Regli
AAAI2
2008 Human-Robot Collaboration for Remote Surveillance
Evan Sultanik, Ilya Braude, Peter Thai, Robert N. Lass, Duc N. Nguyen, Joseph B. Kopena, William C. Regli, Sean A. Lisse, Steven N. Furtwangler, Alan J. Vayda
AAAI1
2007 Disaster Evacuation Support
Christopher J. Carpenter, Christopher Dugan, Joseph B. Kopena, Robert N. Lass, Gaurav Naik, Duc N. Nguyen, Evan Sultanik, Pragnesh Jay Modi, William C. Regli
AAAI7
2007 On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem
Evan Sultanik, Pragnesh Jay Modi, William C. Regli
IJCAI1
2006 Constraint Propagation for Domain Bounding in Distributed Task Scheduling
Evan Sultanik, Pragnesh Jay Modi, William C. Regli
CP1
2005 The AI Technologies of the Philadelphia Area Urban Wireless Network Testbed
Gustave Anderson, Andrew Burnheimer, Vincent A. Cicirello, David J. Dorsey, Christopher Dugan, Iris Howley, Moshe Kam, Joseph B. Kopena, Robert N. Lass, Kris Malfettone, Andrew Mroczkowski, Gaurav Naik, Maxim Peysakhov, Brian Pyles, William C. Regli, Evan Sultanik, James Thiel, Kyle Usbeck, Dan Venutolo, Marc Winners
AAAI16
2005 Heuristics for Agent Routing and Itinerary Optimization on Dynamic Networks
Evan Sultanik
AAAI1
2005 Stable Service Placement on Dynamic Peer-to-Peer Networks: A Heuristic for the Distributed k-Center Problem
Evan Sultanik, William C. Regli
AAAI1
2005 Agent Transport Simulation for Dynamic Peer-to-Peer Networks
Evan Sultanik, Maxim Peysakhov, William C. Regli
MABS1
2004 Intelligent Systems Demonstration: The Secure Wireless Agent Testbed (SWAT)
Gustave Anderson, Andrew Burnheimer, Vincent A. Cicirello, David J. Dorsey, Saturnino Garcia, Moshe Kam, Joseph B. Kopena, Kris Malfettone, Andrew Mroczkowski, Gaurav Naik, Maxim Peysakhov, William C. Regli, Joshua Shaffer, Evan Sultanik, Kenneth Tsang, Leonardo F. Urbano, Kyle Usbeck, Jacob Warren
AAAI14
2004 Mobile Agent-Based Search for Service Discovery on Dynamic Peer-to-Peer Networks
Evan Sultanik
AAAI1
2003 Secure Mobile Agents on Ad Hoc Wireless Networks
Evan Sultanik, Donovan Artz, Gustave Anderson, Moshe Kam, William C. Regli, Maxim Peysakhov, Jonathan Sevy, Nadya Belov, Nicholas Morizio, Andrew Mroczkowski
IAAI1