Sciweavers

3353 search results - page 92 / 671
» Laver and set theory
Sort
View
OOPSLA
2007
Springer
15 years 4 months ago
From developer's head to developer tests: characterization, theories, and preventing one more bug
Unit testing frameworks like JUnit are a popular and effective way to prevent developer bugs. We are investigating two ways of building on these frameworks to prevent more bugs wi...
David Saff
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
14 years 11 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
ECWEB
2010
Springer
195views ECommerce» more  ECWEB 2010»
14 years 11 months ago
Comparing Techniques for Preference Relaxation: A Decision Theory Perspective
This research proposes a decision aid based on a novel type of preference relaxation, which enables consumers to easily make quality choices in online multiattribute choice scenari...
Maciej Dabrowski, Thomas Acton
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 10 months ago
Coalgebraic Automata Theory: Basic Results
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
Clemens Kupke, Yde Venema
CORR
2008
Springer
148views Education» more  CORR 2008»
14 years 8 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel