315 search results - page 10 / 63 » Reasoning about Assignments in Recursive Data Structures |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
VMCAI
2010
Springer
15 years 6 months ago
2010
Springer
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
118
click to vote
CADE
1998
Springer
15 years 1 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
87
Voted
AIM
2004
14 years 9 months ago
2004
Reasoning about spatial data is a key task in many applications, including geographic information systems, meteorological and fluid flow analysis, computer-aided design, and prote...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...