Sciweavers

7988 search results - page 83 / 1598
» A Useful Undecidable Theory
Sort
View
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 6 months ago
Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-autom...
Andrew Schumann
COLING
1990
13 years 10 months ago
Centering theory and the Italian pronominal system
In this paper, I give an account, in terms of centering theory [GJW86], of some phenomena of pronominalization in Italian, in particular the use of the null or the overt pronoun i...
Barbara Di Eugenio
SIGSOFT
2003
ACM
14 years 9 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 2 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
JELIA
2010
Springer
13 years 7 months ago
Translating First-Order Causal Theories into Answer Set Programming
Abstract. Nonmonotonic causal logic became a basis for the semantics of several expressive action languages. Norman McCain and Paolo Ferraris showed how to embed propositional caus...
Vladimir Lifschitz, Fangkai Yang