This book constitutes the thoroughly refereed post-conference proceedings of the 27th IFIP WG 1.3internationalworkshop on Algebraic Development Techniques, WADT 2024, held in Enschede, The Netherlands, on July 8, 20...
详细信息
ISBN:
(数字)9783031889301
ISBN:
(纸本)9783031889295
This book constitutes the thoroughly refereed post-conference proceedings of the 27th IFIP WG 1.3 internationalworkshop on Algebraic Development Techniques, WADT 2024, held in Enschede, The Netherlands, on July 8, 2024.
The 6 full papers presented in this volume were carefully reviewed and selected from 11 submissions.
The contributed presentations covered a wide range of topics on the algebraic approach to system specification: from foundations of algebraic-specification languages to institutions and knowledgerepresentation, to graph transformations, rewrite rules, process algebra, and bialgebraic frameworks, to many-logics modal systems and quantum process calculi, and to several applications to code synthesis and maintainability.
Self-boost-programming for ferroelectric-NAND (Fe-NAND) flash memory was investigated by using a miniature memory cell array, which could reduce bit-line voltages for programming. As the best performance, 0.5V bit-lin...
详细信息
Self-boost-programming for ferroelectric-NAND (Fe-NAND) flash memory was investigated by using a miniature memory cell array, which could reduce bit-line voltages for programming. As the best performance, 0.5V bit-line-voltage programming with 10μs-pulse width was successfully demonstrated. This study indicated that the Fe-NAND flash memory can be operated by much lower power consumption than that of a conventional floating gate (FG-) NAND.
The proceedings contain 56 papers. The special focus in this conference is on Extensions of logicprogramming. The topics include: A new approach to making programs more reliable;searching among intervals and compact ...
ISBN:
(纸本)9783540569398
The proceedings contain 56 papers. The special focus in this conference is on Extensions of logicprogramming. The topics include: A new approach to making programs more reliable;searching among intervals and compact routing tables;the approximation of maximum subgraph problems;polynomially bounded minimization problems which are hard to approximate;primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover;the complexity of approximating pspace-complete problems for hierarchical specifications;problems on pairs of trees and the four colour problem of planar graphs;constructing competitive tours from local information;treewidth and pathwidth of permutation graphs;a theory of even functionals and their algorithmic applications;exact asymptotics of divide-and-conquer recurrences;optimal bounds for the change-making problem;the complexity of n-body simulation;a simple method for resolving degeneracies in delaunay triangulations;fault-tolerance and complexity;reversal-space trade-offs for simultaneous resource-bounded nondeterministic turing machines;on the computational power of discrete hopfield nets;on randomized versus deterministic computation;lower bounds for one-way probabilistic communication complexity;maintaining discrete probability distributions optimally;computational depth and reducibility;admissible, co-finite, and hypersimple languages;inclusion is undecidable for pattern languages;new decidability results concerning two-way counter machines and applications;cobham's theorem seen through büchi's theorem;logical definability on infinite traces;algebras for classifying regular tree languages and an application to frontier testability;finite automata as characterizations of minor closed tree families and on distributed algorithms in a broadcast domain.
Increasingly, more and more software systems must make dynamic reconfiguration of their architectures at runtime to adapt to the changing conditions. The runtime verification of architecture evolution is necessary to ...
详细信息
Increasingly, more and more software systems must make dynamic reconfiguration of their architectures at runtime to adapt to the changing conditions. The runtime verification of architecture evolution is necessary to guarantee the conformance to the specification. In this paper, we propose a runtime model checker that supports dynamic reconfiguration of software architectures taking advantage of linear temporal logic and aspect-oriented programming. The runtime model checker is a concurrent thread with the execution thread of the dynamic software, and is an automaton which can accept exactly the set of executions that satisfy the given specification defined by LTL. So the proposed runtime model checker can monitor and verify the architecture evolution of a dynamic software system continuously at runtime.
In answer-set programming (ASP), the solutions of a problem are encoded in dedicated models, called answer sets, of a logical theory. These answer sets are computed from the program that represents the theory by means...
详细信息
In previous works, we introduced Stable Deterministic Residual Structures (SDRSs), Abstract Reduction Systems with an axiomatized residual relation which model orthogonal term and graph rewriting systems, and Determin...
详细信息
Artificial society is a discipline to study mechanisms of social system and phenomena which the mechanisms make. Emergence is global phenomena occurred by local mechanisms, such as, by collective behavior of autonomou...
详细信息
Artificial society is a discipline to study mechanisms of social system and phenomena which the mechanisms make. Emergence is global phenomena occurred by local mechanisms, such as, by collective behavior of autonomous agents. Understanding of emergence phenomena is a challenging subject. In this paper we use the framework of inductive logicprogramming (ILP) for artificial society and emergence behavior study. ILP is a branch of machine learning based on logicprogramming and inductive inference. We investigate the possibility of ILP in artificial society study. ILP and logicprogramming technique are applied to representation of an artificial society model, called Sugarscape, and to rule learning for agent behavior. Although classical ILP algorithms target classification problems, the proposed algorithm grows behavior rule for an evaluation measurement. Phenomena which this paper treate is limited but we showed that ILP technique can be applied to study in the field of artificial society.
Blockchains are becoming increasingly relevant in a variety of fields, such as finance, logistics, and real estate. The fundamental task of a blockchain system is to establish data consistency among distributed agents...
详细信息
The language of HEX-programs under the answer-set semantics is designed for interoperating with heterogeneous sources via external atoms and for meta-reasoning via higher-order literals in the context of the Semantic ...
详细信息
An improved particle swarm optimization algorithm (PSO) combined with quantum genetic algorithm is proposed, to solve the problems that the PSO is difficult to converge for benchmark complex problems and it39;s para...
详细信息
An improved particle swarm optimization algorithm (PSO) combined with quantum genetic algorithm is proposed, to solve the problems that the PSO is difficult to converge for benchmark complex problems and it's parameters are hard to define. The new algorithm is used for submersible path planning and simulation on some standard test functions. The results show that the improved is superior to the standard PSO in optimization ability and the convergence rate, and it can find the optimal path faster.
暂无评论