91 search results - page 8 / 19 » Reducts of Propositional Theories, Satisfiability Relations,... |
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
KR
2004
Springer
14 years 26 days ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...