7,662 research outputs found
Applying Algebraic Specifications on Digital Right Management Systems
Digital Right Management (DRM) Systems have been created to meet the need for
digital content protection and distribution. In this paper we present some of
the directions of our ongoing research to apply algebraic specification
techniques on mobile DRM systems.Comment: 6 page
Modeling and Analyzing Adaptive User-Centric Systems in Real-Time Maude
Pervasive user-centric applications are systems which are meant to sense the
presence, mood, and intentions of users in order to optimize user comfort and
performance. Building such applications requires not only state-of-the art
techniques from artificial intelligence but also sound software engineering
methods for facilitating modular design, runtime adaptation and verification of
critical system requirements.
In this paper we focus on high-level design and analysis, and use the
algebraic rewriting language Real-Time Maude for specifying applications in a
real-time setting. We propose a generic component-based approach for modeling
pervasive user-centric systems and we show how to analyze and prove crucial
properties of the system architecture through model checking and simulation.
For proving time-dependent properties we use Metric Temporal Logic (MTL) and
present analysis algorithms for model checking two subclasses of MTL formulas:
time-bounded response and time-bounded safety MTL formulas. The underlying idea
is to extend the Real-Time Maude model with suitable clocks, to transform the
MTL formulas into LTL formulas over the extended specification, and then to use
the LTL model checker of Maude. It is shown that these analyses are sound and
complete for maximal time sampling. The approach is illustrated by a simple
adaptive advertising scenario in which an adaptive advertisement display can
react to actions of the users in front of the display.Comment: In Proceedings RTRTS 2010, arXiv:1009.398
Workshop on Verification and Theorem Proving for Continuous Systems (NetCA Workshop 2005)
Oxford, UK, 26 August 200
Automated Generation of Geometric Theorems from Images of Diagrams
We propose an approach to generate geometric theorems from electronic images
of diagrams automatically. The approach makes use of techniques of Hough
transform to recognize geometric objects and their labels and of numeric
verification to mine basic geometric relations. Candidate propositions are
generated from the retrieved information by using six strategies and geometric
theorems are obtained from the candidates via algebraic computation.
Experiments with a preliminary implementation illustrate the effectiveness and
efficiency of the proposed approach for generating nontrivial theorems from
images of diagrams. This work demonstrates the feasibility of automated
discovery of profound geometric knowledge from simple image data and has
potential applications in geometric knowledge management and education.Comment: 31 pages. Submitted to Annals of Mathematics and Artificial
Intelligence (special issue on Geometric Reasoning
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. The lack of formalization of the Internet architecture meant limited
abstractions and modularity, especially for the control and management planes,
thus requiring for every new need a new protocol built from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
A Scalable Module System
Symbolic and logic computation systems ranging from computer algebra systems
to theorem provers are finding their way into science, technology, mathematics
and engineering. But such systems rely on explicitly or implicitly represented
mathematical knowledge that needs to be managed to use such systems
effectively.
While mathematical knowledge management (MKM) "in the small" is well-studied,
scaling up to large, highly interconnected corpora remains difficult. We hold
that in order to realize MKM "in the large", we need representation languages
and software architectures that are designed systematically with large-scale
processing in mind.
Therefore, we have designed and implemented the MMT language -- a module
system for mathematical theories. MMT is designed as the simplest possible
language that combines a module system, a foundationally uncommitted formal
semantics, and web-scalable implementations. Due to a careful choice of
representational primitives, MMT allows us to integrate existing representation
languages for formal mathematical knowledge in a simple, scalable formalism. In
particular, MMT abstracts from the underlying mathematical and logical
foundations so that it can serve as a standardized representation format for a
formal digital library. Moreover, MMT systematically separates logic-dependent
and logic-independent concerns so that it can serve as an interface layer
between computation systems and MKM systems.Comment: This is a preprint of the main paper on the MMT languag
A systematic literature review on process model testing: Approaches, challenges, and research directions
Testing is a key concern when developing process-oriented solutions as it
supports modeling experts who have to deal with increasingly complex models and
scenarios such as cross-organizational processes. However, the complexity of
the research landscape and the diverse set of approaches and goals impedes the
analysis and advancement of research and the identification of promising
research areas, challenges, and research directions. Hence, a systematic
literature review is conducted to identify interesting areas for future
research and to provide an overview of existing work. Over 6300 potentially
matching publications were determined during the search (literature databases,
selected conferences\journals, and snowballing). Finally, 153 publications from
2002 to 2013 were selected, analyzed, and classified. It was found that the
software engineering domain has influenced process model testing approaches
(e.g., regarding terminology and concepts), but recent publications are
presenting independent approaches. Additionally, historical data sources are
not exploited to their full potential and current testing related publications
frequently contain evaluations of relatively weak quality. Overall, the
publication landscape is unevenly distributed so that over 31 publications
concentrate on test-case generation but only 4 publications conduct performance
test. Hence, the full potential of such insufficiently covered testing areas is
not exploited. This systematic review provides a comprehensive overview of the
interdisciplinary topic of process model testing. Several open research
questions are identified, for example, how to apply testing to
cross-organizational or legacy processes and how to adequately include users
into the testing methods
Stochastic Testing Method for Transistor-Level Uncertainty Quantification Based on Generalized Polynomial Chaos
Uncertainties have become a major concern in integrated circuit design. In
order to avoid the huge number of repeated simulations in conventional Monte
Carlo flows, this paper presents an intrusive spectral simulator for
statistical circuit analysis. Our simulator employs the recently developed
generalized polynomial chaos expansion to perform uncertainty quantification of
nonlinear transistor circuits with both Gaussian and non-Gaussian random
parameters. We modify the nonintrusive stochastic collocation (SC) method and
develop an intrusive variant called stochastic testing (ST) method to
accelerate the numerical simulation. Compared with the stochastic Galerkin (SG)
method, the resulting coupled deterministic equations from our proposed ST
method can be solved in a decoupled manner at each time point. At the same
time, ST uses fewer samples and allows more flexible time step size controls
than directly using a nonintrusive SC solver. These two properties make ST more
efficient than SG and than existing SC methods, and more suitable for
time-domain circuit simulation. Simulation results of several digital, analog
and RF circuits are reported. Since our algorithm is based on generic
mathematical models, the proposed ST algorithm can be applied to many other
engineering problems.Comment: published by IEEE Trans CAD in Oct 201
AppLP: A Dialogue on Applications of Logic Programming
This document describes the contributions of the 2016 Applications of Logic
Programming Workshop (AppLP), which was held on October 17 and associated with
the International Conference on Logic Programming (ICLP) in Flushing, New York
City.Comment: David S. Warren and Yanhong A. Liu (Editors). 33 pages. Including
summaries by Christopher Kane and abstracts or position papers by M. Aref, J.
Rosenwald, I. Cervesato, E.S.L. Lam, M. Balduccini, J. Lobo, A. Russo, E.
Lupu, N. Leone, F. Ricca, G. Gupta, K. Marple, E. Salazar, Z. Chen, A. Sobhi,
S. Srirangapalli, C.R. Ramakrishnan, N. Bj{\o}rner, N.P. Lopes, A.
Rybalchenko, and P. Tara
- …