Results 1  10
of
15
Scheduling Garbage Collection in Embedded Systems
, 1998
"... The complexity of systems for automatic control and other safetycritical applications grows rapidly. Computer software represents an increasing part of the complexity. As larger systems are developed, we need to find scalable techniques to manage the complexity in order to guarantee high product qu ..."
Abstract

Cited by 73 (0 self)
 Add to MetaCart
The complexity of systems for automatic control and other safetycritical applications grows rapidly. Computer software represents an increasing part of the complexity. As larger systems are developed, we need to find scalable techniques to manage the complexity in order to guarantee high product quality. Memory management is a key quality factor for these systems. Automatic memory management, or garbage collection, is a technique that significantly reduces the complex problem of correct memory management. The risk of software errors decreases and development time is reduced. Garbage collection techniques suitable for interactive and soft realtime systems exist, but few approaches are suitable for systems with hard realtime requirements, such as control systems (embedded systems). One part of the problem is solved by incremental garbage collection algorithms, which have been presented before. We focus on the scheduling problem which forms the second part of the problem, i.e. how the work of a garbage collector should be scheduled in order
Coverage Preserving Reduction Strategies for Reachability Analysis
"... We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are implementations of partial order semantics rules that attempt to minimize the number of execution sequences that need to be ..."
Abstract

Cited by 58 (8 self)
 Add to MetaCart
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are implementations of partial order semantics rules that attempt to minimize the number of execution sequences that need to be explored for a full state space exploration. The third strategy is the implementation of a state compression scheme that attempts to minimize the amount of memory that is used to built a state space. The three strategies are shown to have a potential for substantially improving the performance of a conventional search. The paper discusses the optimal choices for reducing either run time or memory requirements by four to six times. The strategies can readily be combined with each other and with alternative state space reduction techniques such as supertrace or state space caching methods.
State Compression in SPIN: Recursive Indexing And Compression Training Runs
 IN PROCEEDINGS OF THIRD INTERNATIONAL SPIN WORKSHOP
, 1997
"... The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable statespace of a system that is obtained through the formalization of a correctness requirement as an automaton. This automaton restricts the statespace to precisely the subset that may contain ..."
Abstract

Cited by 40 (1 self)
 Add to MetaCart
