3468 search results - page 467 / 694 » An open logical framework |
154
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
134
click to vote
CACM
2010
15 years 1 months ago
2010
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
157
click to vote
ENTCS
2010
15 years 1 months ago
2010
Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism. We explore a formal approach for black-box testing by...
157
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
266
Voted
POPL
2002
ACM
16 years 4 months ago
2002
ACM
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...