232 search results - page 37 / 47 » Completeness and Decidability in Sequence Logic |
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
RTA
2005
Springer
14 years 27 days ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...