SL-COMP aims at bringing together researchers interested on improving the state of the art of the automated deduction methods for Separation Logic (SL). The event took place twice until now and collected more than 1K problems for different fragments of SL. The input format of problems is based on the SMT-LIB format and therefore fully typed; only one new command is added to SMT-LIB’s list, the command for the declaration of the heap’s type. The SMT-LIB theory of SL comes with ten logics, some of them being combinations of SL with linear arithmetics. The competition’s divisions are defined by the logic fragment, the kind of decision problem (satisfiability or entailment) and the presence of quantifiers. Until now, SL-COMP has been run on the StarExec platform, where the benchmark set and the binaries of participant solvers are freely available. The benchmark set is also available with the competition’s documentation on a public repository in GitHub.

In this paper we develop a cyclic proof system for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions are quantifier-free formulae of first order logic. The proof system consists of a small set of inference rules, inspired by a top-down language inclusion algorithm for tree automata [9]. We show the proof system to be sound, in general, and complete, under certain semantic restrictions involving the set of constraints in the inductive system. Moreover, we investigate the computational complexity of checking these restrictions, when the function symbols in the logic are given the canonical Herbrand interpretation.

We present a multimedia retrieval system framework that incorporates components for processing multimedia content in different modes and languages. The framework provides concept-based information retrieval facilities that applies credibility information for result re-ranking. The architecture combines both a direct user interface and a batched evaluation interface for reproducible research in multimedia IR. The demo presents a preliminary version of the system framework and shows a use case based on the ImageCLEF 2011 Wikipedia test collection.

Technological advancements have made it possible to use information associated with a mobile's location to form new computing and services. One concern with these emerging location-based services (LBS) is their ability to provide security while remaining reliable and accurate. In this paper, we focus on securing Mobile Location-based Services (MLBS), where certain goods or services are provided by mobile vendors to a clientele based on the proximity of vendors to potential customers. We identify different attacks and misuse faced by MLBS, and show that position verification is a critical step in providing a secure and trustworthy MLBS. To provide position verification, we propose a scheme called Key Distribution-based Position Verification (KEPI), which takes advantage of an auxiliary network of transponders to facilitate trustworthy location-based services. We derive an analytical model to evaluate our approach and our simulation results provide useful insights about how auxiliary networks can help provide trustworthy mobile services.

This panel highlights a selection of the most interesting and provocative papers from the 2002 New Security Paradigms Workshop. This workshop was held September 2002 - the URL for more information is . The panel consists of authors of the selected papers, and the session is moderated by the workshop’s general chairs. We present selected papers focusing on exciting major themes that emerged from the workshop. These are the papers that will provoke the most interesting discussion at ACSAC.

Article Run-time security evaluation: can we afford it? Share on Authors: Cristina Serban Bell Laboratories, Lucent Technologies, Murray Hill, NJ Bell Laboratories, Lucent Technologies, Murray Hill, NJView Profile , Bruce McMillin Dept. of Computer Science, University of Missouri-Rolla, Rolla, MO Dept. of Computer Science, University of Missouri-Rolla, Rolla, MOView Profile Authors Info & Claims NSPW '96: Proceedings of the 1996 workshop on New security paradigmsSeptember 1996 Pages 68–72https://doi.org/10.1145/304851.304868Published:17 September 1996 0citation244DownloadsMetricsTotal Citations0Total Downloads244Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Formal security specifications for a distributed application can be checked for compliance at run-time using executable security assertions. We propose the run-time security evaluation (RTSE) method which makes use of histories/traces of events, assertions and operational evaluation in the distributed environment to ensure the security specifications for the application are fulfilled at run-time. A model problem is used to aid in developing the security requirements formally.