Sciweavers

7988 search results - page 12 / 1598
» A Useful Undecidable Theory
Sort
View
SAC
2010
ACM
15 years 10 months ago
Reachability analysis of GSPDIs: theory, optimization, and implementation
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
Hallstein Asheim Hansen, Gerardo Schneider
143
Voted
CORR
2004
Springer
100views Education» more  CORR 2004»
15 years 3 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
FSTTCS
2009
Springer
15 years 10 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
IJCAI
2003
15 years 4 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
POPL
2010
ACM
16 years 22 days ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...