1799 search results - page 38 / 360 » The Logic of Correctness in Software Engineering |
171
Voted
ENTCS
2008
15 years 5 months ago
2008
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
179
Voted
JSW
2007
15 years 5 months ago
2007
— Model-driven engineering (MDE) techniques are increasingly being used to address many of the development and operational lifecycle concerns of large-scale component-based syste...
168
click to vote
PPDP
2007
Springer
15 years 12 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
173
click to vote
AMAST
2006
Springer
15 years 9 months ago
2006
Springer
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
143
click to vote
KBSE
2007
IEEE
16 years 2 days ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...