896 search results - page 70 / 180 » On completeness of word reversing |
207
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
107
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
ICWE
2007
Springer
15 years 7 months ago
2007
Springer
Combining expressiveness and plainness in the design of web documents is a difficult task. Validation languages are very powerful and designers are tempted to over-design specific...
100
Voted
DATE
2002
IEEE
15 years 5 months ago
2002
IEEE
: It has always been assumed that fault models in memories are sufficiently precise for specifying the faulty behavior. This means that, given a fault model, it should be possible...
105
Voted
AI
2010
Springer
15 years 27 days ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...