4099 search results - page 352 / 820 » A Framework for Interactive Proof |
200
click to vote
KI
1990
Springer
15 years 10 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
163
click to vote
FMCO
2008
Springer
15 years 8 months ago
2008
Springer
The Bytecode Modeling Language (BML) is a specication for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML s...
199
click to vote
POPL
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
163
click to vote
FAC
2008
15 years 6 months ago
2008
The Mondex case study about the specification and refinement of an electronic purse as defined in the Oxford Technical Monograph PRG-126 has recently been proposed as a challenge f...