Abstract: Verification of real-time software systems can be
expensive in terms of time and resources. Testing is the main method
of proving correctness but has been shown to be a long and time
consuming process. Everyday engineers are usually unwilling to
adopt formal approaches to correctness because of the overhead
associated with developing their knowledge of such techniques.
Performance modelling techniques allow systems to be evaluated
with respect to timing constraints. This paper describes PARTES, a
framework which guides the extraction of performance models from
programs written in an annotated subset of C.
Abstract: In mobile environments, unspecified numbers of transactions
arrive in continuous streams. To prove correctness of their
concurrent execution a method of modelling an infinite number of
transactions is needed. Standard database techniques model fixed
finite schedules of transactions. Lately, techniques based on temporal
logic have been proposed as suitable for modelling infinite schedules.
The drawback of these techniques is that proving the basic
serializability correctness condition is impractical, as encoding (the
absence of) conflict cyclicity within large sets of transactions results
in prohibitively large temporal logic formulae. In this paper, we show
that, under certain common assumptions on the graph structure of
data items accessed by the transactions, conflict cyclicity need only
be checked within all possible pairs of transactions. This results in
formulae of considerably reduced size in any temporal-logic-based
approach to proving serializability, and scales to arbitrary numbers
of transactions.
Abstract: This article attempts to analyze functionally graded beam thermal buckling along with piezoelectric layers applying based on the third order shearing deformation theory considering various boundary conditions. The beam properties are assumed to vary continuously from the lower surface to the upper surface of the beam. The equilibrium equations are derived using the total potential energy equations, Euler equations, piezoelectric material constitutive equations and third order shear deformation theory assumptions. In order to fulfill such an aim, at first functionally graded beam with piezoelectric layers applying the third order shearing deformation theory along with clamped -clamped boundary conditions are thoroughly analyzed, and then following making sure of the correctness of all the equations, the very same beam is analyzed with piezoelectric layers through simply-simply and simply-clamped boundary conditions. In this article buckling critical temperature for functionally graded beam is derived in two different ways, without piezoelectric layer and with piezoelectric layer and the results are compared together. Finally, all the conclusions obtained will be compared and contrasted with the same samples in the same and distinguished conditions through tables and charts. It would be noteworthy that in this article, the software MAPLE has been applied in order to do the numeral calculations.
Abstract: There are lots of different ways to find the natural
frequencies of a rotating system. One of the most effective methods
which is used because of its precision and correctness is the
application of the transfer matrix. By use of this method the entire
continuous system is subdivided and the corresponding differential
equation can be stated in matrix form. So to analyze shaft that is this
paper issue the rotor is divided as several elements along the shaft
which each one has its own mass and moment of inertia, which this
work would create possibility of defining the named matrix. By
Choosing more elements number, the size of matrix would become
larger and as a result more accurate answers would be earned. In this
paper the dynamics of a rotor-bearing system is analyzed,
considering the gyroscopic effect. To increase the accuracy of
modeling the thickness of the disk and bearings is also taken into
account which would cause more complicated matrix to be solved.
Entering these parameters to our modeling would change the results
completely that these differences are shown in the results. As said
upper, to define transfer matrix to reach the natural frequencies of
probed system, introducing some elements would be one of the
requirements. For the boundary condition of these elements, bearings
at the end of the shaft are modeled as equivalent spring and dampers
for the discretized system. Also, continuous model is used for the
shaft in the system. By above considerations and using transfer
matrix, exact results are taken from the calculations. Results Show
that, by increasing thickness of the bearing the amplitude of vibration
would decrease, but obviously the stiffness of the shaft and the
natural frequencies of the system would accompany growth.
Consequently it is easily understood that ignoring the influences of
bearing and disk thicknesses would results not real answers.
Abstract: In this article, a formal specification and verification of the Rabin public-key scheme in a formal proof system is presented. The idea is to use the two views of cryptographic verification: the computational approach relying on the vocabulary of probability theory and complexity theory and the formal approach based on ideas and techniques from logic and programming languages. A major objective of this article is the presentation of the first computer-proved implementation of the Rabin public-key scheme in Isabelle/HOL. Moreover, we explicate a (computer-proven) formalization of correctness as well as a computer verification of security properties using a straight-forward computation model in Isabelle/HOL. The analysis uses a given database to prove formal properties of our implemented functions with computer support. The main task in designing a practical formalization of correctness as well as efficient computer proofs of security properties is to cope with the complexity of cryptographic proving. We reduce this complexity by exploring a light-weight formalization that enables both appropriate formal definitions as well as efficient formal proofs. Consequently, we get reliable proofs with a minimal error rate augmenting the used database, what provides a formal basis for more computer proof constructions in this area.
Abstract: One major difficulty that faces developers of
concurrent and distributed software is analysis for concurrency based
faults like deadlocks. Petri nets are used extensively in the
verification of correctness of concurrent programs. ECATNets are a
category of algebraic Petri nets based on a sound combination of
algebraic abstract types and high-level Petri nets. ECATNets have
'sound' and 'complete' semantics because of their integration in
rewriting logic and its programming language Maude. Rewriting
logic is considered as one of very powerful logics in terms of
description, verification and programming of concurrent systems We
proposed previously a method for translating Ada-95 tasking
programs to ECATNets formalism (Ada-ECATNet) and we showed
that ECATNets formalism provides a more compact translation for
Ada programs compared to the other approaches based on simple
Petri nets or Colored Petri nets. We showed also previously how the
ECATNet formalism offers to Ada many validation and verification
tools like simulation, Model Checking, accessibility analysis and
static analysis. In this paper, we describe the implementation of our
translation of the Ada programs into ECATNets.
Abstract: The group mutual exclusion (GME) problem is an
interesting generalization of the mutual exclusion problem. Several
solutions of the GME problem have been proposed for message
passing distributed systems. However, none of these solutions is
suitable for real time distributed systems. In this paper, we propose a
token-based distributed algorithms for the GME problem in soft real
time distributed systems. The algorithm uses the concepts of priority
queue, dynamic request set and the process state. The algorithm uses
first come first serve approach in selecting the next session type
between the same priority levels and satisfies the concurrent
occupancy property. The algorithm allows all n processors to be
inside their CS provided they request for the same session. The
performance analysis and correctness proof of the algorithm has also
been included in the paper.
Abstract: There are many virtual payment systems available to
conduct micropayments. It is essential that the protocols satisfy the
highest standards of correctness. This paper examines the Netpay
Protocol [3], provide its formalization as automata model, and prove
two important correctness properties, namely absence of deadlock
and validity of an ecoin during the execution of the protocol. This
paper assumes a cooperative customer and will prove that the
protocol is executing according to its description.
Abstract: In this article we explore the application of a formal
proof system to verification problems in cryptography. Cryptographic
properties concerning correctness or security of some cryptographic
algorithms are of great interest. Beside some basic lemmata, we
explore an implementation of a complex function that is used in
cryptography. More precisely, we describe formal properties of this
implementation that we computer prove. We describe formalized
probability distributions (σ-algebras, probability spaces and conditional
probabilities). These are given in the formal language of the
formal proof system Isabelle/HOL. Moreover, we computer prove
Bayes- Formula. Besides, we describe an application of the presented
formalized probability distributions to cryptography. Furthermore,
this article shows that computer proofs of complex cryptographic
functions are possible by presenting an implementation of the Miller-
Rabin primality test that admits formal verification. Our achievements
are a step towards computer verification of cryptographic primitives.
They describe a basis for computer verification in cryptography.
Computer verification can be applied to further problems in cryptographic
research, if the corresponding basic mathematical knowledge
is available in a database.
Abstract: In recent past, the Unified Modeling Language (UML) has become the de facto industry standard for object-oriented modeling of the software systems. The syntax and semantics rich UML has encouraged industry to develop several supporting tools including those capable of generating deployable product (code) from the UML models. As a consequence, ensuring the correctness of the model/design has become challenging and extremely important task. In this paper, we present an approach for automatic verification of protocol model/design. As a case study, Session Initiation Protocol (SIP) design is verified for the property, “the CALLER will not converse with the CALLEE before the connection is established between them ". The SIP is modeled using UML statechart diagrams and the desired properties are expressed in temporal logic. Our prototype verifier “UML-SMV" is used to carry out the verification. We subjected an erroneous SIP model to the UML-SMV, the verifier could successfully detect the error (in 76.26ms) and generate the error trace.
Abstract: In this paper, we propose the pre-processor based on
the Evidence Supporting Measure of Similarity (ESMS) filter and also
propose the unified fusion approach (UFA) based on the general
fusion machine coupled with ESMS filter, which improve the
correctness and precision of information fusion in any fields of
application. Here we mainly apply the new approach to Simultaneous
Localization And Mapping (SLAM) of Pioneer II mobile robots. A
simulation experiment was performed, where an autonomous virtual
mobile robot with sonar sensors evolves in a virtual world map with
obstacles. By comparing the result of building map according to the
general fusion machine (here DSmT-based fusing machine and
PCR5-based conflict redistributor considereded) coupling with ESMS
filter and without ESMS filter, it shows the benefit of the selection of
the sources as a prerequisite for improvement of the information
fusion, and also testifies the superiority of the UFA in dealing with
SLAM.
Abstract: Data stream analysis is the process of computing
various summaries and derived values from large amounts of data
which are continuously generated at a rapid rate. The nature of a
stream does not allow a revisit on each data element. Furthermore,
data processing must be fast to produce timely analysis results. These
requirements impose constraints on the design of the algorithms to
balance correctness against timely responses. Several techniques
have been proposed over the past few years to address these
challenges. These techniques can be categorized as either dataoriented
or task-oriented. The data-oriented approach analyzes a
subset of data or a smaller transformed representation, whereas taskoriented
scheme solves the problem directly via approximation
techniques. We propose a hybrid approach to tackle the data stream
analysis problem. The data stream has been both statistically
transformed to a smaller size and computationally approximated its
characteristics. We adopt a Monte Carlo method in the approximation
step. The data reduction has been performed horizontally and
vertically through our EMR sampling method. The proposed method
is analyzed by a series of experiments. We apply our algorithm on
clustering and classification tasks to evaluate the utility of our
approach.
Abstract: The limit load carrying capacity of functionally
graded materials (FGM) circular plates subjected to an arbitrary
rotationally symmetric loading has been computed. It is provided that
the plate material behaves rigid perfectly plastic and obeys either the
Square or the Tresca yield criterion. To this end the upper and lower
bound principles of limit analysis are employed to determine the
exact value for the limiting load. The correctness of the result are
verified and finally limiting loads for two examples namely; through
radius and through thickness FGM circular plates with simply
supported edges are calculated, respectively and moreover, the values
of critical loading factor are determined.
Abstract: In this paper we analyze the application of a formal proof system to the discrete logarithm problem used in publickey cryptography. That means, we explore a computer verification of the ElGamal encryption scheme with the formal proof system Isabelle/HOL. More precisely, the functional correctness of this algorithm is formally verified with computer support. Besides, we present a formalization of the DSA signature scheme in the Isabelle/HOL system. We show that this scheme is correct what is a necessary condition for the usefulness of any cryptographic signature scheme.
Abstract: With the development of Internet and databases application techniques, the demand that lots of databases in the Internet are permitted to remote query and access for authorized users becomes common, and the problem that how to protect the copyright of relational databases arises. This paper simply introduces the knowledge of cloud model firstly, includes cloud generators and similar cloud. And then combined with the property of the cloud, a method of protecting relational databases copyright with cloud watermark is proposed according to the idea of digital watermark and the property of relational databases. Meanwhile, the corresponding watermark algorithms such as cloud watermark embedding algorithm and detection algorithm are proposed. Then, some experiments are run and the results are analyzed to validate the correctness and feasibility of the watermark scheme. In the end, the foreground of watermarking relational database and its research direction are prospected.
Abstract: Most of the concurrent transactional protocols consider
serializability as a correctness criterion of the transactions execution.
Usually, the proof of the serializability relies on mathematical proofs
for a fixed finite number of transactions. In this paper, we introduce
a protocol to deal with an infinite number of transactions which are
iterated infinitely often. We specify serializability of the transactions
and the protocol using a specification language based on temporal
logics. It is worthwhile using temporal logics such as LTL (Lineartime
Temporal Logic) to specify transactions, to gain full automatic
verification by using model checkers.
Abstract: Validation of an automation system is an important issue. The goal is to check if the system under investigation, modeled by a Petri net, never enters the undesired states. Usually, tools dedicated to Petri nets such as DESIGN/CPN are used to make reachability analysis. The biggest problem with this approach is that it is impossible to generate the full occurence graph of the system because it is too large. In this paper, we show how computational methods such as temporal logic model checking and Groebner bases can be used to verify the correctness of the design of an automation system. We report our experimental results with two automation systems: the Automated Guided Vehicle (AGV) system and the traffic light system. Validation of these two systems ranged from 10 to 30 seconds on a PC depending on the optimizing parameters.
Abstract: Thai language is difficult in all four language skills,
especially reading. The first year students may have different abilities
in reading, so a teacher is required to find out a student’s reading
level so that the teacher can help and support them till they can
develop and resolve each problem themselves. This research is aimed
to study the prosody problem among Thai students and will be
focused on first year Thai students in the second semester. A total of
58 students were involved in this study. Four obstacles were found:
1. Interpretation from what they read and write
2. Incorrectness Pronunciation of Prosody
3. Incorrectness in Rhythm of the Poem
4. Incorrectness of the Thai Poem Pronunciation
Abstract: This paper presents a method for the optimal
allocation of Distributed generation in distribution systems. In this
paper, our aim would be optimal distributed generation allocation for
voltage profile improvement and loss reduction in distribution
network. Genetic Algorithm (GA) was used as the solving tool,
which referring two determined aim; the problem is defined and
objective function is introduced. Considering to fitness values
sensitivity in genetic algorithm process, there is needed to apply load
flow for decision-making. Load flow algorithm is combined
appropriately with GA, till access to acceptable results of this
operation. We used MATPOWER package for load flow algorithm
and composed it with our Genetic Algorithm. The suggested method
is programmed under MATLAB software and applied ETAP
software for evaluating of results correctness. It was implemented on
part of Tehran electricity distributing grid. The resulting operation of
this method on some testing system is illuminated improvement of
voltage profile and loss reduction indexes.
Abstract: In this paper we explore the application of a formal proof system to verification problems in cryptography. Cryptographic properties concerning correctness or security of some cryptographic algorithms are of great interest. Beside some basic lemmata, we explore an implementation of a complex function that is used in cryptography. More precisely, we describe formal properties of this implementation that we computer prove. We describe formalized probability distributions (o--algebras, probability spaces and condi¬tional probabilities). These are given in the formal language of the formal proof system Isabelle/HOL. Moreover, we computer prove Bayes' Formula. Besides we describe an application of the presented formalized probability distributions to cryptography. Furthermore, this paper shows that computer proofs of complex cryptographic functions are possible by presenting an implementation of the Miller- Rabin primality test that admits formal verification. Our achievements are a step towards computer verification of cryptographic primitives. They describe a basis for computer verification in cryptography. Computer verification can be applied to further problems in crypto-graphic research, if the corresponding basic mathematical knowledge is available in a database.