Sciweavers

827 search results - page 10 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
FORTE
2003
13 years 9 months ago
Correct Passive Testing Algorithms and Complete Fault Coverage
The aim of passive testing is to detect faults in a system while observing the system during normal operation, that is, without forcing the system to specialized inputs explicitly ...
Arun N. Netravali, Krishan K. Sabnani, Ramesh Visw...
CORR
2002
Springer
133views Education» more  CORR 2002»
13 years 7 months ago
Complete Axiomatizations for Reasoning About Knowledge and Time
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various ...
Joseph Y. Halpern, Ron van der Meyden, Moshe Y. Va...
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...
AIED
2005
Springer
14 years 1 months ago
Analyzing Completeness and Correctness of Utterances Using an ATMS
Analyzing coverage of a student’s utterance or essay (completeness) and diagnosing errors (correctness) can be treated as a diagnosis problem and solved using a well-known techni...
Maxim Makatchev, Kurt VanLehn
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 2 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi