Sciweavers

368 search results - page 58 / 74
» Arithmetic as a Theory Modulo
Sort
View
TLCA
2009
Springer
14 years 3 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
SIGSOFT
2006
ACM
14 years 2 months ago
Interpolation for data structures
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
Deepak Kapur, Rupak Majumdar, Calogero G. Zarba
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 8 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
CADE
2009
Springer
14 years 9 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
AML
2011
204views Mathematics» more  AML 2011»
13 years 3 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek