Results 1  10
of
842
Korat: Automated testing based on Java predicates
 IN PROC. INTERNATIONAL SYMPOSIUM ON SOFTWARE TESTING AND ANALYSIS (ISSTA
, 2002
"... This paper presents Korat, a novel framework for automated testing of Java programs. Given a formal specification for a method, Korat uses the method precondition to automatically generate all nonisomorphic test cases bounded by a given size. Korat then executes the method on each of these test case ..."
Abstract

Cited by 325 (53 self)
 Add to MetaCart
This paper presents Korat, a novel framework for automated testing of Java programs. Given a formal specification for a method, Korat uses the method precondition to automatically generate all nonisomorphic test cases bounded by a given size. Korat then executes the method on each of these test cases, and uses the method postcondition as a test oracle to check the correctness of each output. To generate test cases for a method, Korat constructs a Java predicate (i.e., a method that returns a boolean) from the method’s precondition. The heart of Korat is a technique for automatic test case generation: given a predicate and a bound on the size of its inputs, Korat generates all nonisomorphic inputs for which the predicate returns true. Korat exhaustively explores the input space of the predicate but does so efficiently by monitoring the predicate’s executions and pruning large portions of the search space. This paper illustrates the use of Korat for testing several data structures, including some from the Java Collections Framework. The experimental results show that it is feasible to generate test cases from Java predicates, even when the search space for inputs is very large. This paper also compares Korat with a testing framework based on declarative specifications. Contrary to our initial expectation, the experiments show that Korat generates test cases much faster than the declarative framework.
GFUN: A Maple Package for the Manipulation of Generating and Holonomic Functions in One Variable
, 1992
"... We describe the gfun package which contains functions for manipulating sequences, linear recurrences or di erential equations and generating functions of various types. This document isintended both as an elementary introduction to the subject and as a reference manual for the package. ..."
Abstract

Cited by 163 (18 self)
 Add to MetaCart
We describe the gfun package which contains functions for manipulating sequences, linear recurrences or di erential equations and generating functions of various types. This document isintended both as an elementary introduction to the subject and as a reference manual for the package.
Generating Trees and the Catalan and Schröder Numbers
 DEPARTMENT OF MATHEMATICS, STOCKHOLMS UNIVERSITET, S106 91
, 1995
"... A permutation 2 Sn avoids the subpattern iff has no subsequence having all the same pairwise comparisons as , and we write 2 Sn ( ). We present a new bijective proof of the wellknown result that jS n (123)j = jS n (132)j = c n , the nth Catalan number. A generalization to forbidden pattern ..."
Abstract

Cited by 116 (3 self)
 Add to MetaCart
(Show Context)
A permutation 2 Sn avoids the subpattern iff has no subsequence having all the same pairwise comparisons as , and we write 2 Sn ( ). We present a new bijective proof of the wellknown result that jS n (123)j = jS n (132)j = c n , the nth Catalan number. A generalization to forbidden patterns of length 4 gives an asymptotic formula for the vexillary permutations. We settle a conjecture of Shapiro and Getu that jS n (3142; 2413)j = s n\Gamma1 , the Schröder number, and characterize the dequesortable permutations of Knuth, also counted by s n\Gamma1 .
Advanced determinant calculus: a complement
 LINEAR ALGEBRA APPL
, 2005
"... This is a complement to my previous article “Advanced Determinant Calculus ” (Séminaire Lotharingien Combin. 42 (1999), Article B42q, 67 pp.). In the present article, I share with the reader my experience of applying the methods described in the previous article in order to solve a particular probl ..."
Abstract

Cited by 89 (8 self)
 Add to MetaCart
(Show Context)
This is a complement to my previous article “Advanced Determinant Calculus ” (Séminaire Lotharingien Combin. 42 (1999), Article B42q, 67 pp.). In the present article, I share with the reader my experience of applying the methods described in the previous article in order to solve a particular problem from number theory (G. Almkvist, J. Petersson and the author, Experiment. Math. 12 (2003), 441– 456). Moreover, I add a list of determinant evaluations which I consider as interesting, which have been found since the appearance of the previous article, or which I failed to mention there, including several conjectures and open problems.
SPECIAL VALUES OF MULTIPLE POLYLOGARITHMS
, 1999
"... Historically, the polylogarithm has attracted specialists and nonspecialists alike withitslovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in combinatorics, knot theory and highenergy physics. More recently, we ha ..."
Abstract

Cited by 88 (23 self)
 Add to MetaCart
(Show Context)
Historically, the polylogarithm has attracted specialists and nonspecialists alike withitslovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in combinatorics, knot theory and highenergy physics. More recently, we have been forced to consider multidimensional extensions encompassing the classical polylogarithm, Euler sums, and the Riemann zeta function. Here, we provide a general framework within which previously isolated results can now be properly understood. Applying the theory developed herein, we prove several previously conjectured evaluations, including an intriguing conjecture of Don Zagier.
Generating Functions for Generating Trees
 PROCEEDINGS OF 11TH FORMAL POWER SERIES AND ALGEBRAIC COMBINATORICS
, 1999
"... Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumerati ..."
Abstract

Cited by 88 (20 self)
 Add to MetaCart
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation algorithms. We investigate the links between the structural properties of the rewriting rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating function.
Generalized pattern avoidance
 European J. Combin
"... Abstract. Recently, Babson and Steingrímsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We will consider pattern avoidance for such patterns, and give a complete solution for the number of pe ..."
Abstract

Cited by 86 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Recently, Babson and Steingrímsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We will consider pattern avoidance for such patterns, and give a complete solution for the number of permutations avoiding any single pattern of length three with exactly one adjacent pair of letters. For eight of these twelve patterns the answer is given by the Bell numbers. For the remaining four the answer is given by the Catalan numbers. We also give some results for the number of permutations avoiding two different patterns. These results relate the permutations in question to Motzkin paths, involutions and nonoverlapping partitions. Furthermore, we define a new class of set partitions, called monotone partitions, and show that these partitions are in onetoone correspondence with nonoverlapping partitions. 1.