3319 search results - page 293 / 664 » Subshifts, Languages and Logic |
169
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Querying any information system requires the knowledge of some formal language, making it inaccessible to computer-na?ve potential users. We propose a new intuitive querying mecha...
179
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
187
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
178
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
140
click to vote
WOLLIC
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...