Sciweavers

608 search results - page 10 / 122
» Tests, Proofs and Refinements
Sort
View
APAL
2010
123views more  APAL 2010»
13 years 5 months ago
Classical descriptive set theory as a refinement of effective descriptive set theory
The (effective) Suslin-Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it...
Yiannis N. Moschovakis
CHARME
2003
Springer
120views Hardware» more  CHARME 2003»
13 years 11 months ago
A Compositional Theory of Refinement for Branching Time
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
Panagiotis Manolios
JAR
2010
98views more  JAR 2010»
13 years 2 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
APAL
2005
97views more  APAL 2005»
13 years 7 months ago
Polarized and focalized linear and classical proofs
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...
Olivier Laurent, Myriam Quatrini, Lorenzo Tortora ...
TSE
2010
110views more  TSE 2010»
13 years 6 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...