Sciweavers

101 search results - page 16 / 21
» Generating Text with a Theorem Prover
Sort
View
105
Voted
SAT
2010
Springer
125views Hardware» more  SAT 2010»
15 years 4 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
CADE
2010
Springer
15 years 1 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak
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
TAP
2008
Springer
93views Hardware» more  TAP 2008»
15 years 7 days ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux
ICWS
2004
IEEE
15 years 1 months ago
Logic-based Web Services Composition: From Service Description to Process Model
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
Jinghai Rao, Peep Küngas, Mihhail Matskin