Sciweavers

1001 search results - page 18 / 201
» Testing Formal Dialectic
Sort
View
ISSTA
1998
ACM
13 years 11 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...
JAR
2007
72views more  JAR 2007»
13 years 7 months ago
Inferring Phylogenetic Trees Using Answer Set Programming
We describe the reconstruction of a phylogeny for a set of taxa, with a character-based cladistics approach, in a declarative knowledge representation formalism, and show how to u...
Daniel R. Brooks, Esra Erdem, Selim T. Erdogan, Ja...
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 6 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
TOOLS
2009
IEEE
14 years 2 months ago
Reusing and Composing Tests with Traits
Single inheritance often forces developers to duplicate code and logic. This widely recognized situation affects both business code and tests. In a large and complex application w...
Stéphane Ducasse, Damien Pollet, Alexandre ...
CAV
2007
Springer
123views Hardware» more  CAV 2007»
14 years 1 months ago
Test Coverage for Continuous and Hybrid Systems
Tarik Nahhal, Thao Dang