Dampak Pelatihan Manajemen Kreatif Industri Peci Menuju Sentra Peci Di Desa Langonsari Kecamatan Pameungpeuk Kabupaten Bandung

This study aims to determine the impact of the Peci industry's creative management training towards the Peci center in Langonsari Village, Pameungpeuk District, Bandung Regency specifically in the field of creative economy management. The study was conducted for 6 months in Langonsari Village, Pameungpeuk, Bandung. Data collection techniques using interviews, documentation, and observation with research subjects, namely the Village Head, BUMDES Manager, Mitra Peci Harmoni and some Desa Langonsari users of BUMDES services. In order to guarantee the validity of the data, researchers used source triangulation techniques. Data analysis in this study uses an interactive analysis model that is analysis using data reduction, data display, and verification and conclusions, the results of this study indicate that the creative management training for the peci industry to the peci center has succeeded in having a positive impact on improving the economy of the community. &nbsp

Model Checking a Byzantine-Fault-Tolerant Self-Stabilizing Protocol for Distributed Clock Synchronization Systems

This report presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tolerant self-stabilizing protocol for distributed clock synchronization systems. This protocol does not rely on any assumptions about the initial state of the system. This protocol tolerates bursts of transient failures, and deterministically converges within a time bound that is a linear function of the self-stabilization period. A simplified model of the protocol is verified using the Symbolic Model Verifier (SMV) [SMV]. The system under study consists of 4 nodes, where at most one of the nodes is assumed to be Byzantine faulty. The model checking effort is focused on verifying correctness of the simplified model of the protocol in the presence of a permanent Byzantine fault as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period. Although model checking results of the simplified model of the protocol confirm the theoretical predictions, these results do not necessarily confirm that the protocol solves the general case of this problem. Modeling challenges of the protocol and the system are addressed. A number of abstractions are utilized in order to reduce the state space. Also, additional innovative state space reduction techniques are introduced that can be used in future verification efforts applied to this and other protocols

STRATEGIES FOR MANAGING SCHOOL OPERATIONAL ASSISTANCE FUNDS IN OVERCOMING COMMUNICATION DISTORTIONS IN FINANCING AT SENIOR HIGH SCHOOL 3 PRABUMULIH

This study aims to analyze the Strategy for Managing School Operational Assistance Funds (BOS) by the Principal in Overcoming Distortions in Financing Communication at Prabumulih State Senior High School 3, South Sumatra Province. This research is a qualitative research, In collecting data, researchers used several collection techniques, namely, in-depth interviews, observation, and documentation. The data analysis technique uses the Miles and Huberman Model which consists of three stages, namely: data reduction, data display, and drawing conclusions or verification. Based on the results of the research in this study, in order for the implementation of the financing of the School Operational Assistance Fund (BOS) in overcoming the distortion of financing communication, several aspects need to be carried out, including; aspects of flexibility in the use of BOS funds, aspects of effectiveness in the use of BOS funds, aspects of efficiency in the use of BOS funds, aspects of accountability in the use of BOS funds and aspects of transparency of BOS funds

Software components and formal methods from a computational viewpoint

Software components and the methodology of component-based development offer a promising approach to master the design complexity of huge software products because they separate the concerns of software architecture from individual component behavior and allow for reusability of components. In combination with formal methods, the specification of a formal component model of the later software product or system allows for establishing and verifying important system properties in an automatic and convenient way, which positively contributes to the overall correctness of the system. Here, we study such a combined approach. As similar approaches, we also face the so-called state space explosion problem which makes property verification computationally hard. In order to cope with this problem, we derive techniques that are guaranteed to work in polynomial time in the size of the specification of the system under analysis, i.e., we put an emphasis on the computational viewpoint of verification. As a consequence, we consider interesting subclasses of component-based systems that are amenable to such analysis. We are particularly interested in ideas that exploit the compositionality of the component model and refrain from understanding a system as a monolithic block. The assumptions that accompany the set of systems that are verifiable with our techniques can be interpreted as general design rules that forbid to build systems at will in order to gain efficient verification techniques. The compositional nature of software components thereby offers development strategies that lead to systems that are correct by construction. Moreover, this nature also facilitates compositional reduction techniques that allow to reduce a given model to the core that is relevant for verification. We consider properties specified in Computation Tree Logic and put an emphasis on the property of deadlock-freedom. We use the framework of interaction systems as the formal component model, but our results carry over to other formal models for component-based development. We include several examples and evaluate some ideas with respect to experiments with a prototype implementation

Platform Dependent Verification: On Engineering Verification Tools for 21st Century

The paper overviews recent developments in platform-dependent explicit-state LTL model checking.Comment: In Proceedings PDMC 2011, arXiv:1111.006

Using Graph Transformations and Graph Abstractions for Software Verification

In this paper we describe our intended approach for the verification of software written in imperative programming languages. We base our approach on model checking of graph transition systems, where each state is a graph and the transitions are specified by graph transformation rules. We believe that graph transformation is a very suitable technique to model the execution semantics of languages with dynamic memory allocation. Furthermore, such representation allows us to investigate the use of graph abstractions, which can mitigate the combinatorial explosion inherent to model checking. In addition to presenting our planned approach, we reason about its feasibility, and, by providing a brief comparison to other existing methods, we highlight the benefits and drawbacks that are expected

State space c-reductions for concurrent systems in rewriting logic

We present c-reductions, a state space reduction technique. The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system. This is done by means of a canonizer function, which maps each state into a (non necessarily unique) canonical representative of its equivalence class. The approach exploits the expressiveness of rewriting logic and its realization in Maude to enjoy several advantages over similar approaches: exibility and simplicity in the definition of the reductions (supporting not only traditional symmetry reductions, but also name reuse and name abstraction); reasoning support for checking and proving correctness of the reductions; and automatization of the reduction infrastructure via Maude's meta-programming features. The approach has been validated over a set of representative case studies, exhibiting comparable results with respect to other tools