2225 search results - page 224 / 445 » Logical Structures in the Lexicon |
186
click to vote
PPDP
2007
Springer
16 years 21 days 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...
150
click to vote
IWPC
2006
IEEE
16 years 18 days ago
2006
IEEE
For many enterprises, reacting to fast changes to their business process is key to maintaining their competitive edge in the market. However, developers often must manually locate...
188
click to vote
UML
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The CASE tool ArgoUWE supports the systematic design of Web applications using the UML-based Web Engineering (UWE) approach. The design methodology of UWE is based on a m...
151
click to vote
APAL
2010
15 years 6 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
220
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...