Sciweavers

159 search results - page 23 / 32
» Structural abstract interpretation, A formal study using Coq
Sort
View
DLOG
2011
14 years 1 months ago
Concept Model Semantics for DL Preferential Reasoning
Abstract. The preferential and rational consequence relations first studied by Lehmann and colleagues play a central role in non-monotonic reasoning, not least because they provid...
Arina Britz, Thomas Meyer, Ivan José Varzin...
LISP
2006
105views more  LISP 2006»
14 years 9 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
88
Voted
RECOMB
2005
Springer
15 years 10 months ago
The Factor Graph Network Model for Biological Systems
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
BIRTHDAY
2006
Springer
15 years 1 months ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle
EMSOFT
2004
Springer
15 years 1 months ago
A methodology for generating verified combinatorial circuits
High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description l...
Oleg Kiselyov, Kedar N. Swadi, Walid Taha