3333 search results - page 67 / 667 » Abstract Proof Search |
115
click to vote
PERVASIVE
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
151
click to vote
LPAR
2012
Springer
13 years 10 months ago
2012
Springer
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
126
Voted
GI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
201
Voted
COGSYS
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...
119
Voted
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...