Sciweavers

1948 search results - page 111 / 390
» Formalizing Mirror Theory
Sort
View
ICFEM
2009
Springer
16 years 2 days ago
Symbolic Query Exploration
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 theor...
Margus Veanes, Pavel Grigorenko, Peli de Halleux, ...
143
Voted
HYBRID
1997
Springer
15 years 9 months ago
Hybrid Systems with Finite Bisimulations
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
Gerardo Lafferriere, George J. Pappas, Shankar Sas...
APPINF
2003
15 years 7 months ago
On the Three Forms of Non-deductive Inferences: Induction, Abduction, and Design
Induction and abduction are well known non-deductive inferences. We shall propose that design is also another form of non-deductive inference, and, based on Barwise and Seligman...
Makoto Kikuchi, Ichiro Nagasaka
ENTCS
2002
77views more  ENTCS 2002»
15 years 5 months ago
The variety of variables in computer-aided real-time programming
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
Luke Wildman, Colin J. Fidge
TLCA
2007
Springer
15 years 11 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva