Results 1  10
of
10
TestingBased Abstractions for ValuePassing Systems
 In CONCUR'94, number 836 in Lecture Notes in Computer Science
, 1994
"... ions for ValuePassing Systems ? Rance Cleaveland ?? and James Riely ??? 1 Dept. of Computer Science, N.C. State University, Raleigh, NC 276958206, USA 2 Dept. of Computer Science, University of N.C., Chapel Hill, NC 275993175, USA email: rance@csc.ncsu.edu, riely@cs.unc.edu Abstract. ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
(Show Context)
ions for ValuePassing Systems ? Rance Cleaveland ?? and James Riely ??? 1 Dept. of Computer Science, N.C. State University, Raleigh, NC 276958206, USA 2 Dept. of Computer Science, University of N.C., Chapel Hill, NC 275993175, USA email: rance@csc.ncsu.edu, riely@cs.unc.edu Abstract. This paper presents a framework for the abstract interpretation of processes that pass values. We define a process description language that is parameterized with respect to the set of values that processes may exchange and show that an abstraction over values induces an abstract semantics for processes. Our main results state that if the abstract value interpretation safely/optimally approximates the ground interpretation, then the resulting abstracted processes safely/optimally approximate those derived from the ground semantics (in a precisely defined sense). As the processes derived from an abstract semantics in general have far fewer states than those derived from a concrete sem...
Viewing a program transformation system at work
 In Proc. Joint 6th Int’l Conf. on Programming Language Implementation and Logic Programming (PLILP) and 4th Int’l Conf. on Algebraic and Logic Programming (ALP). LNCS 844
, 1994
"... ..."
(Show Context)
Efficient Checking of Behavioural Relations and Modal Assertions Using FixedPoint Inversion
 In Computer Aided Verification, Proceedings of the 7th International Conference, volume 939 of Lecture Notes in Computer Science
, 1995
"... . This paper presents an algorithm for solving Boolean fixedpoint equations containing one level of nesting of minimum and maximum fixed points. The algorithm assumes that the equations of the inner fixed point is of a certain restricted kind and has a worstcase timeand spacecomplexity that is lin ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
. This paper presents an algorithm for solving Boolean fixedpoint equations containing one level of nesting of minimum and maximum fixed points. The algorithm assumes that the equations of the inner fixed point is of a certain restricted kind and has a worstcase timeand spacecomplexity that is linear in the size of the equation system. By observing that a range of behavioral relations  in particular weak bisimulation  and modal assertions can be checked using equation systems of this restricted form, the algorithm improves on existing ad hoc constructed algorithms. Finally, we show how the key idea of inverting a fixed point can be used in decreasing the number of fixedpoint iterations needed in BDDbased methods for solving the same class of problems. 1 Introduction Transition systems play a central role as formal models for reactive and concurrent systems. This paper deals with the problem of automatically verifying the correctness of finite transition systems. Verification ...
Incremental Computation: A SemanticsBased Systematic Transformational Approach
, 1996
"... ion of a function f adds an extra cache parameter to f . Simplification simplifies the definition of f given the added cache parameter. However, as to how the cache parameter should be used in the simplification to provide incrementality, KIDS provides only the observation that distributive laws can ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
ion of a function f adds an extra cache parameter to f . Simplification simplifies the definition of f given the added cache parameter. However, as to how the cache parameter should be used in the simplification to provide incrementality, KIDS provides only the observation that distributive laws can often be applied. The Munich CIP project [BMPP89,Par90] has a strategy for finite differencing that captures similar ideas. It first "defines by a suitable embedding a function f 0 ", and then "derives a recursive version of f 0 using generalized unfold/fold strategy", but it provides no special techniques for discovering incrementality. We believe that both works provide only general strategies with no precise procedure to follow and therefore are less automatable than ours. Chapter 4 Caching intermediate results The value of f 0 (x \Phi y) may often be computed faster by using not only the return value of f 0 (x), as discussed in Chapter 3, but also the values of some subcomputation...
Heterogeneous Analysis and Verification for Distributed Systems
, 1995
"... In this paper we present an environment for the development of special purpose heterogeneous analysis and verification tools, which is unique in 1) constituting a framework for the development of application specific heterogeneous tools and 2) providing facilities for the automation of the synthesis ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
(Show Context)
In this paper we present an environment for the development of special purpose heterogeneous analysis and verification tools, which is unique in 1) constituting a framework for the development of application specific heterogeneous tools and 2) providing facilities for the automation of the synthesis process. Based on a specification language that uniformly combines taxonomic component specifications, interface conditions, and ordering constraints, our method adds a global view to conventional single component retrieval. Following a user session, we illustrate the interactive synthesis process, which supports the inclusion of a satisfactory new software component into the repository by proposing an appropriately precomputed default taxonomic classification. This guarantees convenient retrieval for later reuse.
A Polyadic Modal µCalculus
, 1994
"... The propositional µcalculus of Kozen extends modal logic with fixed points to achieve a powerful logic for expressing temporal properties of systems modelled by labelled transition systems. We further extend Kozen's logic with polyadic modalities to allow for expressing also quite naturally be ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The propositional µcalculus of Kozen extends modal logic with fixed points to achieve a powerful logic for expressing temporal properties of systems modelled by labelled transition systems. We further extend Kozen's logic with polyadic modalities to allow for expressing also quite naturally behavioural relations like bisimulation equivalence and simulation preorders. We show that the problem of model checking is still efficiently decidable, giving rise to efficient worstcase algorithms for verifying the infinity of behavioural relations expressible in this polyadic modal µcalculus. Some of these algorithms compete in efficiency with carefully handcrafted algorithms found in the literature. In spite of this result, the validity problem turns out to be highly undecidable. This is in contrast to the propositional µcalculus where it is decidable in deterministic exponential time. It follows as a corollary, that  also in contrast to the propositional µcalculus  the polyadic modal...
JAMES WHEELIS RIELY: Applications of Abstraction for Concurrent Programs
, 1999
"... (Under the direction of Jan Prins and Rance Cleaveland) We study the use of abstraction to reason operationally about concurrent programs. Our thesis is that abstraction can profitably be combined with operational semantics to produce new proof techniques. We study two very different applications: • ..."
Abstract
 Add to MetaCart
