Results 1 
4 of
4
Symbolic query exploration
 in ICFEM’09
, 2009
"... Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theory that includes arithmetic, tuples, and sets, and translate the generation problem into a satisfiability or model genera ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theory that includes arithmetic, tuples, and sets, and translate the generation problem into a satisfiability or model generation problem modulo the background theory. We use the satisfiability modulo theories (SMT) solver Z3 in the concrete implementation. We describe an application of model generation in the context of the database unit testing framework of Visual Studio. 1
Symbolic bounded conformance checking of model programs
, 2009
"... Abstract. Model programs are highlevel behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of deciding if the set of traces allowed by one model program forms a subset of the set of traces allowed by another model p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Model programs are highlevel behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of deciding if the set of traces allowed by one model program forms a subset of the set of traces allowed by another model program. This is a foundational problem in the context of modelbased testing, where one model program corresponds to an implementation and the other one to its specification. Here model programs are described using the ASM language AsmL. We assume a background T containing linear arithmetic, sets, and tuples. We introduce the Bounded Conformance Checking problem or BCC as a special case of the conformance checking problem when the length of traces is bounded and provide a mapping of BCC to a theorem proving problem in T. BCC is shown to be highly undecidable in the general case but decidable for a class of model programs that are common in practice. 1
InputOutput Model Programs
, 2009
"... Model programs are used as highlevel behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses inputoutput model programs, where the action vocabulary is divided between two conceptual players: the input player and the output player. The pla ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Model programs are used as highlevel behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses inputoutput model programs, where the action vocabulary is divided between two conceptual players: the input player and the output player. The players share the action vocabulary and make moves that are labeled by actions according to their respective model programs. Conformance between the two model programs means that the output (input) player only makes output (input) moves that are allowed by the input (output) players model program. In a bounded game, the total number of moves is fixed. Here model programs use a background theory T containing linear arithmetic, sets, and tuples. We formulate the bounded game conformance checking problem, or BGC, as a theorem proving problem modulo T and analyze its complexity.
Alternating Simulation and IOCO ⋆
"... Abstract. We propose a symbolic framework called guarded labeled assignment systems or GLASs and show how GLASs can be used as a foundation for symbolic analysis of various aspects of formal specification languages. We define a notion of i/orefinement over GLASs as an alternating simulation relatio ..."
Abstract
 Add to MetaCart
Abstract. We propose a symbolic framework called guarded labeled assignment systems or GLASs and show how GLASs can be used as a foundation for symbolic analysis of various aspects of formal specification languages. We define a notion of i/orefinement over GLASs as an alternating simulation relation and provide formal proofs that relate i/orefinement to ioco. We show that noni/orefinement reduces to a reachability problem and provide a translation from bounded noni/orefinement or bounded nonioco to checking firstorder assertions. 1