13383 search results - page 97 / 2677 » Abstractions from proofs |
186
click to vote
TACAS
2012
Springer
14 years 18 days ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
139
Voted
PERVASIVE
2006
Springer
15 years 5 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...
135
click to vote
CADE
2008
Springer
16 years 5 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
238
click to vote
COGSYS
2005
Springer
15 years 7 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 ...
117
click to vote
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...