Results 131 to 140 of about 12,151 (175)
Gerión, 2009 Les attributs les plus fréquents du Mercure gaulois sont le caducée, la bourse, le coq et le bouc (ou le bélier). L'analyse de ces attributs, qui sont occasionnellement associés à d'autres divinités, montre que leurs functions concernaient le cycle de la
Adolfo Zavaroni
doaj
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, 2013 We describe a Coq formalization of a subset of the x86 architecture. One emphasis of the model is brevity: using dependent types, type classes and notation we give the x86 semantics a makeover that counters its reputation for baroqueness. We model bits, bytes, and memory concretely using functions that can be computed inside Coq itself; concrete ...
Andrew Kennedy +3 more
openaire +3 more sources
, 2000 We describe an implementation and a proof of correctness of binary decision diagrams (BDDs), completely formalized in Coq. This allows us to run BDD-based algorithms inside Coq and paves the way for a smooth integration of symbolic model checking in the Coq proof assistant by using reflection.
Kumar Neeraj Verma +3 more
core +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE), 2019
Mutation analysis, which introduces artificial defects into software systems, is the basis of mutation testing, a technique widely applied to evaluate and enhance the quality of test suites. However, despite the deep analogy between tests and formal proofs, mutation analysis has seldom been considered in the context of deductive verification.
Ahmet Çelik +4 more
openaire +1 more source
Mutation analysis, which introduces artificial defects into software systems, is the basis of mutation testing, a technique widely applied to evaluate and enhance the quality of test suites. However, despite the deep analogy between tests and formal proofs, mutation analysis has seldom been considered in the context of deductive verification.
Ahmet Çelik +4 more
openaire +1 more source
2001
Fusion theorem is a classical result that allows the simplification of the morphisms among homogeneus structures [10]. We present this theorem and some generalizations in the context of the constructive proof assistant tool Coq [2] where we have dependent types and parametric polymorphism.
José Luis Freire +3 more
openaire +1 more source
Fusion theorem is a classical result that allows the simplification of the morphisms among homogeneus structures [10]. We present this theorem and some generalizations in the context of the constructive proof assistant tool Coq [2] where we have dependent types and parametric polymorphism.
José Luis Freire +3 more
openaire +1 more source
Proceedings of the ACM SIGPLAN workshop on Generic programming, 2008
The aim of our work is to provide an infrastructure for formal proofs over Generic Haskell-style polytypic programs. For this goal to succeed, we must have a definition of polytypic programming which is both fully formal and as close as possible to the definition in Generic Haskell.
Wendy Verbruggen +2 more
openaire +1 more source
The aim of our work is to provide an infrastructure for formal proofs over Generic Haskell-style polytypic programs. For this goal to succeed, we must have a definition of polytypic programming which is both fully formal and as close as possible to the definition in Generic Haskell.
Wendy Verbruggen +2 more
openaire +1 more source
2004
The need for formal methods for certifying the good behaviour of computer software is dramatically increasing with the growing complexity of the latter. Moreover, in the global computing framework one must face the additional issues of concurrency and mobility.
HONSELL, Furio, SCAGNETTO, Ivan
openaire +1 more source
The need for formal methods for certifying the good behaviour of computer software is dramatically increasing with the growing complexity of the latter. Moreover, in the global computing framework one must face the additional issues of concurrency and mobility.
HONSELL, Furio, SCAGNETTO, Ivan
openaire +1 more source
2019
Program calculation, a programming technique to derive efficient programs from naive ones by program transformation, is challenging for program optimization. Tesson et al. have shown that Coq, a popular proof assistant, provides a cost-effective way to implement a powerful system for verifying correctness of program transformations, but their ...
Kosuke Murata, Kento Emoto
openaire +1 more source
Program calculation, a programming technique to derive efficient programs from naive ones by program transformation, is challenging for program optimization. Tesson et al. have shown that Coq, a popular proof assistant, provides a cost-effective way to implement a powerful system for verifying correctness of program transformations, but their ...
Kosuke Murata, Kento Emoto
openaire +1 more source
2007
Equational reasoning in Coq is not straightforward. For a few years now there has been an ongoing research process towards adding rewriting to Coq. However, there are many research problems on this way. In this paper we give a coherent view of rewriting in Coq, we describe what is already done and what remains to be done.
Jacek Chrzaszcz +1 more
openaire +1 more source
Equational reasoning in Coq is not straightforward. For a few years now there has been an ongoing research process towards adding rewriting to Coq. However, there are many research problems on this way. In this paper we give a coherent view of rewriting in Coq, we describe what is already done and what remains to be done.
Jacek Chrzaszcz +1 more
openaire +1 more source