Sciweavers

167 search results - page 28 / 34
» Mathematical Logic and Deduction in Computer Science Educati...
Sort
View
SIGCSE
2008
ACM
150views Education» more  SIGCSE 2008»
13 years 8 months ago
Backstop: a tool for debugging runtime errors
The errors that Java programmers are likely to encounter can roughly be categorized into three groups: compile-time (semantic and syntactic), logical, and runtime (exceptions). Wh...
Christian Murphy, Eunhee Kim, Gail E. Kaiser, Adam...
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
CADE
2001
Springer
14 years 9 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
IJAC
2010
231views more  IJAC 2010»
13 years 5 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
BIRTHDAY
2010
Springer
13 years 6 months ago
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
Jan Van den Bussche