3931 search results - page 495 / 787 » Separation logic and abstraction |
165
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
164
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
170
click to vote
ICFP
2002
ACM
16 years 7 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
198
click to vote
LATA
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
183
click to vote
ICWS
2009
IEEE
16 years 4 months ago
2009
IEEE
Abstract—Several approaches have been proposed to introduce self-management capabilities for web service compositions. However, most of these works are limited as they are not ex...