๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Abstraction in Algorithmic Logic

โœ Scribed by Wayne Aitken; Jeffrey A. Barrett

Publisher
Springer Netherlands
Year
2007
Tongue
English
Weight
413 KB
Volume
37
Category
Article
ISSN
0022-3611

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Completeness of algorithmic logic
Completeness of algorithmic logic
โœ B. A. Trakhtenbrot ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Springer US ๐ŸŒ English โš– 555 KB
Stability and Paradox in Algorithmic Log
Stability and Paradox in Algorithmic Logic
โœ Wayne Aitken; Jeffrey A. Barrett ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 424 KB
Predicate abstraction in a program logic
Predicate abstraction in a program logic calculus
โœ Benjamin WeiรŸ ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 335 KB

Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. This paper explores a way to integrate predicate abstraction into a calculus for deductive program verification based on symbolic exe

On the Decidability of Propositional Alg
On the Decidability of Propositional Algorithmic Logic
โœ Bogdan S. Chlebus ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 802 KB

ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGIC by BOGDAN S. CHLEBIJS in Warsaw (Po1and)l) 0. Introduction Let PAL be a n abbreviation for propositional algorithmic logic. The investigation of PAL is a continuation of earlier works on algorithmic logic (GRABOWSKI [3], KRECZMAR [5], SALWICKI [