
	Where results make sense

Topic: Equivalence partitioning

	Equivalence relation - Wikipedia, the free encyclopedia
		In mathematics, an equivalence relation on a set X is a binary relation on X that is reflexive, symmetric, and transitive.
		Equivalence relations are often used to group together objects that are similar in some sense.
		Green's relations are five equivalence relations on the elements of a semigroup.
	en.wikipedia.org /wiki/Equivalence_relation (1350 words)

	Equivalence relation
		In mathematics, an equivalence relation on a set X is a binary relation on X that is reflexive, symmetric and transitive, i.e., if the relation is written as ~ it holds for all a, b and c in X that
		The relation "has a common factor with" between natural numbers is not an equivalence relation, because although it is reflexive and symmetric, it is not transitive (2 and 6 have a common factor, and 6 and 3 have a common factor, but 2 and 3 do not have a common factor).
		One often generates equivalence relations to quickly construct new spaces by "glueing things together".
	www.ebroadcast.com.au /lookup/encyclopedia/eq/Equivalent.html (738 words)

	Black box testing - Wikipedia, the free encyclopedia
		Equivalence partitioning is designed to minimize the number of test cases by dividing tests in such a way that the system is expected to act the same way for all tests of each equivalence partition.
		Boundary value Analysis is a form of fl box testing in which input values at the boundaries of the input domain are tested.
		Boundary value analysis complements the technique of equivalence partitioning.
	en.wikipedia.org /wiki/Black_box_testing (519 words)

	equivalance partitioning - QA Forums
		To answer your query,the concept of Equivalence Partitioning and Boundary Value analysis applies when you want to test validity / graceful inputs to be accepted by your application or system as a whole.
		Therefore, in equivalence partitioning, you would select one valid value within the range (perhaps 0) and one invalid value, like 2.
		In equivalence class partitioning you reduce the set of inputs to 3 (100, 500, and 1000), because the range is satisfactorily covered with only the 3 inputs instead of the whole range.
	www.qaforums.com /Forum46/HTML/000373.html (1038 words)

	JOT: Journal of Object Technology - Enhancing Design by Contract with Knowledge about Equivalence Partitions, Per Madsen
		The general concept of Equivalence Partitions is that we divide the unit under test into a number of partitions, based on the criterion that testing a single member of a partition should be as good as testing all members of a partition.
		This is to say that if a test case using one member of a partition fails, all test cases using members of this partition should fail, and similar if a test case using one member of a partition succeeds, all test cases using members of this partition should succeed.
		If the Equivalence Partitions can be expressed in terms of invariants we will have an easy way to formalize the knowledge of Equivalence Partitions and express this knowledge in a concrete way in a programming language.
	www.jot.fm /issues/issue_2004_04/article1 (4425 words)

	Introduction to social network methods: Chapter 15: Regular equivalence
		This is because the concept of regular equivalence, and the methods used to identify and describe regular equivalence sets correspond quite closely to the sociological concept of a "role." The notion of social roles is a centerpiece of most sociological theorizing.
		In regular equivalence, we don't care which daughter goes with which mother; what is identified by regular equivalence is the presence of two sets (which we might label "mothers" and "daughters"), each defined by its relation to the other set.
		The regular equivalence concept is a very important one for sociologists using social network methods, because it accords well with the notion of a "social role." Two actors are regularly equivalent if they are equally related to equivalent (but not necessarily the same, or same number of) equivalent others.
	faculty.ucr.edu /~hanneman/nettext/C15_Regular_Equivalence.html (2847 words)

	Equivalence relation : Equivalent (Site not responding. Last check: 2007-10-11)
		The relation "≥" between real numbers is not an equivalence relation, because although it is reflexive and transitive, it isn't symmetric.
		The relation "has a common factor with" between natural numbers is not an equivalence relation, because although it is reflexive and symmetric, it isn't transitive (2 and 6 have a common factor, and 6 and 3 have a common factor, but 2 and 3 do not have a common factor).
		a R b is never true) is not an equivalence relation, because although it is vacuously symmetric and transitive, it isn't reflexive (except when X is also empty).
	www.explainthat.info /eq/equivalent.html (962 words)

	Lecture #5
		Equivalence classes may be identified from a functional description by carefully examining the constraints and functional requirements for each input.
		That is, valid equivalence classes for input values that are valid (may be determined from the constraints) and invalid equivalence classes for input values that are invalid (may be determined from the constraints).
		You would identify one valid equivalence class for input values where the first character is a letter and one invalid equivalence class where the first character is not a letter.
	condor.depaul.edu /~jmorgan1/se433.lect5.html (3917 words)

	Lecture #3
		Equivalence Partitioning is one technique that may be used to ensure that test cases are not redundant.
		The basic idea is to partition the input domain of a program into disjoint classes of data where the partitioning is accomplished by identifying groups of inputs that should be treated equivalently by the program.
		That is, rather than selecting any element of an equivalence class, boundary value analysis recommends that test cases should be taken from elements at the boundaries, or edges, of classes.
	condor.depaul.edu /~jmorgan1/se433.lect3.html (760 words)

	27-343 Lecture Notes: Software Testing Techniques
		A graph matrix is a square matrix whose size is equivalent to the number of nodes in the flow graph.
		Equivalence partitioning strives to define a test case that uncovers classes of errors and thereby reduces the number of test cases needed.
		It complements equivalence partitioning since it selects test cases at the edges of a class.
	hebb.cis.uoguelph.ca /~dave/343/Lectures/testing.html (1509 words)

	WebTek Labs- FAQs (Site not responding. Last check: 2007-10-11)
		In Equivalence Partitioning, a test case is designed so as to uncover a group or class of error.
		These classes are known as equivalence classes and the process of making equivalence classes is called equivalence partitioning.
		Equivalence classes represent a set of valid or invalid states for input conditions.
	www.webteklabs.com /Faqs/faqs.htm (1594 words)

	[No title] (Site not responding. Last check: 2007-10-11)
		Because the process of identifying equivalences classes that partition a multi-dimensional input space is exhausting and requires a great deal of luck.
		Because partitioning a program's input space into a small number of equivalence classes is tantamount to exhaustive testing.
		A strategy for identifying appropriate combinations of equivalence classes must be employed for the purpose of partitioning the resultant multi-dimensional input space.
	www.cise.ufl.edu /class/cen6070/prac_tests/1.02 (717 words)

	Black Box Testing (Site not responding. Last check: 2007-10-11)
		Equivalence Partitioning divides the input domain of a program into classes of data from which test cases can be derived.
		The intent is to define a representative or "power" test case that uncovers a class of errors, thereby reducing the total number of test cases that must be developed.
		Once equivalence classes have been determined, design tests for the limits (boundaries) of each class.
	www.csc.calpoly.edu /~jdalbey/205/Resources/bbtestLec.html (212 words)

	Remember these? (Site not responding. Last check: 2007-10-11)
		The most common (and simplest) functional test techniques are equivalence partitioning and boundary value analysis.
		Equivalence partitioning is based on partitioning the inputs and outputs of a system and exercising each partition at least once to achieve coverage.
		It’s a fact that many bugs are found in the decision-making code that sets the ‘boundaries’ of the rules, or the equivalence partitions.
	www.sysmod.com /eurotest/tsld010.htm (223 words)

	equivalence from FOLDOC
		An equivalence class is a subset whose elements are related to each other by an equivalence relation.
		The equivalence classes of a set under some relation form a partition of that set (i.e.
		For example, for binary search the following partitions exist: inputs that do or do not conform to pre-conditions, Inputs where the key element is or is not a member of the array.
	ftp.sunet.se /foldoc/foldoc.cgi?equivalence (259 words)

	Equivalence Relation
		The reflexive property states that all objects are equivalent to themselves while the symmetric property states that if a is equivalent to b, then b is equivalent to a.
		The transitive property states that objects that are equivalent to the same object are equivalent to one another.
		These ideas of partitioning and equivalence classes are formalised in the following definitions.
	scom.hud.ac.uk /scomtlm/book/node41.html (221 words)

	K-Team - Test Plan
		It is expected that this would lead to a rapid reduction in the number of test cases required to achieve complete coverage of the class' methods, ensuring that the class is fulfilling each of its assigned roles and responsibilities correctly.
		In addition equivalence partitioning, boundary value analysis will be performed whenever we encounter a method where the input condition is restricted to some arbitrary range.
		It is recognised that there are certain classes that may require large amounts of test data that are not well-suited to equivalence partitioning.
	www.perceptek.com.au /kteam/docs/tp.html (3498 words)

	Equivalence Partitioning (Site not responding. Last check: 2007-10-11)
		If an input condition specifies a range, one valid and two invalid equivalence classes are defined.
		If an input condition requires a specific value, one valid and two invalid equivalence classes are defined.
		If an input condition specifies a member of a set, one valid and one invalid equivalence classes are defined..
	www.kingston.ac.uk /~ku08915/personal/work/CO1032B/codetest_10/sld046.htm (84 words)

	Lecture notes: A Unit Testing Tool - based on Design by Contract and Equivalence Partitions (Site not responding. Last check: 2007-10-11)
		In order for this to happen we have made an extended version of Java that enables the programmer to specify a formal description of Equivalence Partitions and to use Design by Contract as in Eiffel.
		Two test cases based on members from the same partition is likely to reveal the same bugs.
		By identifying and testing one member of each partition we gain a 'good' coverage with 'small' number of test cases.
	www.cs.auc.dk /~madsen/Homepage/Research/Presentations/Bern_1401_2004/index-book.html (635 words)

	CSCI 630 Notes
		Often equivalence class partitioning is used to develop a common set of test cases for each implementation
		Partition testing - reduces the number of test cases required to test a class
		Equivalence partitioning and boundary value analysis to describe classes of input and interactions
	www.ecst.csuchico.edu /~judyc/0506F-csci630/notes/notes18.html (1427 words)

	Blackbox Testing (Site not responding. Last check: 2007-10-11)
		Put yourself in the programmer’s shoes and guess what types of errors one may make.
		choose testcases that lie on the “edges” of the equivalence class.
		Very similar to loop testing, but based on the analysis of the programmer’s input and functions.
	www.cacs.louisiana.edu /~arun/courses/453.Notes/blackbox.htm (89 words)

	Software Engineering > Testing > Black Box Testing
		To optimize testing beyond this minimal set of tests equivalence partitioning, boundary value analysis, decision tables, and diabolical test cases should be created.
		Equivalence partitioning divides the set of possible input values into equivalence classes.
		Only a value from each of the equivalence classes needs to be tested.
	openseminar.org /se/modules/47/index/screen.do (296 words)

	[No title]
		Category-based In attribute based partitioning methods are divided into those which use same attributes.
		For this reason attribute based partitioning was not chosen.
		In this methods are divided according to their logical function among the following categories: -initialization and setup -computation -query -cleanup In this example program all classes have clearly separate able methods into these categories.
	www.cs.ndsu.nodak.edu /~forhad/Testsuit.doc (605 words)

	Software Testing - 2.0 Testing Fundamentals
		If the input domain is then partitioned into equivalent subsets, then a good set of cases would draw an input value from each rather than concentrate on only a few of the subsets.
		Values on each side of a partition should also be tested, addressing one of the most common coding errors, that of being "off by one".
		It must be noted however that the equivalence partitions are defined by these boundary values.
	members.shaw.ca /sdthornton/seng623/webdoc/wd2.0.html (2130 words)

	[No title] (Site not responding. Last check: 2007-10-11)
		few general guidelines for determining the equivalence classes can be given¡&.e.eª “ ó?+¨Equivalence Class Partitioningª ¨ If the input data to the program is specified by a range of values: e.g.
		one valid and two invalid equivalence classes are defined.
		{a,b,c} one equivalence class for valid input values another equivalence class for invalid input values should be defined.
	www.ncst.ernet.in /education/apgdst/sefac/slides/SoftwareTesting.ppt (1815 words)

	Homework #2 - Winter Quarter 2003 - Path Testing - CMPS 115 - Software Methodology (Site not responding. Last check: 2007-10-11)
		(a.1) give three example values of that variable that can be derived by performing equivalence partitioning
		(a.2) explain why these inputs are representative of equivalence partitioning
		(c.1) give example values of all five that can be derived by performing equivalence partitioning
	www.cse.ucsc.edu /classes/cmps115/Winter03/hw2-wq03.html (386 words)

	[No title]
		In the table that follows, the rows represent the equivalence classes and the columns represent the test cases.
		¡ËË$óvó{tó:5¨Boundary Value Analysis¡0¨‘When examining specifications to identify equivalence classes, attention should be given to values which lie on the boundary of specified ranges.¡’’$ó;6ó
		For the following test data, V indicates that a valid equivalence class was tested by that test case.
	www.cs.bsu.edu /homepages/dmz/cs639/testing.ppt (1173 words)

	EQ from FOLDOC (Site not responding. Last check: 2007-10-11)
		Next: equivalence class, equivalence class partitioning, equivalence relation
		Next: equivalence class partitioning, equivalence relation, ER, er, ERA, era
		Previous: equational logic, Equel, equivalence class, equivalence class partitioning
	www.instantweb.com /d/dictionary/foldoc.cgi?query=EQ (476 words)

	[No title]
		For valid classes, choose test cases to cover as many equivalence classes as possible, until all valid classes have been covered.¡¼¼$ó2-ó4/ó¨¡¨Valid Test Casesª ó ó¡ó¢ó©¢¨Invalid Test Casesª ó¤ó¥ó¦ó§óª óuª ¨½Tables or matrices are helpful in determining which equivalence classes have been tested.
		In the table, the rows represent the equivalence classes and the columns represent the test cases.
		¡¾¾$óvó:5¨Boundary Value Analysis¡0¨‘When examining specifications to identify equivalence classes, attention should be given to values which lie on the boundary of specified ranges.¡’’$ó;6ó
	www.csis.ul.ie /modules/CS5703/BlackBox-Triangle.ppt (340 words)

	[No title] (Site not responding. Last check: 2007-10-11)
		few general guidelines for determining the equivalence classes can be given¡,. °ÿe ¹ÿ.,e(ó¨Equivalence Class Partitioning¡ ¹ÿ 0¨ If the input data to the program is specified by a range of values: e.g.
		¡FD °ÿ] Æÿ3$$ÿþÿþ] ó¨Equivalence Class Partitioning¡ ¹ÿ 0¨If input is an enumerated set of values: e.g.
		Designing fl box test cases: requires understanding only SRS document does not require any knowledge about design and code.
	www.facweb.iitkgp.ernet.in /~spp/LECT11.ppt (947 words)

Try your search on: Qwika (all wikis)