The verification algorithm of SPIN is based on an explicit enumeration of a subset of the reachable statespace of a system that is obtained through the formalization of a correctness requirement as an automaton. This automaton restricts the statespace to precisely the subset that may contain the counterexamples to the original correctness requirement, if they exist. This method of verification conforms to the method for automatatheoretic verification outlined in [VW86]. SPIN derives
The Complexity of Automated Reasoning
, 1989
"... This thesis explores the relative complexity of proofs produced by the automatic theorem proving procedures of analytic tableaux, linear resolution, the connection method, tree resolution and the DavisPutnam procedure. It is shown that tree resolution simulates the improved tableau procedure and th ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This thesis explores the relative complexity of proofs produced by the automatic theorem proving procedures of analytic tableaux, linear resolution, the connection method, tree resolution and the DavisPutnam procedure. It is shown that tree resolution simulates the improved tableau procedure and that SLresolution and the connection method are equivalent to restrictions of the improved tableau method. The theorem by Tseitin that the DavisPutnam Procedure cannot be simulated by tree resolution is given an explicit and simplified proof. The hard examples for tree resolution are contradictions constructed from simple Tseitin graphs.
Periodicities on Trees
, 1995
"... We introduce the notion of periodicity for kary labeled trees: roughly speaking, a tree is periodic if it can be obtained by a sequence of concatenations of a smaller tree plus a "remainder". The period is the shape of such smaller tree (i.e. the corresponding unlabeled tree). This definition reduc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce the notion of periodicity for kary labeled trees: roughly speaking, a tree is periodic if it can be obtained by a sequence of concatenations of a smaller tree plus a "remainder". The period is the shape of such smaller tree (i.e. the corresponding unlabeled tree). This definition reduces to the classical one for string when restricted to the case of unary trees. Then, we define the greatest common divisor of two unlabeled trees and relate right congruences to unlabeled trees. This allows us to give a characterization of tree periodicity in terms of right congruences and then to prove a periodicity theorem for trees that is a generalization to trees of the Fine and Wilf's periodicity theorem for words. Keywords: Congruence, periodicity, labeled tree. Work partially supported by the ESPRIT II Basic Research Actions Program of the EC under Project ASMICS 2 (contract No. 6317) and in part by the Italian Ministry of Universities and Scientific Research MURST 40% Algoritmi, ...
Problem Solving Environments and Symbolic Computing
, 1997
"... ion, representation, communication : : : : : : : : : : 29 5.5 System and human interface design issues : : : : : : : : : : : 31 5.6 Miscellany : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 32 6 Acknowledgments 33 Abstract What role should be played by symbolic mathematical computation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ion, representation, communication : : : : : : : : : : 29 5.5 System and human interface design issues : : : : : : : : : : : 31 5.6 Miscellany : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 32 6 Acknowledgments 33 Abstract What role should be played by symbolic mathematical computation facilities in scientific and engineering "problem solving environments"? Most observers agree with us that in conjunction with numerical libraries and other facilities, symbolic computation should be useful for the creation and manipulation of mathematical models, the production of custom numerical software, and the solution of certains classes of mathematical problems that are difficult to handle by traditional floatingpoint computation. Even further, though, symbolic representation and manipulation can potentially play a more central role  with more general representations a program can naturally deal with computational objects of a more general nature. Numerical, graphical, and other...
Pursuit and evasion from a distance: algorithms and bounds
"... Cops and Robber is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robber, distance k Cops and Robber, where the cops win if they are distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Cops and Robber is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robber, distance k Cops and Robber, where the cops win if they are distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops needed to capture the robber in G. The distance k analogue of the cop number, written ck(G), equals the minimum number of cops needed to win at a given distance k. We supply a classification result for graphs with bounded ck(G) values and develop an O(n2s+3) algorithm for determining if ck(G) ≤ s. In the case k = 0, our algorithm is faster than previously known algorithms. Upper and lower bounds are found for ck(G) in terms of the order of G. We prove that
Cyclic Structure And Coloring Of Graphs And Their Parallel Solutions
, 1995
"... of a Thesis Submitted to the Graduate Faculty of Rensselaer Polytechnic Institute in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Major Subject: Computer Science The original of the complete thesis is on file in the Rensselaer Polytechnic Institute Library Approved ..."
Abstract
 Add to MetaCart
of a Thesis Submitted to the Graduate Faculty of Rensselaer Polytechnic Institute in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Major Subject: Computer Science The original of the complete thesis is on file in the Rensselaer Polytechnic Institute Library Approved by the Examining Committee: Dr. Mukkai S. Krishnamoorthy, Thesis Adviser Dr. Robert McNaughton , Member Dr. John E. Mitchell , Member Dr. Susan H. Rodger , Member Dr. Edwin H. Rogers , Member Rensselaer Polytechnic Institute Troy, New York July 1995 (For Graduation August 1995) c fl Copyright 1995 by U¯gur Do¯grusoz All Rights Reserved ii CONTENTS LIST OF FIGURES : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : v ACKNOWLEDGEMENT : : : : : : : : : : : : : : : : : : : : : : : : : : : : : xii ABSTRACT : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : xiv 1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.1 Motivation : : : ...
Indecomposable Prefix Codes and Prime Trees
"... In this paper we introduce a notion of divisibility and primality on kary trees and we find a relation between indecomposable prefix code and prime trees. This relation allows to work on trees instead than directly on prefix codes. In this way we can prove a density theorem for indecomposable prefi ..."
Abstract
 Add to MetaCart
In this paper we introduce a notion of divisibility and primality on kary trees and we find a relation between indecomposable prefix code and prime trees. This relation allows to work on trees instead than directly on prefix codes. In this way we can prove a density theorem for indecomposable prefix codes and we can give an algorithm to test the indecomposability of a maximal prefix code. 1 Introduction The theory of codes is a widely developed topic in algebra and combinatorics and is by now considered an important part of theoretical computer science. A particularly interesting subclass of codes is the class of prefix codes. The interest to prefix codes arises from the fact they can be easily constructed, deciphered and represented. In fact it is well known that prefix codes on a kletters alphabet can be represented by the leaves of an opportune kary tree. Up to now this representation of prefix codes has been used because of its easy readability. In this paper we show how to tak...