1814 search results - page 159 / 363 » Extended First-Order Logic |
127
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—We investigate the design of a clean-slate control and nt plane for data networks using the abstraction of 4D architecture, utilizing and extending 4D’s concept of logically c...
134
Voted
JAPLL
2010
15 years 2 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
114
click to vote
FAC
2010
15 years 27 days ago
2010
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
154
Voted
JAR
2010
14 years 10 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
132
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...