Sciweavers

455 search results - page 3 / 91
» Directed test generation using symbolic grammars
Sort
View
ACL
2007
13 years 7 months ago
A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
Claire Gardent, Eric Kow
IFIP
2001
Springer
13 years 10 months ago
Functional Test Generation using Constraint Logic Programming
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
Zhihong Zeng, Maciej J. Ciesielski, Bruno Rouzeyre
TACAS
2005
Springer
158views Algorithms» more  TACAS 2005»
13 years 11 months ago
Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution
Object-oriented unit tests consist of sequences of method invocations. Behavior of an invocation depends on the method’s arguments and the state of the receiver at the beginning ...
Tao Xie, Darko Marinov, Wolfram Schulte, David Not...
SSIRI
2010
13 years 4 months ago
A Formal Framework for Mutation Testing
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
Fevzi Belli, Mutlu Beyazit
CEC
2007
IEEE
14 years 15 days ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers