Sciweavers

858 search results - page 95 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 7 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ICFP
2005
ACM
16 years 3 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
DLOG
1996
15 years 4 months ago
Towards a Legal Reasoning System based on Description Logics: A Position Paper
fe. Althoughthose legal concepts are abstract in the sense that there always exist possibilities to interpret them in various ways, lawyers seem to understand themas real things at...
Makoto Haraguchi
CADE
2002
Springer
16 years 3 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ATVA
2008
Springer
144views Hardware» more  ATVA 2008»
15 years 5 months ago
Tests, Proofs and Refinements
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
Sriram K. Rajamani