(Show Context)
(Under the direction of Jan Prins and Rance Cleaveland) We study the use of abstraction to reason operationally about concurrent programs. Our thesis is that abstraction can profitably be combined with operational semantics to produce new proof techniques. We study two very different applications: • the implementation of nested dataparallelism, and • the verification of valuepassing processes. In the first case, we develop a typing system for a nested dataparallel programming language and use it to prove the correctness of flattening, an important compilation technique. In the second, we demonstrate that abstract interpretations of values domains can be applied to process description languages, extending the applicability of finitestate methods to infinitestate processes. ii For Lucia
programming structures; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming
"... Abstract. In the concurrent language CCS, hvo programs are considered the same if they are bzsimilar. Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in practice. However, bisimulation makes too many distinctions between pro ..."
Abstract
 Add to MetaCart
Abstract. In the concurrent language CCS, hvo programs are considered the same if they are bzsimilar. Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in practice. However, bisimulation makes too many distinctions between programs. We consider the problem of adding operations to CCS to make bisimulation fully abstract. We define the class of GSOS operations, generalizing the style and technical advantages of CCS operations. We characterize GSOS congruence in as a bisimulationlike relation called ready simulation. Bisimulation is strictly finer than ready simulation, and hence
1. DESCRIPTION AND OBJECTIVES OF RESEARCH AND SIGNIFICANT RESULTS DURING THE GRANT PERIOD
"... Our project stated the following broad goals: a to design a practical tool capable of automating major aspects of programming essentially, a generalization of YACC [261 and MACSYMA [281 to facilitate implementation of a wide class of complex nonnumerical algorithms (in addition to parsing); b to de ..."
Abstract
 Add to MetaCart
(Show Context)
Our project stated the following broad goals: a to design a practical tool capable of automating major aspects of programming essentially, a generalization of YACC [261 and MACSYMA [281 to facilitate implementation of a wide class of complex nonnumerical algorithms (in addition to parsing); b to design and implement complexity based specification languages; c to integrate problem specification, program design, verification, and analysis within a single unified framework; d to design and efficiently implement pattern directed rule systems for semantic analysis; e to make it easier to teach and understand algorithms and software engineering. All of the goals stated in the original proposal were fulfilled. The specific achievements during the grant period may be divided into four categories described below. i.I. Transformational Methodology Underlying our transformational methodology is the hypothesis that much of the difficulty involved in implementing complex nonnumerical algorithms is due to human factors that are unrelated to any inherent problem complexity and can be solved by specific transformations