439 search results - page 29 / 88 » Instantiation-Based Automated Reasoning: From Theory to Prac... |
127
click to vote
CADE
2008
Springer
16 years 2 months ago
2008
Springer
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
104
click to vote
CSL
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
235
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...
105
Voted
KR
2004
Springer
15 years 7 months ago
2004
Springer
Causation is defined recursively: event e is the cause of condition φ in context c iff e is the only sufficient cause of φ in c, and removing e from c either removes φ from c...
119
Voted
CSL
2010
Springer
15 years 3 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...