438 search results - page 65 / 88 » On theorem proving in annotated logics |
CSL
2007
Springer
15 years 3 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
74
Voted
ESA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
114
click to vote
ECOWS
2008
Springer
14 years 11 months ago
2008
Springer
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
PPDP
2007
Springer
15 years 3 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
80
Voted
ICFEM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...