213 search results - page 18 / 43 » A framework for checking proofs naturally |
JFPLC
2004
13 years 9 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
PLDI
2009
ACM
14 years 8 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
POPL
2010
ACM
13 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 ...
ASM
2010
ASM
14 years 2 months ago
2010
ASM
and formal model, named Kmelia [1,2], with an associated language to specify components, their provided and required services and their assemblies; we also developed a framework na...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...