Sciweavers

215 search results - page 29 / 43
» Connecting a Logical Framework to a First-Order Logic Prover
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 3 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
105
Voted
CADE
2007
Springer
15 years 12 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
COMMA
2008
15 years 1 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter
ESOP
2005
Springer
15 years 5 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
FUZZY
2004
Springer
134views Fuzzy Logic» more  FUZZY 2004»
15 years 3 months ago
Ubiquitous Robot
- The UPnP(Universal Plug and Play) architecture offers pervasive peer-to-peer network connectivity of intelligent appliances in dynamic distributed computing environment. This pap...
Jong-Hwan Kim