Sciweavers

265 search results - page 32 / 53
» entcs 2007
Sort
View
ENTCS
2007
81views more  ENTCS 2007»
15 years 4 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan
ENTCS
2007
182views more  ENTCS 2007»
15 years 4 months ago
Automated Fault Localization for C Programs
If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...
Andreas Griesmayer, Stefan Staber, Roderick Bloem
ENTCS
2007
82views more  ENTCS 2007»
15 years 4 months ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers
ENTCS
2007
100views more  ENTCS 2007»
15 years 4 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
ENTCS
2007
121views more  ENTCS 2007»
15 years 4 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim